/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-21b0908 [2022-07-22 12:53:02,260 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 12:53:02,264 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 12:53:02,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 12:53:02,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 12:53:02,322 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 12:53:02,330 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 12:53:02,335 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 12:53:02,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 12:53:02,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 12:53:02,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 12:53:02,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 12:53:02,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 12:53:02,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 12:53:02,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 12:53:02,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 12:53:02,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 12:53:02,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 12:53:02,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 12:53:02,374 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 12:53:02,377 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 12:53:02,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 12:53:02,380 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 12:53:02,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 12:53:02,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 12:53:02,393 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 12:53:02,394 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 12:53:02,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 12:53:02,395 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 12:53:02,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 12:53:02,397 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 12:53:02,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 12:53:02,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 12:53:02,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 12:53:02,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 12:53:02,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 12:53:02,403 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 12:53:02,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 12:53:02,405 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 12:53:02,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 12:53:02,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 12:53:02,409 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 12:53:02,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-syntacticLbe.epf [2022-07-22 12:53:02,467 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 12:53:02,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 12:53:02,470 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 12:53:02,470 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 12:53:02,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 12:53:02,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 12:53:02,473 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 12:53:02,473 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-22 12:53:02,473 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-22 12:53:02,475 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-22 12:53:02,475 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-22 12:53:02,475 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-22 12:53:02,475 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-22 12:53:02,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 12:53:02,476 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 12:53:02,476 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-22 12:53:02,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 12:53:02,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 12:53:02,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 12:53:02,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-22 12:53:02,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-22 12:53:02,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-22 12:53:02,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 12:53:02,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 12:53:02,479 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-22 12:53:02,479 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 12:53:02,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-22 12:53:02,480 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 12:53:02,480 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 12:53:02,481 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 12:53:02,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 12:53:02,481 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-07-22 12:53:02,484 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-22 12:53:02,484 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-22 12:53:02,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 12:53:02,929 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 12:53:02,932 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 12:53:02,933 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 12:53:02,939 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 12:53:02,940 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2022-07-22 12:53:03,031 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e761a55/eb8b899b138a4960814db5dd4e862298/FLAGe087be23c [2022-07-22 12:53:03,671 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 12:53:03,672 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_ok.i [2022-07-22 12:53:03,693 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e761a55/eb8b899b138a4960814db5dd4e862298/FLAGe087be23c [2022-07-22 12:53:03,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e761a55/eb8b899b138a4960814db5dd4e862298 [2022-07-22 12:53:03,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 12:53:03,968 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-22 12:53:03,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 12:53:03,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 12:53:03,977 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 12:53:03,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:53:03" (1/1) ... [2022-07-22 12:53:03,979 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@393f8feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:03, skipping insertion in model container [2022-07-22 12:53:03,980 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 12:53:03" (1/1) ... [2022-07-22 12:53:03,989 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 12:53:04,064 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 12:53:04,596 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-deagle/arithmetic_prog_ok.i[39757,39770] [2022-07-22 12:53:04,597 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:53:04,612 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 12:53:04,663 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-deagle/arithmetic_prog_ok.i[39757,39770] [2022-07-22 12:53:04,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 12:53:04,734 INFO L208 MainTranslator]: Completed translation [2022-07-22 12:53:04,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04 WrapperNode [2022-07-22 12:53:04,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 12:53:04,736 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 12:53:04,736 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 12:53:04,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 12:53:04,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,805 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,868 INFO L137 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-07-22 12:53:04,869 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 12:53:04,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 12:53:04,870 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 12:53:04,870 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 12:53:04,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,885 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,899 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 12:53:04,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 12:53:04,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 12:53:04,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 12:53:04,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (1/1) ... [2022-07-22 12:53:04,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:04,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:04,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:04,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-22 12:53:05,025 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 12:53:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 12:53:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-22 12:53:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-22 12:53:05,026 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-22 12:53:05,026 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-22 12:53:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-22 12:53:05,027 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-22 12:53:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-22 12:53:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-22 12:53:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 12:53:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 12:53:05,027 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 12:53:05,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 12:53:05,029 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-22 12:53:05,147 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 12:53:05,150 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 12:53:05,456 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 12:53:05,467 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 12:53:05,467 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-22 12:53:05,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:53:05 BoogieIcfgContainer [2022-07-22 12:53:05,470 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 12:53:05,471 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-22 12:53:05,471 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-22 12:53:05,476 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-22 12:53:05,477 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:53:05,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.07 12:53:03" (1/3) ... [2022-07-22 12:53:05,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65aadfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:53:05, skipping insertion in model container [2022-07-22 12:53:05,478 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:53:05,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 12:53:04" (2/3) ... [2022-07-22 12:53:05,479 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@65aadfd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.07 12:53:05, skipping insertion in model container [2022-07-22 12:53:05,479 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-22 12:53:05,479 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 12:53:05" (3/3) ... [2022-07-22 12:53:05,481 INFO L322 chiAutomizerObserver]: Analyzing ICFG arithmetic_prog_ok.i [2022-07-22 12:53:05,592 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-22 12:53:05,633 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 136 transitions, 288 flow [2022-07-22 12:53:05,693 INFO L129 PetriNetUnfolder]: 10/132 cut-off events. [2022-07-22 12:53:05,693 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:53:05,699 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 132 events. 10/132 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 141 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 85. Up to 3 conditions per place. [2022-07-22 12:53:05,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 136 transitions, 288 flow [2022-07-22 12:53:05,709 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 132 transitions, 276 flow [2022-07-22 12:53:05,714 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-07-22 12:53:05,725 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 132 transitions, 276 flow [2022-07-22 12:53:05,729 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 132 transitions, 276 flow [2022-07-22 12:53:05,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 132 transitions, 276 flow [2022-07-22 12:53:05,766 INFO L129 PetriNetUnfolder]: 10/132 cut-off events. [2022-07-22 12:53:05,766 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-22 12:53:05,767 INFO L84 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 132 events. 10/132 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 142 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 85. Up to 3 conditions per place. [2022-07-22 12:53:05,777 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2022-07-22 12:53:12,864 INFO L131 LiptonReduction]: Checked pairs total: 4371 [2022-07-22 12:53:12,864 INFO L133 LiptonReduction]: Total number of compositions: 114 [2022-07-22 12:53:12,886 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2022-07-22 12:53:12,886 INFO L301 stractBuchiCegarLoop]: Hoare is false [2022-07-22 12:53:12,886 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-22 12:53:12,886 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-22 12:53:12,886 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-22 12:53:12,887 INFO L305 stractBuchiCegarLoop]: Difference is false [2022-07-22 12:53:12,887 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-22 12:53:12,887 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-22 12:53:12,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-22 12:53:12,993 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-22 12:53:12,994 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:12,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:13,002 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:53:13,002 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:53:13,003 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-22 12:53:13,003 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 221 states, but on-demand construction may add more states [2022-07-22 12:53:13,033 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-22 12:53:13,033 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:13,034 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:13,034 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:53:13,034 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2022-07-22 12:53:13,043 INFO L748 eck$LassoCheckResult]: Stem: 134#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 137#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 139#[L913-4, thread1ENTRY]don't care [442] thread1ENTRY-->L878-2: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_29 0) (= |v_thread1Thread1of1ForFork1_#in~arg.offset_5| v_thread1Thread1of1ForFork1_~arg.offset_5) (= |v_thread1Thread1of1ForFork1_#in~arg.base_5| v_thread1Thread1of1ForFork1_~arg.base_5)) InVars {thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_5, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_5, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_~i~0] 143#[L913-4, L878-2]don't care [2022-07-22 12:53:13,048 INFO L750 eck$LassoCheckResult]: Loop: 143#[L913-4, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#m~0.base_51|))) (and (= (select .cse0 |v_~#m~0.offset_51|) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#m~0.base_51| (store .cse0 |v_~#m~0.offset_51| 1))) (< v_thread1Thread1of1ForFork1_~i~0_33 4))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_11|, #pthreadsMutex=|v_#pthreadsMutex_55|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 149#[L913-4, L880-2]don't care [448] L880-2-->L882-1: Formula: false InVars {} OutVars{thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_13|, ~num~0=v_~num~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post6, ~num~0] 163#[L913-4, L882-1]don't care [396] L882-1-->L885: Formula: (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_33| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_33|) |v_~#m~0.offset_33| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_9|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_#t~post6] 189#[L913-4, L885]don't care [436] L885-->L878-2: Formula: (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~post7] 143#[L913-4, L878-2]don't care [2022-07-22 12:53:13,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:13,058 INFO L85 PathProgramCache]: Analyzing trace with hash 503789, now seen corresponding path program 1 times [2022-07-22 12:53:13,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:13,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203513685] [2022-07-22 12:53:13,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:13,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,246 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,361 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:13,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:13,364 INFO L85 PathProgramCache]: Analyzing trace with hash 14772711, now seen corresponding path program 1 times [2022-07-22 12:53:13,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:13,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438377923] [2022-07-22 12:53:13,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:13,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:13,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:13,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:53:13,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:53:13,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438377923] [2022-07-22 12:53:13,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438377923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:53:13,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:53:13,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:53:13,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111707030] [2022-07-22 12:53:13,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:53:13,482 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-07-22 12:53:13,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:53:13,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 12:53:13,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 12:53:13,512 INFO L87 Difference]: Start difference. First operand currently 221 states, but on-demand construction may add more states Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:53:13,573 INFO L93 Difference]: Finished difference Result 222 states and 572 transitions. [2022-07-22 12:53:13,574 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 222 states and 572 transitions. [2022-07-22 12:53:13,579 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-22 12:53:13,591 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 222 states to 216 states and 561 transitions. [2022-07-22 12:53:13,592 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 216 [2022-07-22 12:53:13,598 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 216 [2022-07-22 12:53:13,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 216 states and 561 transitions. [2022-07-22 12:53:13,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-22 12:53:13,604 INFO L220 hiAutomatonCegarLoop]: Abstraction has 216 states and 561 transitions. [2022-07-22 12:53:13,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states and 561 transitions. [2022-07-22 12:53:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2022-07-22 12:53:13,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 216 states have (on average 2.5972222222222223) internal successors, (561), 215 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:13,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 561 transitions. [2022-07-22 12:53:13,673 INFO L242 hiAutomatonCegarLoop]: Abstraction has 216 states and 561 transitions. [2022-07-22 12:53:13,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 12:53:13,678 INFO L425 stractBuchiCegarLoop]: Abstraction has 216 states and 561 transitions. [2022-07-22 12:53:13,679 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-22 12:53:13,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 216 states and 561 transitions. [2022-07-22 12:53:13,682 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 202 [2022-07-22 12:53:13,682 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:13,682 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:13,682 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-22 12:53:13,682 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:53:13,683 INFO L748 eck$LassoCheckResult]: Stem: 1236#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 1182#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 1184#[L913-4, thread1ENTRY]don't care [442] thread1ENTRY-->L878-2: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_29 0) (= |v_thread1Thread1of1ForFork1_#in~arg.offset_5| v_thread1Thread1of1ForFork1_~arg.offset_5) (= |v_thread1Thread1of1ForFork1_#in~arg.base_5| v_thread1Thread1of1ForFork1_~arg.base_5)) InVars {thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_5, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_5, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_~i~0] 898#[L913-4, L878-2]don't care [2022-07-22 12:53:13,684 INFO L750 eck$LassoCheckResult]: Loop: 898#[L913-4, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#m~0.base_51|))) (and (= (select .cse0 |v_~#m~0.offset_51|) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#m~0.base_51| (store .cse0 |v_~#m~0.offset_51| 1))) (< v_thread1Thread1of1ForFork1_~i~0_33 4))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_11|, #pthreadsMutex=|v_#pthreadsMutex_55|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 902#[L913-4, L880-2]don't care [322] L880-2-->L880-3: Formula: (not (< 0 v_~num~0_1)) InVars {~num~0=v_~num~0_1} OutVars{~num~0=v_~num~0_1} AuxVars[] AssignedVars[] 946#[L913-4, L880-3]don't care [324] L880-3-->L882: Formula: (= |v_thread1Thread1of1ForFork1_#t~post6_1| v_~num~0_3) InVars {~num~0=v_~num~0_3} OutVars{~num~0=v_~num~0_3, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post6] 950#[L913-4, L882]don't care [326] L882-->L882-1: Formula: (= v_~num~0_4 (+ |v_thread1Thread1of1ForFork1_#t~post6_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_3|} OutVars{~num~0=v_~num~0_4, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_3|} AuxVars[] AssignedVars[~num~0] 1064#[L913-4, L882-1]don't care [396] L882-1-->L885: Formula: (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_33| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_33|) |v_~#m~0.offset_33| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_9|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_#t~post6] 1068#[L913-4, L885]don't care [436] L885-->L878-2: Formula: (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~post7] 898#[L913-4, L878-2]don't care [2022-07-22 12:53:13,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash 503789, now seen corresponding path program 2 times [2022-07-22 12:53:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:13,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899558247] [2022-07-22 12:53:13,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:13,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,716 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:13,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1193071787, now seen corresponding path program 1 times [2022-07-22 12:53:13,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:13,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750412402] [2022-07-22 12:53:13,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:13,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,768 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,776 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:13,777 INFO L85 PathProgramCache]: Analyzing trace with hash 212067223, now seen corresponding path program 1 times [2022-07-22 12:53:13,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:13,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692572926] [2022-07-22 12:53:13,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:13,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,829 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:13,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:13,894 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:15,476 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:53:15,477 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:53:15,477 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:53:15,477 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:53:15,478 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:53:15,478 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:15,478 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:53:15,478 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:53:15,478 INFO L133 ssoRankerPreferences]: Filename of dumped script: arithmetic_prog_ok.i_BEv2_Iteration2_Lasso [2022-07-22 12:53:15,478 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:53:15,479 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:53:15,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,572 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,587 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,597 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:15,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:19,757 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:53:19,763 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:53:19,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:19,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:19,767 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:19,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-07-22 12:53:19,781 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:19,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:19,790 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:53:19,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:19,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:19,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:19,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:53:19,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:53:19,804 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:19,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:19,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:19,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:19,835 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:19,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-07-22 12:53:19,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:19,851 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:19,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:53:19,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:19,852 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:19,852 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:19,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:53:19,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:53:19,867 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:19,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:19,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:19,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:19,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:19,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-07-22 12:53:19,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:19,915 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:19,916 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:19,916 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:19,916 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:19,919 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:19,919 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:19,933 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:19,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:19,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:19,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:19,969 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:19,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-07-22 12:53:19,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:19,979 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:19,979 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:53:19,979 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:19,980 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:19,980 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:19,980 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:53:19,980 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:53:19,994 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:20,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-07-22 12:53:20,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:20,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:20,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:20,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-07-22 12:53:20,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:20,035 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:20,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:20,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:20,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:20,040 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:20,040 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:20,062 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:53:20,082 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 12:53:20,083 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 4 variables to zero. [2022-07-22 12:53:20,085 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:20,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:20,102 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:20,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-07-22 12:53:20,140 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:53:20,166 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:53:20,167 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:53:20,168 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0) = -2*thread1Thread1of1ForFork1_~i~0 + 7 Supporting invariants [] [2022-07-22 12:53:20,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:20,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:24,067 INFO L257 tatePredicateManager]: 351 out of 351 supporting invariants were superfluous and have been removed [2022-07-22 12:53:24,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:24,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:53:24,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:53:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:24,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:53:24,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:53:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:53:24,169 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:53:24,171 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 216 states and 561 transitions. cyclomatic complexity: 359 Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:24,335 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 216 states and 561 transitions. cyclomatic complexity: 359. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 584 states and 1627 transitions. Complement of second has 5 states. [2022-07-22 12:53:24,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:53:24,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:24,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-07-22 12:53:24,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 3 letters. Loop has 6 letters. [2022-07-22 12:53:24,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:24,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 9 letters. Loop has 6 letters. [2022-07-22 12:53:24,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:24,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 38 transitions. Stem has 3 letters. Loop has 12 letters. [2022-07-22 12:53:24,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:24,341 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 584 states and 1627 transitions. [2022-07-22 12:53:24,351 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 310 [2022-07-22 12:53:24,361 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 584 states to 576 states and 1605 transitions. [2022-07-22 12:53:24,361 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 359 [2022-07-22 12:53:24,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 416 [2022-07-22 12:53:24,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 576 states and 1605 transitions. [2022-07-22 12:53:24,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:53:24,365 INFO L220 hiAutomatonCegarLoop]: Abstraction has 576 states and 1605 transitions. [2022-07-22 12:53:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states and 1605 transitions. [2022-07-22 12:53:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 520. [2022-07-22 12:53:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 520 states have (on average 2.7596153846153846) internal successors, (1435), 519 states have internal predecessors, (1435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:24,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 1435 transitions. [2022-07-22 12:53:24,402 INFO L242 hiAutomatonCegarLoop]: Abstraction has 520 states and 1435 transitions. [2022-07-22 12:53:24,403 INFO L425 stractBuchiCegarLoop]: Abstraction has 520 states and 1435 transitions. [2022-07-22 12:53:24,403 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-22 12:53:24,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 520 states and 1435 transitions. [2022-07-22 12:53:24,408 INFO L131 ngComponentsAnalysis]: Automaton has 29 accepting balls. 310 [2022-07-22 12:53:24,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:24,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:24,409 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:53:24,409 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:53:24,410 INFO L748 eck$LassoCheckResult]: Stem: 4081#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 3933#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 3935#[L913-4, thread1ENTRY]don't care [442] thread1ENTRY-->L878-2: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_29 0) (= |v_thread1Thread1of1ForFork1_#in~arg.offset_5| v_thread1Thread1of1ForFork1_~arg.offset_5) (= |v_thread1Thread1of1ForFork1_#in~arg.base_5| v_thread1Thread1of1ForFork1_~arg.base_5)) InVars {thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_5, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_5, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_~i~0] 3421#[L913-4, L878-2]don't care [466] L913-4-->L914-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|))) |v_#memory_$Pointer$.base_16|) (= |v_ULTIMATE.start_main_#t~pre14#1_21| |v_#pthreadsForks_24|) (= (select |v_#valid_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#memory_$Pointer$.offset_16| (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|)))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre14#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_66| |v_ULTIMATE.start_main_~#t2~0#1.base_31|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_98|, #length=|v_#length_66|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_21|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_66|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, #memory_$Pointer$.base, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1, #memory_$Pointer$.offset] 3423#[L914-3, L878-2]don't care [2022-07-22 12:53:24,410 INFO L750 eck$LassoCheckResult]: Loop: 3423#[L914-3, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#m~0.base_51|))) (and (= (select .cse0 |v_~#m~0.offset_51|) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#m~0.base_51| (store .cse0 |v_~#m~0.offset_51| 1))) (< v_thread1Thread1of1ForFork1_~i~0_33 4))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_11|, #pthreadsMutex=|v_#pthreadsMutex_55|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 4149#[L880-2, L914-3]don't care [322] L880-2-->L880-3: Formula: (not (< 0 v_~num~0_1)) InVars {~num~0=v_~num~0_1} OutVars{~num~0=v_~num~0_1} AuxVars[] AssignedVars[] 4147#[L880-3, L914-3]don't care [324] L880-3-->L882: Formula: (= |v_thread1Thread1of1ForFork1_#t~post6_1| v_~num~0_3) InVars {~num~0=v_~num~0_3} OutVars{~num~0=v_~num~0_3, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~post6] 3901#[L882, L914-3]don't care [326] L882-->L882-1: Formula: (= v_~num~0_4 (+ |v_thread1Thread1of1ForFork1_#t~post6_3| 1)) InVars {thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_3|} OutVars{~num~0=v_~num~0_4, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_3|} AuxVars[] AssignedVars[~num~0] 3903#[L882-1, L914-3]don't care [396] L882-1-->L885: Formula: (= |v_#pthreadsMutex_31| (store |v_#pthreadsMutex_32| |v_~#m~0.base_33| (store (select |v_#pthreadsMutex_32| |v_~#m~0.base_33|) |v_~#m~0.offset_33| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_32|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_31|, ~#m~0.base=|v_~#m~0.base_33|, ~#m~0.offset=|v_~#m~0.offset_33|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_9|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_#t~post6] 4293#[L885, L914-3]don't care [436] L885-->L878-2: Formula: (= v_thread1Thread1of1ForFork1_~i~0_25 (+ v_thread1Thread1of1ForFork1_~i~0_26 1)) InVars {thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_26} OutVars{thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_25, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_11|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~post7] 3423#[L914-3, L878-2]don't care [2022-07-22 12:53:24,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:24,411 INFO L85 PathProgramCache]: Analyzing trace with hash 15617925, now seen corresponding path program 1 times [2022-07-22 12:53:24,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:24,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483138874] [2022-07-22 12:53:24,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:24,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:24,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:24,440 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:24,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:24,489 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:24,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:24,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1193071787, now seen corresponding path program 2 times [2022-07-22 12:53:24,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:24,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133185411] [2022-07-22 12:53:24,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:24,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:24,506 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:24,521 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:24,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:24,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1333104337, now seen corresponding path program 1 times [2022-07-22 12:53:24,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:24,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352267111] [2022-07-22 12:53:24,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:24,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:24,575 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:24,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:24,622 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:26,894 INFO L210 LassoAnalysis]: Preferences: [2022-07-22 12:53:26,894 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-22 12:53:26,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-22 12:53:26,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-22 12:53:26,895 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-22 12:53:26,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:26,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-22 12:53:26,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-22 12:53:26,896 INFO L133 ssoRankerPreferences]: Filename of dumped script: arithmetic_prog_ok.i_BEv2_Iteration3_Lasso [2022-07-22 12:53:26,896 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-22 12:53:26,896 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-22 12:53:26,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:26,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:27,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:27,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:27,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:27,016 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:27,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:31,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:31,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:31,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:31,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:31,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:31,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:31,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:31,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-22 12:53:31,798 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-22 12:53:31,798 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-22 12:53:31,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:31,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:31,804 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:31,809 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:31,817 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:31,817 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-22 12:53:31,818 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:31,818 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:31,818 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:31,818 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-22 12:53:31,819 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-22 12:53:31,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-07-22 12:53:31,820 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:31,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:31,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:31,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:31,855 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:31,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-07-22 12:53:31,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:31,863 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:31,863 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:31,863 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:31,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:31,867 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:31,867 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:31,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:31,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:31,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:31,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:31,894 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:31,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-07-22 12:53:31,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:31,911 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:31,911 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:31,911 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:31,911 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:31,913 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:31,913 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:31,916 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:31,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:31,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:31,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:31,940 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:31,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:31,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-07-22 12:53:31,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:31,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:31,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:31,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:31,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:31,960 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:31,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:31,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:31,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:31,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:31,990 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:31,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-07-22 12:53:31,994 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:32,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:32,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:32,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:32,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:32,002 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:32,002 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:32,005 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:32,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:32,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:32,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:32,027 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:32,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-07-22 12:53:32,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:32,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:32,038 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:32,038 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:32,038 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:32,039 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:32,039 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:32,042 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:32,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:32,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:32,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:32,070 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:32,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-07-22 12:53:32,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:32,078 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:32,078 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:32,078 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:32,078 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:32,079 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:32,079 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:32,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:32,104 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:32,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:32,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:32,106 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:32,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-07-22 12:53:32,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:32,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:32,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:32,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:32,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:32,117 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:32,117 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:32,138 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-22 12:53:32,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-07-22 12:53:32,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:32,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:32,161 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:32,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-07-22 12:53:32,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-07-22 12:53:32,175 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-22 12:53:32,175 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-22 12:53:32,175 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-22 12:53:32,175 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-22 12:53:32,177 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-22 12:53:32,177 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-22 12:53:32,181 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-22 12:53:32,190 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2022-07-22 12:53:32,190 INFO L444 ModelExtractionUtils]: 1 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2022-07-22 12:53:32,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-22 12:53:32,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 12:53:32,191 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-22 12:53:32,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-07-22 12:53:32,194 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-22 12:53:32,201 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-22 12:53:32,201 INFO L513 LassoAnalysis]: Proved termination. [2022-07-22 12:53:32,201 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0) = -2*thread1Thread1of1ForFork1_~i~0 + 7 Supporting invariants [] [2022-07-22 12:53:32,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-07-22 12:53:32,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-07-22 12:53:35,999 INFO L257 tatePredicateManager]: 381 out of 381 supporting invariants were superfluous and have been removed [2022-07-22 12:53:36,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:36,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:36,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 12:53:36,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:53:36,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:36,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 12:53:36,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 12:53:36,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:53:36,079 INFO L142 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-07-22 12:53:36,080 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 520 states and 1435 transitions. cyclomatic complexity: 952 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-22 12:53:36,173 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 520 states and 1435 transitions. cyclomatic complexity: 952. 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) Result 881 states and 2442 transitions. Complement of second has 5 states. [2022-07-22 12:53:36,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-07-22 12:53:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. 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-22 12:53:36,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2022-07-22 12:53:36,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 4 letters. Loop has 6 letters. [2022-07-22 12:53:36,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:36,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 10 letters. Loop has 6 letters. [2022-07-22 12:53:36,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:36,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 35 transitions. Stem has 4 letters. Loop has 12 letters. [2022-07-22 12:53:36,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-22 12:53:36,176 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 881 states and 2442 transitions. [2022-07-22 12:53:36,187 INFO L131 ngComponentsAnalysis]: Automaton has 43 accepting balls. 415 [2022-07-22 12:53:36,199 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 881 states to 873 states and 2420 transitions. [2022-07-22 12:53:36,199 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 484 [2022-07-22 12:53:36,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 553 [2022-07-22 12:53:36,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 873 states and 2420 transitions. [2022-07-22 12:53:36,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:53:36,202 INFO L220 hiAutomatonCegarLoop]: Abstraction has 873 states and 2420 transitions. [2022-07-22 12:53:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states and 2420 transitions. [2022-07-22 12:53:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 512. [2022-07-22 12:53:36,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 512 states, 512 states have (on average 2.767578125) internal successors, (1417), 511 states have internal predecessors, (1417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 512 states and 1417 transitions. [2022-07-22 12:53:36,233 INFO L242 hiAutomatonCegarLoop]: Abstraction has 512 states and 1417 transitions. [2022-07-22 12:53:36,233 INFO L425 stractBuchiCegarLoop]: Abstraction has 512 states and 1417 transitions. [2022-07-22 12:53:36,233 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-22 12:53:36,233 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 512 states and 1417 transitions. [2022-07-22 12:53:36,237 INFO L131 ngComponentsAnalysis]: Automaton has 28 accepting balls. 302 [2022-07-22 12:53:36,237 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:36,237 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:36,238 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-22 12:53:36,238 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:53:36,238 INFO L748 eck$LassoCheckResult]: Stem: 7550#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 7424#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 7426#[L913-4, thread1ENTRY]don't care [442] thread1ENTRY-->L878-2: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_29 0) (= |v_thread1Thread1of1ForFork1_#in~arg.offset_5| v_thread1Thread1of1ForFork1_~arg.offset_5) (= |v_thread1Thread1of1ForFork1_#in~arg.base_5| v_thread1Thread1of1ForFork1_~arg.base_5)) InVars {thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_5|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_5, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_5, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_5|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_29} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_~i~0] 6916#[L913-4, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_56| |v_~#m~0.base_51|))) (and (= (select .cse0 |v_~#m~0.offset_51|) 0) (= |v_#pthreadsMutex_55| (store |v_#pthreadsMutex_56| |v_~#m~0.base_51| (store .cse0 |v_~#m~0.offset_51| 1))) (< v_thread1Thread1of1ForFork1_~i~0_33 4))) InVars {#pthreadsMutex=|v_#pthreadsMutex_56|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_11|, #pthreadsMutex=|v_#pthreadsMutex_55|, ~#m~0.base=|v_~#m~0.base_51|, ~#m~0.offset=|v_~#m~0.offset_51|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 6920#[L913-4, L880-2]don't care [2022-07-22 12:53:36,239 INFO L750 eck$LassoCheckResult]: Loop: 6920#[L913-4, L880-2]don't care [323] L880-2-->L881: Formula: (< 0 v_~num~0_2) InVars {~num~0=v_~num~0_2} OutVars{~num~0=v_~num~0_2} AuxVars[] AssignedVars[] 7078#[L913-4, L881]don't care [325] L881-->L881-1: Formula: (= |v_#pthreadsMutex_5| (store |v_#pthreadsMutex_6| |v_~#m~0.base_3| (store (select |v_#pthreadsMutex_6| |v_~#m~0.base_3|) |v_~#m~0.offset_3| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_6|, ~#m~0.base=|v_~#m~0.base_3|, ~#m~0.offset=|v_~#m~0.offset_3|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_5|, ~#m~0.base=|v_~#m~0.base_3|, ~#m~0.offset=|v_~#m~0.offset_3|} AuxVars[] AssignedVars[#pthreadsMutex] 7080#[L913-4, L881-1]don't care [383] L881-1-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_20| |v_~#m~0.base_25|))) (and (= (select .cse0 |v_~#m~0.offset_25|) 0) (= (store |v_#pthreadsMutex_20| |v_~#m~0.base_25| (store .cse0 |v_~#m~0.offset_25| 1)) |v_#pthreadsMutex_19|))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, ~#m~0.base=|v_~#m~0.base_25|, ~#m~0.offset=|v_~#m~0.offset_25|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_7|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_#t~nondet5] 6920#[L913-4, L880-2]don't care [2022-07-22 12:53:36,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:36,239 INFO L85 PathProgramCache]: Analyzing trace with hash 15617909, now seen corresponding path program 1 times [2022-07-22 12:53:36,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:36,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852449622] [2022-07-22 12:53:36,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:36,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:36,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,256 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:36,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:36,272 INFO L85 PathProgramCache]: Analyzing trace with hash 350652, now seen corresponding path program 1 times [2022-07-22 12:53:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:36,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852518474] [2022-07-22 12:53:36,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:36,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:36,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,278 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:36,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,282 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:36,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:36,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1416979912, now seen corresponding path program 1 times [2022-07-22 12:53:36,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:36,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450159759] [2022-07-22 12:53:36,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:36,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 12:53:36,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 12:53:36,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 12:53:36,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450159759] [2022-07-22 12:53:36,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450159759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 12:53:36,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 12:53:36,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 12:53:36,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2588984] [2022-07-22 12:53:36,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 12:53:36,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 12:53:36,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 12:53:36,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 12:53:36,356 INFO L87 Difference]: Start difference. First operand 512 states and 1417 transitions. cyclomatic complexity: 941 Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:36,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 12:53:36,424 INFO L93 Difference]: Finished difference Result 730 states and 1939 transitions. [2022-07-22 12:53:36,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 730 states and 1939 transitions. [2022-07-22 12:53:36,434 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 372 [2022-07-22 12:53:36,443 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 730 states to 728 states and 1934 transitions. [2022-07-22 12:53:36,443 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 495 [2022-07-22 12:53:36,444 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 495 [2022-07-22 12:53:36,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 728 states and 1934 transitions. [2022-07-22 12:53:36,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-22 12:53:36,445 INFO L220 hiAutomatonCegarLoop]: Abstraction has 728 states and 1934 transitions. [2022-07-22 12:53:36,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states and 1934 transitions. [2022-07-22 12:53:36,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 720. [2022-07-22 12:53:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 720 states have (on average 2.6694444444444443) internal successors, (1922), 719 states have internal predecessors, (1922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 12:53:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1922 transitions. [2022-07-22 12:53:36,517 INFO L242 hiAutomatonCegarLoop]: Abstraction has 720 states and 1922 transitions. [2022-07-22 12:53:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 12:53:36,518 INFO L425 stractBuchiCegarLoop]: Abstraction has 720 states and 1922 transitions. [2022-07-22 12:53:36,519 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-07-22 12:53:36,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 720 states and 1922 transitions. [2022-07-22 12:53:36,524 INFO L131 ngComponentsAnalysis]: Automaton has 50 accepting balls. 372 [2022-07-22 12:53:36,525 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-22 12:53:36,525 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-22 12:53:36,525 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-22 12:53:36,525 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-22 12:53:36,527 INFO L748 eck$LassoCheckResult]: Stem: 9484#[ULTIMATE.startENTRY]don't care [481] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse5 (store |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 1)) (.cse2 (+ |v_~#m~0.offset_75| 24)) (.cse4 (select |v_#memory_int_118| 1)) (.cse3 (select |v_#memory_int_118| |v_~#empty~0.base_40|)) (.cse1 (select |v_#memory_int_118| |v_~#full~0.base_36|)) (.cse0 (select |v_#memory_int_118| |v_~#m~0.base_75|))) (and (= (store |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_int_118| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| |v_ULTIMATE.start_main_#t~pre12#1_27|)) |v_#memory_int_117|) (= 0 (select .cse0 (+ |v_~#m~0.offset_75| 16))) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (select |v_#length_84| |v_ULTIMATE.start_main_~#t1~0#1.base_47|)) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select (select |v_#memory_$Pointer$.base_31| |v_~#m~0.base_75|) .cse2) 0) (= v_~num~0_37 0) (= (select .cse3 |v_~#empty~0.offset_40|) 0) (= 2 (select |v_#length_85| 1)) (= (select .cse4 1) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select |v_#length_85| 4) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 16)) 0) (= |v_#NULL.base_12| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_35| 0) (= |v_~#full~0.offset_36| 0) (= |v_~#m~0.base_75| 3) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_43|) (= (store |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.offset_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.offset_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.offset_30|) (= 0 (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43|)) (= (select |v_#valid_132| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) 0) (= 40 (select |v_#length_85| 3)) (= |v_#valid_131| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_43| 1)) (= (select (select |v_#memory_$Pointer$.offset_31| |v_~#m~0.base_75|) .cse2) 0) (= (select |v_#valid_132| 1) 1) (= (select .cse3 (+ 20 |v_~#empty~0.offset_40|)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= v_~flag~0_43 0) (= v_~total~0_69 0) (= |v_#pthreadsMutex_71| (store |v_#pthreadsMutex_72| |v_~#m~0.base_75| (store (select |v_#pthreadsMutex_72| |v_~#m~0.base_75|) |v_~#m~0.offset_75| 0))) (= (select |v_#valid_132| 5) 1) (= (select .cse0 (+ |v_~#m~0.offset_75| 4)) 0) (= (select |v_#valid_132| 4) 1) (= 48 (select .cse4 0)) (= (select .cse0 (+ |v_~#m~0.offset_75| 22)) 0) (= (select .cse3 (+ 16 |v_~#empty~0.offset_40|)) 0) (= |v_#length_84| (store (store |v_#length_85| |v_ULTIMATE.start_main_~#t1~0#1.base_47| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_43| 4)) (= (select |v_#valid_132| 3) 1) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) (= |v_~#empty~0.base_40| 4) (= (select .cse1 (+ |v_~#full~0.offset_36| 28)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 24)) 0) (= (store |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47| (store (select |v_#memory_$Pointer$.base_31| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35| (select (select |v_#memory_$Pointer$.base_30| |v_ULTIMATE.start_main_~#t1~0#1.base_47|) |v_ULTIMATE.start_main_~#t1~0#1.offset_35|))) |v_#memory_$Pointer$.base_30|) (= (select .cse3 (+ 12 |v_~#empty~0.offset_40|)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_35|) (= (select |v_#valid_132| 0) 0) (= (select .cse3 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select |v_#length_85| 2) 1) (= |v_~#full~0.base_36| 5) (= |v_ULTIMATE.start_main_#t~pre12#1_27| |v_#pthreadsForks_32|) (= (select |v_#valid_132| 2) 1) (= |v_~#m~0.offset_75| 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 20)) 0) (= |v_#pthreadsForks_31| (+ |v_#pthreadsForks_32| 1)) (= |v_#NULL.offset_12| 0) (= (select .cse3 (+ |v_~#empty~0.offset_40| 28)) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 8)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_~#empty~0.offset_40| 0) (= (select (select |v_#memory_int_118| 2) 0) 0) (= (select |v_#length_85| 5) 48) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse0 |v_~#m~0.offset_75|) 0) (= (select .cse0 (+ |v_~#m~0.offset_75| 12)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_72|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_31|, #pthreadsForks=|v_#pthreadsForks_32|, #valid=|v_#valid_132|, #memory_int=|v_#memory_int_118|, #length=|v_#length_85|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_31|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_30|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_35|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_43, #NULL.offset=|v_#NULL.offset_12|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_35|, ~total~0=v_~total~0_69, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_27|, #pthreadsForks=|v_#pthreadsForks_31|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_32|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_17|, #length=|v_#length_84|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_71|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_44|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_18|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_47|, ~num~0=v_~num~0_37, #NULL.base=|v_#NULL.base_12|, ~#m~0.base=|v_~#m~0.base_75|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_25|, ~#m~0.offset=|v_~#m~0.offset_75|, #valid=|v_#valid_131|, #memory_int=|v_#memory_int_117|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_30|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_43|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_15|} AuxVars[] AssignedVars[#memory_$Pointer$.base, ~#full~0.base, ULTIMATE.start_main_~#t2~0#1.offset, ~#empty~0.offset, ~flag~0, #NULL.offset, ULTIMATE.start_main_~#t1~0#1.offset, ~total~0, ULTIMATE.start_main_#t~pre12#1, #pthreadsForks, ULTIMATE.start_main_#t~mem17#1, ULTIMATE.start_main_#t~nondet13#1, #length, ~#full~0.offset, #pthreadsMutex, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_#t~mem16#1, ULTIMATE.start_main_~#t1~0#1.base, ~num~0, #NULL.base, ~#m~0.base, ULTIMATE.start_main_#t~pre14#1, ~#m~0.offset, #valid, #memory_int, ~#empty~0.base, #memory_$Pointer$.offset, ULTIMATE.start_main_~#t2~0#1.base, ULTIMATE.start_main_#t~nondet15#1] 9230#[L913-3]don't care [365] L913-3-->thread1ENTRY: Formula: (and (= |v_thread1Thread1of1ForFork1_#in~arg.offset_4| 0) (= |v_thread1Thread1of1ForFork1_#in~arg.base_4| 0) (= v_thread1Thread1of1ForFork1_thidvar0_2 |v_ULTIMATE.start_main_#t~pre12#1_6|) (= 0 v_thread1Thread1of1ForFork1_thidvar1_2)) InVars {ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|} OutVars{thread1Thread1of1ForFork1_#in~arg.base=|v_thread1Thread1of1ForFork1_#in~arg.base_4|, thread1Thread1of1ForFork1_#res.base=|v_thread1Thread1of1ForFork1_#res.base_4|, thread1Thread1of1ForFork1_~arg.offset=v_thread1Thread1of1ForFork1_~arg.offset_4, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_14, thread1Thread1of1ForFork1_#res.offset=|v_thread1Thread1of1ForFork1_#res.offset_4|, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_8|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_8|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_2, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_2, thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_6|, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_6|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_6|, thread1Thread1of1ForFork1_~arg.base=v_thread1Thread1of1ForFork1_~arg.base_4, thread1Thread1of1ForFork1_#in~arg.offset=|v_thread1Thread1of1ForFork1_#in~arg.offset_4|} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#in~arg.base, thread1Thread1of1ForFork1_#res.base, thread1Thread1of1ForFork1_~arg.offset, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#res.offset, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, thread1Thread1of1ForFork1_thidvar1, thread1Thread1of1ForFork1_thidvar0, thread1Thread1of1ForFork1_#t~nondet4, thread1Thread1of1ForFork1_#t~nondet5, thread1Thread1of1ForFork1_~arg.base, thread1Thread1of1ForFork1_#in~arg.offset] 9232#[L913-4, thread1ENTRY]don't care [466] L913-4-->L914-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_27|) (= (store |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_$Pointer$.base_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.base_16| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|))) |v_#memory_$Pointer$.base_16|) (= |v_ULTIMATE.start_main_#t~pre14#1_21| |v_#pthreadsForks_24|) (= (select |v_#valid_95| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) 1) (= |v_#memory_$Pointer$.offset_16| (store |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_$Pointer$.offset_17| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| (select (select |v_#memory_$Pointer$.offset_16| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27|)))) (= |v_#pthreadsForks_23| (+ |v_#pthreadsForks_24| 1)) (= |v_#memory_int_97| (store |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_31| (store (select |v_#memory_int_98| |v_ULTIMATE.start_main_~#t2~0#1.base_31|) |v_ULTIMATE.start_main_~#t2~0#1.offset_27| |v_ULTIMATE.start_main_#t~pre14#1_21|))) (<= (+ |v_ULTIMATE.start_main_~#t2~0#1.offset_27| 4) (select |v_#length_66| |v_ULTIMATE.start_main_~#t2~0#1.base_31|))) InVars {#memory_$Pointer$.base=|v_#memory_$Pointer$.base_17|, #pthreadsForks=|v_#pthreadsForks_24|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_98|, #length=|v_#length_66|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_17|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} OutVars{ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_21|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_16|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_21|, #pthreadsForks=|v_#pthreadsForks_23|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_27|, #valid=|v_#valid_95|, #memory_int=|v_#memory_int_97|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_13|, #length=|v_#length_66|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_16|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_31|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre12#1, #memory_$Pointer$.base, ULTIMATE.start_main_#t~pre14#1, #pthreadsForks, #memory_int, ULTIMATE.start_main_#t~nondet13#1, #memory_$Pointer$.offset] 9368#[thread1ENTRY, L914-3]don't care [362] L914-3-->thread2ENTRY: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~arg.offset_4| 0) (= |v_thread2Thread1of1ForFork0_#in~arg.base_4| 0) (= v_thread2Thread1of1ForFork0_thidvar2_2 0) (= v_thread2Thread1of1ForFork0_thidvar0_2 |v_ULTIMATE.start_main_#t~pre14#1_6|) (= v_thread2Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|} OutVars{thread2Thread1of1ForFork0_#res.offset=|v_thread2Thread1of1ForFork0_#res.offset_4|, thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_4, thread2Thread1of1ForFork0_#t~nondet8=|v_thread2Thread1of1ForFork0_#t~nondet8_6|, thread2Thread1of1ForFork0_#t~post10=|v_thread2Thread1of1ForFork0_#t~post10_8|, thread2Thread1of1ForFork0_#t~post11=|v_thread2Thread1of1ForFork0_#t~post11_8|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_18, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_4, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_6|, thread2Thread1of1ForFork0_#t~nondet9=|v_thread2Thread1of1ForFork0_#t~nondet9_6|, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_4|, thread2Thread1of1ForFork0_#res.base=|v_thread2Thread1of1ForFork0_#res.base_4|, thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_2, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_2, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_2, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_4|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#res.offset, thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_#t~nondet8, thread2Thread1of1ForFork0_#t~post10, thread2Thread1of1ForFork0_#t~post11, thread2Thread1of1ForFork0_~j~0, thread2Thread1of1ForFork0_~arg.offset, thread2Thread1of1ForFork0_#t~nondet9, thread2Thread1of1ForFork0_#in~arg.offset, thread2Thread1of1ForFork0_#res.base, thread2Thread1of1ForFork0_thidvar2, thread2Thread1of1ForFork0_thidvar1, thread2Thread1of1ForFork0_thidvar0, thread2Thread1of1ForFork0_#in~arg.base] 9394#[thread1ENTRY, thread2ENTRY, L914-4]don't care [452] thread2ENTRY-->L892-2: Formula: (and (= |v_thread2Thread1of1ForFork0_#in~arg.base_7| v_thread2Thread1of1ForFork0_~arg.base_7) (= v_thread2Thread1of1ForFork0_~j~0_41 0) (= |v_thread2Thread1of1ForFork0_#in~arg.offset_7| v_thread2Thread1of1ForFork0_~arg.offset_7)) InVars {thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_7|, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_7|} OutVars{thread2Thread1of1ForFork0_~arg.base=v_thread2Thread1of1ForFork0_~arg.base_7, thread2Thread1of1ForFork0_~arg.offset=v_thread2Thread1of1ForFork0_~arg.offset_7, thread2Thread1of1ForFork0_#in~arg.offset=|v_thread2Thread1of1ForFork0_#in~arg.offset_7|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_41, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_~arg.offset, thread2Thread1of1ForFork0_~j~0] 9396#[thread1ENTRY, L892-2, L914-4]don't care [449] L892-2-->L894-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_52| |v_~#m~0.base_49|))) (and (= (select .cse0 |v_~#m~0.offset_49|) 0) (< v_thread2Thread1of1ForFork0_~j~0_39 4) (= |v_#pthreadsMutex_51| (store |v_#pthreadsMutex_52| |v_~#m~0.base_49| (store .cse0 |v_~#m~0.offset_49| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_52|, ~#m~0.base=|v_~#m~0.base_49|, ~#m~0.offset=|v_~#m~0.offset_49|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_39} OutVars{#pthreadsMutex=|v_#pthreadsMutex_51|, ~#m~0.base=|v_~#m~0.base_49|, ~#m~0.offset=|v_~#m~0.offset_49|, thread2Thread1of1ForFork0_#t~nondet8=|v_thread2Thread1of1ForFork0_#t~nondet8_11|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_39} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork0_#t~nondet8] 9234#[L894-2, thread1ENTRY, L914-4]don't care [2022-07-22 12:53:36,527 INFO L750 eck$LassoCheckResult]: Loop: 9234#[L894-2, thread1ENTRY, L914-4]don't care [347] L894-2-->L895: Formula: (= v_~num~0_8 0) InVars {~num~0=v_~num~0_8} OutVars{~num~0=v_~num~0_8} AuxVars[] AssignedVars[] 8582#[thread1ENTRY, L895, L914-4]don't care [350] L895-->L895-1: Formula: (= |v_#pthreadsMutex_9| (store |v_#pthreadsMutex_10| |v_~#m~0.base_5| (store (select |v_#pthreadsMutex_10| |v_~#m~0.base_5|) |v_~#m~0.offset_5| 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_10|, ~#m~0.base=|v_~#m~0.base_5|, ~#m~0.offset=|v_~#m~0.offset_5|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_9|, ~#m~0.base=|v_~#m~0.base_5|, ~#m~0.offset=|v_~#m~0.offset_5|} AuxVars[] AssignedVars[#pthreadsMutex] 8588#[thread1ENTRY, L895-1, L914-4]don't care [401] L895-1-->L894-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_36| |v_~#m~0.base_35|))) (and (= (select .cse0 |v_~#m~0.offset_35|) 0) (= |v_#pthreadsMutex_35| (store |v_#pthreadsMutex_36| |v_~#m~0.base_35| (store .cse0 |v_~#m~0.offset_35| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_36|, ~#m~0.base=|v_~#m~0.base_35|, ~#m~0.offset=|v_~#m~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_35|, ~#m~0.base=|v_~#m~0.base_35|, thread2Thread1of1ForFork0_#t~nondet9=|v_thread2Thread1of1ForFork0_#t~nondet9_7|, ~#m~0.offset=|v_~#m~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork0_#t~nondet9] 9234#[L894-2, thread1ENTRY, L914-4]don't care [2022-07-22 12:53:36,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:36,528 INFO L85 PathProgramCache]: Analyzing trace with hash 2124553538, now seen corresponding path program 1 times [2022-07-22 12:53:36,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:36,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527606178] [2022-07-22 12:53:36,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:36,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:36,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:36,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,564 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:36,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:36,565 INFO L85 PathProgramCache]: Analyzing trace with hash 374509, now seen corresponding path program 1 times [2022-07-22 12:53:36,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:36,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931228604] [2022-07-22 12:53:36,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:36,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,571 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:36,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 12:53:36,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1936721420, now seen corresponding path program 1 times [2022-07-22 12:53:36,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 12:53:36,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802669708] [2022-07-22 12:53:36,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 12:53:36,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 12:53:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,595 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 12:53:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 12:53:36,616 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 12:53:40,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.07 12:53:40 BoogieIcfgContainer [2022-07-22 12:53:40,533 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-22 12:53:40,534 INFO L158 Benchmark]: Toolchain (without parser) took 36569.54ms. Allocated memory was 169.9MB in the beginning and 354.4MB in the end (delta: 184.5MB). Free memory was 142.2MB in the beginning and 120.4MB in the end (delta: 21.8MB). Peak memory consumption was 206.8MB. Max. memory is 8.0GB. [2022-07-22 12:53:40,534 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-22 12:53:40,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.32ms. Allocated memory is still 169.9MB. Free memory was 142.0MB in the beginning and 116.2MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2022-07-22 12:53:40,535 INFO L158 Benchmark]: Boogie Procedure Inliner took 132.58ms. Allocated memory is still 169.9MB. Free memory was 116.0MB in the beginning and 150.9MB in the end (delta: -34.9MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2022-07-22 12:53:40,560 INFO L158 Benchmark]: Boogie Preprocessor took 34.11ms. Allocated memory is still 169.9MB. Free memory was 150.9MB in the beginning and 149.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-22 12:53:40,560 INFO L158 Benchmark]: RCFGBuilder took 565.58ms. Allocated memory is still 169.9MB. Free memory was 149.4MB in the beginning and 134.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-07-22 12:53:40,561 INFO L158 Benchmark]: BuchiAutomizer took 35061.67ms. Allocated memory was 169.9MB in the beginning and 354.4MB in the end (delta: 184.5MB). Free memory was 134.3MB in the beginning and 120.4MB in the end (delta: 13.9MB). Peak memory consumption was 199.3MB. Max. memory is 8.0GB. [2022-07-22 12:53:40,564 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 79.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 763.32ms. Allocated memory is still 169.9MB. Free memory was 142.0MB in the beginning and 116.2MB in the end (delta: 25.9MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 132.58ms. Allocated memory is still 169.9MB. Free memory was 116.0MB in the beginning and 150.9MB in the end (delta: -34.9MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.11ms. Allocated memory is still 169.9MB. Free memory was 150.9MB in the beginning and 149.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 565.58ms. Allocated memory is still 169.9MB. Free memory was 149.4MB in the beginning and 134.7MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 35061.67ms. Allocated memory was 169.9MB in the beginning and 354.4MB in the end (delta: 184.5MB). Free memory was 134.3MB in the beginning and 120.4MB in the end (delta: 13.9MB). Peak memory consumption was 199.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 7 + i * -2 and consists of 3 locations. One deterministic module has affine ranking function 7 + i * -2 and consists of 3 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 720 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 34.8s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 26.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.2s AutomataMinimizationTime, 4 MinimizatonAttempts, 425 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 85 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 155 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 238 IncrementalHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 41 mSDtfsCounter, 238 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital524 mio100 ax140 hnf100 lsp64 ukn36 mio100 lsp16 div100 bol100 ite100 ukn100 eq224 hnf86 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 31ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 7.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 894]: 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:0}, \result=0, \result={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, empty={4:0}, flag=0, full={5:0}, i=0, j=0, m={3:0}, num=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@12e6a993=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@245bcf63=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f1aee18 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@42a3c204=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@72a333b3 in0,38143, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7d07bcc6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@1034a1bd=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@62f4efe6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@40947f89=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@4d7183a2=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@77819671=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@7eefe0fa=0, t1={7:0}, t2={6:0}, total=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 894]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L870] 0 int num; [L871] 0 unsigned long total; [L872] 0 int flag; [L873] 0 pthread_mutex_t m; [L874] 0 pthread_cond_t empty, full; [L907] 0 pthread_t t1, t2; [L908] 0 num = 0 [L909] 0 total = 0 [L913] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) [L914] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) [L890] 2 int j; [L891] 2 j = 0 [L892] COND TRUE 2 j < 4 Loop: [L894] COND TRUE num == 0 End of lasso representation. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 7.1s, 129 PlacesBefore, 33 PlacesAfterwards, 132 TransitionsBefore, 31 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 6 TrivialYvCompositions, 8 ConcurrentYvCompositions, 5 ChoiceCompositions, 114 TotalNumberOfCompositions, 4371 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2422, positive: 2254, positive conditional: 0, positive unconditional: 2254, negative: 168, negative conditional: 0, negative unconditional: 168, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 995, positive: 964, positive conditional: 0, positive unconditional: 964, negative: 31, negative conditional: 0, negative unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2422, positive: 1290, positive conditional: 0, positive unconditional: 1290, negative: 137, negative conditional: 0, negative unconditional: 137, unknown: 995, unknown conditional: 0, unknown unconditional: 995] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 108, Positive conditional cache size: 0, Positive unconditional cache size: 108, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17 RESULT: Ultimate proved your program to be incorrect! [2022-07-22 12:53:40,626 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...