/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/BuchiAutomizerCInline.xml -s ../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-0d686a6 [2022-07-26 13:59:05,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-26 13:59:05,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-26 13:59:05,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-26 13:59:05,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-26 13:59:05,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-26 13:59:05,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-26 13:59:05,389 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-26 13:59:05,390 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-26 13:59:05,391 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-26 13:59:05,392 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-26 13:59:05,393 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-26 13:59:05,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-26 13:59:05,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-26 13:59:05,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-26 13:59:05,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-26 13:59:05,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-26 13:59:05,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-26 13:59:05,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-26 13:59:05,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-26 13:59:05,402 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-26 13:59:05,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-26 13:59:05,404 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-26 13:59:05,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-26 13:59:05,405 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-26 13:59:05,408 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-26 13:59:05,408 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-26 13:59:05,408 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-26 13:59:05,409 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-26 13:59:05,409 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-26 13:59:05,410 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-26 13:59:05,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-26 13:59:05,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-26 13:59:05,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-26 13:59:05,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-26 13:59:05,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-26 13:59:05,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-26 13:59:05,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-26 13:59:05,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-26 13:59:05,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-26 13:59:05,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-26 13:59:05,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-26 13:59:05,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/buchiAutomizer/concurrent-automaton-semanticLbe.epf [2022-07-26 13:59:05,440 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-26 13:59:05,440 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-26 13:59:05,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-26 13:59:05,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-26 13:59:05,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-26 13:59:05,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-26 13:59:05,442 INFO L138 SettingsManager]: * Use SBE=true [2022-07-26 13:59:05,442 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-07-26 13:59:05,442 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-07-26 13:59:05,442 INFO L138 SettingsManager]: * Use old map elimination=false [2022-07-26 13:59:05,443 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-07-26 13:59:05,443 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-07-26 13:59:05,443 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-07-26 13:59:05,443 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-26 13:59:05,443 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-26 13:59:05,443 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-26 13:59:05,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-26 13:59:05,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-26 13:59:05,444 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-26 13:59:05,444 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-07-26 13:59:05,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-07-26 13:59:05,444 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-07-26 13:59:05,444 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-26 13:59:05,444 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-26 13:59:05,444 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-07-26 13:59:05,444 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-26 13:59:05,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-07-26 13:59:05,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-26 13:59:05,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-26 13:59:05,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-26 13:59:05,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-26 13:59:05,446 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-07-26 13:59:05,446 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2022-07-26 13:59:05,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-26 13:59:05,682 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-26 13:59:05,685 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-26 13:59:05,686 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-26 13:59:05,691 INFO L275 PluginConnector]: CDTParser initialized [2022-07-26 13:59:05,693 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-07-26 13:59:05,755 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786e1fece/d6f3776ad7d247a192cfefa2fc6b6961/FLAGb50a0da1f [2022-07-26 13:59:06,297 INFO L306 CDTParser]: Found 1 translation units. [2022-07-26 13:59:06,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/arithmetic_prog_bad.i [2022-07-26 13:59:06,319 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786e1fece/d6f3776ad7d247a192cfefa2fc6b6961/FLAGb50a0da1f [2022-07-26 13:59:06,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/786e1fece/d6f3776ad7d247a192cfefa2fc6b6961 [2022-07-26 13:59:06,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-26 13:59:06,774 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-07-26 13:59:06,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-26 13:59:06,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-26 13:59:06,783 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-26 13:59:06,784 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:59:06" (1/1) ... [2022-07-26 13:59:06,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67ab96d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:06, skipping insertion in model container [2022-07-26 13:59:06,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.07 01:59:06" (1/1) ... [2022-07-26 13:59:06,797 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-26 13:59:06,845 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-26 13:59:07,318 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_bad.i[39758,39771] [2022-07-26 13:59:07,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:59:07,336 INFO L203 MainTranslator]: Completed pre-run [2022-07-26 13:59:07,373 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_bad.i[39758,39771] [2022-07-26 13:59:07,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-26 13:59:07,431 INFO L208 MainTranslator]: Completed translation [2022-07-26 13:59:07,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07 WrapperNode [2022-07-26 13:59:07,431 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-26 13:59:07,432 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-26 13:59:07,432 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-26 13:59:07,432 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-26 13:59:07,438 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,461 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,484 INFO L137 Inliner]: procedures = 243, calls = 50, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 81 [2022-07-26 13:59:07,485 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-26 13:59:07,486 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-26 13:59:07,486 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-26 13:59:07,486 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-26 13:59:07,496 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,496 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,499 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,500 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,510 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,513 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-26 13:59:07,514 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-26 13:59:07,514 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-26 13:59:07,514 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-26 13:59:07,515 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (1/1) ... [2022-07-26 13:59:07,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:59:07,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:59:07,553 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-07-26 13:59:07,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-07-26 13:59:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-26 13:59:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-26 13:59:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-26 13:59:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-26 13:59:07,584 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-07-26 13:59:07,585 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-07-26 13:59:07,585 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-07-26 13:59:07,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-07-26 13:59:07,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-26 13:59:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2022-07-26 13:59:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-26 13:59:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-26 13:59:07,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-26 13:59:07,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-26 13:59:07,589 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-07-26 13:59:07,743 INFO L234 CfgBuilder]: Building ICFG [2022-07-26 13:59:07,744 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-26 13:59:07,936 INFO L275 CfgBuilder]: Performing block encoding [2022-07-26 13:59:07,943 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-26 13:59:07,943 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-26 13:59:07,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:59:07 BoogieIcfgContainer [2022-07-26 13:59:07,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-26 13:59:07,946 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-07-26 13:59:07,946 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-07-26 13:59:07,949 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-07-26 13:59:07,950 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:59:07,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 26.07 01:59:06" (1/3) ... [2022-07-26 13:59:07,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13a289dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:59:07, skipping insertion in model container [2022-07-26 13:59:07,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:59:07,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.07 01:59:07" (2/3) ... [2022-07-26 13:59:07,951 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@13a289dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 26.07 01:59:07, skipping insertion in model container [2022-07-26 13:59:07,951 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-07-26 13:59:07,951 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.07 01:59:07" (3/3) ... [2022-07-26 13:59:07,953 INFO L322 chiAutomizerObserver]: Analyzing ICFG arithmetic_prog_bad.i [2022-07-26 13:59:08,020 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-07-26 13:59:08,046 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 131 places, 136 transitions, 288 flow [2022-07-26 13:59:08,103 INFO L129 PetriNetUnfolder]: 10/132 cut-off events. [2022-07-26 13:59:08,103 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:59:08,108 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-26 13:59:08,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 136 transitions, 288 flow [2022-07-26 13:59:08,124 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 132 transitions, 276 flow [2022-07-26 13:59:08,127 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-07-26 13:59:08,138 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 132 transitions, 276 flow [2022-07-26 13:59:08,140 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 132 transitions, 276 flow [2022-07-26 13:59:08,141 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 129 places, 132 transitions, 276 flow [2022-07-26 13:59:08,183 INFO L129 PetriNetUnfolder]: 10/132 cut-off events. [2022-07-26 13:59:08,184 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-07-26 13:59:08,185 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-26 13:59:08,187 INFO L116 LiptonReduction]: Number of co-enabled transitions 1922 [2022-07-26 13:59:13,976 INFO L131 LiptonReduction]: Checked pairs total: 4186 [2022-07-26 13:59:13,976 INFO L133 LiptonReduction]: Total number of compositions: 118 [2022-07-26 13:59:13,992 INFO L301 stractBuchiCegarLoop]: Interprodecural is true [2022-07-26 13:59:13,992 INFO L302 stractBuchiCegarLoop]: Hoare is false [2022-07-26 13:59:13,992 INFO L303 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-07-26 13:59:13,993 INFO L304 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-07-26 13:59:13,993 INFO L305 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-07-26 13:59:13,993 INFO L306 stractBuchiCegarLoop]: Difference is false [2022-07-26 13:59:13,993 INFO L307 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-07-26 13:59:13,993 INFO L311 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-07-26 13:59:13,995 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2022-07-26 13:59:14,066 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 182 [2022-07-26 13:59:14,066 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:59:14,066 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:59:14,075 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 13:59:14,075 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:59:14,075 INFO L333 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-07-26 13:59:14,075 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 201 states, but on-demand construction may add more states [2022-07-26 13:59:14,088 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 182 [2022-07-26 13:59:14,089 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:59:14,089 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:59:14,089 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 13:59:14,089 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2022-07-26 13:59:14,094 INFO L733 eck$LassoCheckResult]: Stem: 134#[ULTIMATE.startENTRY]don't care [485] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse4 (+ |v_~#m~0.offset_153| 24)) (.cse0 (select |v_#memory_int_120| |v_~#empty~0.base_40|)) (.cse3 (select |v_#memory_int_120| 1)) (.cse5 (store |v_#valid_138| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1)) (.cse1 (select |v_#memory_int_120| |v_~#full~0.base_36|)) (.cse2 (select |v_#memory_int_120| |v_~#m~0.base_153|))) (and (= (select .cse0 (+ |v_~#empty~0.offset_40| 28)) 0) (= (store (store |v_#length_87| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_#length_86|) (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) (= (select .cse0 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select .cse0 |v_~#empty~0.offset_40|) 0) (= |v_~#full~0.offset_36| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_86| |v_ULTIMATE.start_main_~#t1~0#1.base_51|)) (= 0 (select .cse1 (+ |v_~#full~0.offset_36| 28))) (= (select .cse0 (+ 20 |v_~#empty~0.offset_40|)) 0) (= 0 (select .cse2 (+ 12 |v_~#m~0.offset_153|))) (= 48 (select |v_#length_87| 5)) (= (select |v_#valid_138| 1) 1) (= (store |v_#memory_$Pointer$.offset_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_$Pointer$.offset_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| (select (select |v_#memory_$Pointer$.offset_32| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39|))) |v_#memory_$Pointer$.offset_32|) (= (select .cse3 1) 0) (= 1 (select |v_#valid_138| 4)) (= (select (select |v_#memory_$Pointer$.base_33| |v_~#m~0.base_153|) .cse4) 0) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select |v_#valid_138| 3) 1) (= 0 (select .cse1 (+ |v_~#full~0.offset_36| 16))) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (= |v_ULTIMATE.start_main_#t~pre12#1_29| |v_#pthreadsForks_36|) (= |v_~#m~0.base_153| 3) (= (select .cse2 (+ 22 |v_~#m~0.offset_153|)) 0) (= (store |v_#pthreadsMutex_312| |v_~#m~0.base_153| (store (select |v_#pthreadsMutex_312| |v_~#m~0.base_153|) |v_~#m~0.offset_153| 0)) |v_#pthreadsMutex_311|) (= (store |v_#memory_$Pointer$.base_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_$Pointer$.base_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| (select (select |v_#memory_$Pointer$.base_32| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39|))) |v_#memory_$Pointer$.base_32|) (= (select |v_#valid_138| 2) 1) (= (select .cse2 |v_~#m~0.offset_153|) 0) (= (select .cse2 (+ 16 |v_~#m~0.offset_153|)) 0) (= 0 |v_~#m~0.offset_153|) (= |v_~#empty~0.base_40| 4) (= 40 (select |v_#length_87| 3)) (= (select .cse0 (+ 16 |v_~#empty~0.offset_40|)) 0) (= (select |v_#valid_138| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= (select (select |v_#memory_$Pointer$.offset_33| |v_~#m~0.base_153|) .cse4) 0) (= (select |v_#valid_138| 0) 0) (= (select .cse0 (+ |v_~#empty~0.offset_40| 24)) 0) (= v_~flag~0_41 0) (= (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= (select .cse0 (+ 12 |v_~#empty~0.offset_40|)) 0) (= (select .cse0 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select .cse3 0) 48) (= (select |v_#length_87| 4) 48) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_~#full~0.base_36| 5) (= v_~total~0_85 0) (= (select |v_#valid_138| 5) 1) (= |v_#NULL.offset_10| 0) (= (select |v_#length_87| 2) 1) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select (select |v_#memory_int_120| 2) 0) 0) (= (select .cse2 (+ 20 |v_~#m~0.offset_153|)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= |v_#valid_137| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (= |v_~#empty~0.offset_40| 0) (= 0 (select .cse2 (+ 4 |v_~#m~0.offset_153|))) (= v_~num~0_133 0) (= 2 (select |v_#length_87| 1)) (= |v_#memory_int_119| (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre12#1_29|))) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse2 (+ 8 |v_~#m~0.offset_153|)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_312|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_33|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_120|, #length=|v_#length_87|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_33|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_41, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~total~0=v_~total~0_85, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_34|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_19|, #length=|v_#length_86|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_311|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_48|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~num~0=v_~num~0_133, #NULL.base=|v_#NULL.base_10|, ~#m~0.base=|v_~#m~0.base_153|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, ~#m~0.offset=|v_~#m~0.offset_153|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_119|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|} 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-26 13:59:14,094 INFO L735 eck$LassoCheckResult]: Loop: 143#[L913-4, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_188| |v_~#m~0.base_95|))) (and (= (store |v_#pthreadsMutex_188| |v_~#m~0.base_95| (store .cse0 |v_~#m~0.offset_95| 1)) |v_#pthreadsMutex_187|) (< v_thread1Thread1of1ForFork1_~i~0_33 3) (= (select .cse0 |v_~#m~0.offset_95|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_188|, ~#m~0.base=|v_~#m~0.base_95|, ~#m~0.offset=|v_~#m~0.offset_95|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_25|, #pthreadsMutex=|v_#pthreadsMutex_187|, ~#m~0.base=|v_~#m~0.base_95|, ~#m~0.offset=|v_~#m~0.offset_95|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 149#[L913-4, L880-2]don't care [470] L880-2-->L878-2: Formula: false InVars {} OutVars{#pthreadsMutex=|v_#pthreadsMutex_283|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_47, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_75|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_17|, ~num~0=v_~num~0_123} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7, ~num~0] 143#[L913-4, L878-2]don't care [2022-07-26 13:59:14,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:14,099 INFO L85 PathProgramCache]: Analyzing trace with hash 507633, now seen corresponding path program 1 times [2022-07-26 13:59:14,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:14,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101142450] [2022-07-26 13:59:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:14,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:14,212 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:59:14,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:14,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:59:14,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:14,260 INFO L85 PathProgramCache]: Analyzing trace with hash 15381, now seen corresponding path program 1 times [2022-07-26 13:59:14,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:14,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984938428] [2022-07-26 13:59:14,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:14,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:59:14,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:59:14,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:59:14,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984938428] [2022-07-26 13:59:14,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984938428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:59:14,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:59:14,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-26 13:59:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497336172] [2022-07-26 13:59:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:59:14,308 INFO L750 eck$LassoCheckResult]: loop already infeasible [2022-07-26 13:59:14,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:59:14,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-26 13:59:14,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-26 13:59:14,337 INFO L87 Difference]: Start difference. First operand currently 201 states, but on-demand construction may add more states Second operand has 2 states, 1 states have (on average 2.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:59:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:59:14,396 INFO L93 Difference]: Finished difference Result 202 states and 521 transitions. [2022-07-26 13:59:14,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 202 states and 521 transitions. [2022-07-26 13:59:14,408 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 182 [2022-07-26 13:59:14,416 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 202 states to 196 states and 510 transitions. [2022-07-26 13:59:14,417 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 196 [2022-07-26 13:59:14,420 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 196 [2022-07-26 13:59:14,420 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 510 transitions. [2022-07-26 13:59:14,423 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-07-26 13:59:14,423 INFO L220 hiAutomatonCegarLoop]: Abstraction has 196 states and 510 transitions. [2022-07-26 13:59:14,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 510 transitions. [2022-07-26 13:59:14,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2022-07-26 13:59:14,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 196 states have (on average 2.6020408163265305) internal successors, (510), 195 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:59:14,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 510 transitions. [2022-07-26 13:59:14,474 INFO L242 hiAutomatonCegarLoop]: Abstraction has 196 states and 510 transitions. [2022-07-26 13:59:14,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-26 13:59:14,479 INFO L426 stractBuchiCegarLoop]: Abstraction has 196 states and 510 transitions. [2022-07-26 13:59:14,479 INFO L333 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-07-26 13:59:14,480 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states and 510 transitions. [2022-07-26 13:59:14,482 INFO L131 ngComponentsAnalysis]: Automaton has 14 accepting balls. 182 [2022-07-26 13:59:14,483 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:59:14,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:59:14,490 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2022-07-26 13:59:14,490 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2022-07-26 13:59:14,491 INFO L733 eck$LassoCheckResult]: Stem: 1136#[ULTIMATE.startENTRY]don't care [485] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse4 (+ |v_~#m~0.offset_153| 24)) (.cse0 (select |v_#memory_int_120| |v_~#empty~0.base_40|)) (.cse3 (select |v_#memory_int_120| 1)) (.cse5 (store |v_#valid_138| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1)) (.cse1 (select |v_#memory_int_120| |v_~#full~0.base_36|)) (.cse2 (select |v_#memory_int_120| |v_~#m~0.base_153|))) (and (= (select .cse0 (+ |v_~#empty~0.offset_40| 28)) 0) (= (store (store |v_#length_87| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_#length_86|) (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) (= (select .cse0 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select .cse0 |v_~#empty~0.offset_40|) 0) (= |v_~#full~0.offset_36| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_86| |v_ULTIMATE.start_main_~#t1~0#1.base_51|)) (= 0 (select .cse1 (+ |v_~#full~0.offset_36| 28))) (= (select .cse0 (+ 20 |v_~#empty~0.offset_40|)) 0) (= 0 (select .cse2 (+ 12 |v_~#m~0.offset_153|))) (= 48 (select |v_#length_87| 5)) (= (select |v_#valid_138| 1) 1) (= (store |v_#memory_$Pointer$.offset_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_$Pointer$.offset_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| (select (select |v_#memory_$Pointer$.offset_32| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39|))) |v_#memory_$Pointer$.offset_32|) (= (select .cse3 1) 0) (= 1 (select |v_#valid_138| 4)) (= (select (select |v_#memory_$Pointer$.base_33| |v_~#m~0.base_153|) .cse4) 0) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select |v_#valid_138| 3) 1) (= 0 (select .cse1 (+ |v_~#full~0.offset_36| 16))) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (= |v_ULTIMATE.start_main_#t~pre12#1_29| |v_#pthreadsForks_36|) (= |v_~#m~0.base_153| 3) (= (select .cse2 (+ 22 |v_~#m~0.offset_153|)) 0) (= (store |v_#pthreadsMutex_312| |v_~#m~0.base_153| (store (select |v_#pthreadsMutex_312| |v_~#m~0.base_153|) |v_~#m~0.offset_153| 0)) |v_#pthreadsMutex_311|) (= (store |v_#memory_$Pointer$.base_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_$Pointer$.base_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| (select (select |v_#memory_$Pointer$.base_32| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39|))) |v_#memory_$Pointer$.base_32|) (= (select |v_#valid_138| 2) 1) (= (select .cse2 |v_~#m~0.offset_153|) 0) (= (select .cse2 (+ 16 |v_~#m~0.offset_153|)) 0) (= 0 |v_~#m~0.offset_153|) (= |v_~#empty~0.base_40| 4) (= 40 (select |v_#length_87| 3)) (= (select .cse0 (+ 16 |v_~#empty~0.offset_40|)) 0) (= (select |v_#valid_138| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= (select (select |v_#memory_$Pointer$.offset_33| |v_~#m~0.base_153|) .cse4) 0) (= (select |v_#valid_138| 0) 0) (= (select .cse0 (+ |v_~#empty~0.offset_40| 24)) 0) (= v_~flag~0_41 0) (= (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= (select .cse0 (+ 12 |v_~#empty~0.offset_40|)) 0) (= (select .cse0 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select .cse3 0) 48) (= (select |v_#length_87| 4) 48) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_~#full~0.base_36| 5) (= v_~total~0_85 0) (= (select |v_#valid_138| 5) 1) (= |v_#NULL.offset_10| 0) (= (select |v_#length_87| 2) 1) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select (select |v_#memory_int_120| 2) 0) 0) (= (select .cse2 (+ 20 |v_~#m~0.offset_153|)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= |v_#valid_137| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (= |v_~#empty~0.offset_40| 0) (= 0 (select .cse2 (+ 4 |v_~#m~0.offset_153|))) (= v_~num~0_133 0) (= 2 (select |v_#length_87| 1)) (= |v_#memory_int_119| (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre12#1_29|))) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse2 (+ 8 |v_~#m~0.offset_153|)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_312|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_33|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_120|, #length=|v_#length_87|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_33|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_41, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~total~0=v_~total~0_85, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_34|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_19|, #length=|v_#length_86|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_311|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_48|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~num~0=v_~num~0_133, #NULL.base=|v_#NULL.base_10|, ~#m~0.base=|v_~#m~0.base_153|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, ~#m~0.offset=|v_~#m~0.offset_153|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_119|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|} 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] 1088#[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] 1090#[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] 836#[L913-4, L878-2]don't care [2022-07-26 13:59:14,491 INFO L735 eck$LassoCheckResult]: Loop: 836#[L913-4, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_188| |v_~#m~0.base_95|))) (and (= (store |v_#pthreadsMutex_188| |v_~#m~0.base_95| (store .cse0 |v_~#m~0.offset_95| 1)) |v_#pthreadsMutex_187|) (< v_thread1Thread1of1ForFork1_~i~0_33 3) (= (select .cse0 |v_~#m~0.offset_95|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_188|, ~#m~0.base=|v_~#m~0.base_95|, ~#m~0.offset=|v_~#m~0.offset_95|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_25|, #pthreadsMutex=|v_#pthreadsMutex_187|, ~#m~0.base=|v_~#m~0.base_95|, ~#m~0.offset=|v_~#m~0.offset_95|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 838#[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[] 872#[L880-3, L913-4]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] 876#[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] 980#[L882-1, L913-4]don't care [469] L882-1-->L878-2: Formula: (and (= v_thread1Thread1of1ForFork1_~i~0_43 (+ v_thread1Thread1of1ForFork1_~i~0_44 1)) (= (store |v_#pthreadsMutex_252| |v_~#m~0.base_125| (store (select |v_#pthreadsMutex_252| |v_~#m~0.base_125|) |v_~#m~0.offset_125| 0)) |v_#pthreadsMutex_251|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_252|, ~#m~0.base=|v_~#m~0.base_125|, ~#m~0.offset=|v_~#m~0.offset_125|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_44} OutVars{#pthreadsMutex=|v_#pthreadsMutex_251|, ~#m~0.base=|v_~#m~0.base_125|, ~#m~0.offset=|v_~#m~0.offset_125|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_43, thread1Thread1of1ForFork1_#t~post6=|v_thread1Thread1of1ForFork1_#t~post6_57|, thread1Thread1of1ForFork1_#t~post7=|v_thread1Thread1of1ForFork1_#t~post7_15|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_~i~0, thread1Thread1of1ForFork1_#t~post6, thread1Thread1of1ForFork1_#t~post7] 836#[L913-4, L878-2]don't care [2022-07-26 13:59:14,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:14,492 INFO L85 PathProgramCache]: Analyzing trace with hash 507633, now seen corresponding path program 2 times [2022-07-26 13:59:14,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:14,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823258287] [2022-07-26 13:59:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:14,546 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:59:14,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:14,583 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:59:14,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:14,584 INFO L85 PathProgramCache]: Analyzing trace with hash 454128242, now seen corresponding path program 1 times [2022-07-26 13:59:14,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:14,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854519922] [2022-07-26 13:59:14,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:14,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:14,596 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:59:14,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:14,601 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:59:14,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:14,602 INFO L85 PathProgramCache]: Analyzing trace with hash -642020990, now seen corresponding path program 1 times [2022-07-26 13:59:14,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:14,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651322462] [2022-07-26 13:59:14,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:14,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:14,651 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:59:14,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:14,690 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:59:16,409 INFO L210 LassoAnalysis]: Preferences: [2022-07-26 13:59:16,410 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-07-26 13:59:16,410 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-07-26 13:59:16,410 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-07-26 13:59:16,410 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-07-26 13:59:16,410 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:59:16,410 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-07-26 13:59:16,410 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-07-26 13:59:16,410 INFO L133 ssoRankerPreferences]: Filename of dumped script: arithmetic_prog_bad.i_BEv2_Iteration2_Lasso [2022-07-26 13:59:16,411 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-07-26 13:59:16,411 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-07-26 13:59:16,431 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,435 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,437 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,439 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,443 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,446 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,448 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,450 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,452 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,453 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,455 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,458 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,459 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,461 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,463 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,464 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,466 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,467 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,469 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,471 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,474 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,478 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,479 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,481 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,483 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,485 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,487 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,488 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,490 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,492 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,494 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,496 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,497 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:16,499 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,874 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,876 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,879 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,881 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,883 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,885 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,888 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,890 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,893 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,895 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,898 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,900 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,903 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,905 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,908 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,910 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,915 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,917 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,920 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,921 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,923 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,926 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,927 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:18,930 INFO L142 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-07-26 13:59:19,541 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-07-26 13:59:19,545 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-07-26 13:59:19,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:59:19,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:59:19,547 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-26 13:59:19,548 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-26 13:59:19,553 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-26 13:59:19,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:59:19,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-07-26 13:59:19,560 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:59:19,560 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:59:19,560 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:59:19,561 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-07-26 13:59:19,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-07-26 13:59:19,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:59:19,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-07-26 13:59:19,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:59:19,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:59:19,584 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-26 13:59:19,592 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-26 13:59:19,598 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:59:19,598 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:59:19,598 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:59:19,598 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:59:19,601 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:59:19,601 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:59:19,605 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-26 13:59:19,613 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:59:19,635 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-26 13:59:19,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:59:19,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:59:19,637 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-26 13:59:19,644 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-26 13:59:19,655 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:59:19,655 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:59:19,656 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:59:19,656 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:59:19,660 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:59:19,660 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:59:19,666 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-26 13:59:19,666 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-07-26 13:59:19,691 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-26 13:59:19,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:59:19,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:59:19,693 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-26 13:59:19,697 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-26 13:59:19,702 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-26 13:59:19,702 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-07-26 13:59:19,702 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-07-26 13:59:19,702 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-07-26 13:59:19,702 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-07-26 13:59:19,706 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2022-07-26 13:59:19,706 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2022-07-26 13:59:19,710 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-07-26 13:59:19,718 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2022-07-26 13:59:19,718 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2022-07-26 13:59:19,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-07-26 13:59:19,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-26 13:59:19,721 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-26 13:59:19,722 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-26 13:59:19,723 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-07-26 13:59:19,743 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2022-07-26 13:59:19,743 INFO L513 LassoAnalysis]: Proved termination. [2022-07-26 13:59:19,743 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(thread1Thread1of1ForFork1_~i~0) = -2*thread1Thread1of1ForFork1_~i~0 + 5 Supporting invariants [] [2022-07-26 13:59:19,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-07-26 13:59:20,095 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-26 13:59:22,577 INFO L156 tatePredicateManager]: 351 out of 351 supporting invariants were superfluous and have been removed [2022-07-26 13:59:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:59:22,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-26 13:59:22,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:59:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:59:22,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-26 13:59:22,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-26 13:59:22,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:59:22,674 INFO L141 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-26 13:59:22,675 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 196 states and 510 transitions. cyclomatic complexity: 328 Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:59:22,792 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 196 states and 510 transitions. cyclomatic complexity: 328. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 463 states and 1386 transitions. Complement of second has 6 states. [2022-07-26 13:59:22,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2022-07-26 13:59:22,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:59:22,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 68 transitions. [2022-07-26 13:59:22,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 3 letters. Loop has 5 letters. [2022-07-26 13:59:22,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:59:22,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 8 letters. Loop has 5 letters. [2022-07-26 13:59:22,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:59:22,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 68 transitions. Stem has 3 letters. Loop has 10 letters. [2022-07-26 13:59:22,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-07-26 13:59:22,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 463 states and 1386 transitions. [2022-07-26 13:59:22,801 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 158 [2022-07-26 13:59:22,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 463 states to 423 states and 1254 transitions. [2022-07-26 13:59:22,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 207 [2022-07-26 13:59:22,807 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 264 [2022-07-26 13:59:22,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 423 states and 1254 transitions. [2022-07-26 13:59:22,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:59:22,808 INFO L220 hiAutomatonCegarLoop]: Abstraction has 423 states and 1254 transitions. [2022-07-26 13:59:22,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states and 1254 transitions. [2022-07-26 13:59:22,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 368. [2022-07-26 13:59:22,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 368 states have (on average 2.953804347826087) internal successors, (1087), 367 states have internal predecessors, (1087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:59:22,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 1087 transitions. [2022-07-26 13:59:22,823 INFO L242 hiAutomatonCegarLoop]: Abstraction has 368 states and 1087 transitions. [2022-07-26 13:59:22,823 INFO L426 stractBuchiCegarLoop]: Abstraction has 368 states and 1087 transitions. [2022-07-26 13:59:22,823 INFO L333 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-07-26 13:59:22,823 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 368 states and 1087 transitions. [2022-07-26 13:59:22,825 INFO L131 ngComponentsAnalysis]: Automaton has 22 accepting balls. 158 [2022-07-26 13:59:22,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:59:22,826 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:59:22,826 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-07-26 13:59:22,826 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-26 13:59:22,827 INFO L733 eck$LassoCheckResult]: Stem: 3785#[ULTIMATE.startENTRY]don't care [485] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse4 (+ |v_~#m~0.offset_153| 24)) (.cse0 (select |v_#memory_int_120| |v_~#empty~0.base_40|)) (.cse3 (select |v_#memory_int_120| 1)) (.cse5 (store |v_#valid_138| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1)) (.cse1 (select |v_#memory_int_120| |v_~#full~0.base_36|)) (.cse2 (select |v_#memory_int_120| |v_~#m~0.base_153|))) (and (= (select .cse0 (+ |v_~#empty~0.offset_40| 28)) 0) (= (store (store |v_#length_87| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_#length_86|) (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) (= (select .cse0 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select .cse0 |v_~#empty~0.offset_40|) 0) (= |v_~#full~0.offset_36| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_86| |v_ULTIMATE.start_main_~#t1~0#1.base_51|)) (= 0 (select .cse1 (+ |v_~#full~0.offset_36| 28))) (= (select .cse0 (+ 20 |v_~#empty~0.offset_40|)) 0) (= 0 (select .cse2 (+ 12 |v_~#m~0.offset_153|))) (= 48 (select |v_#length_87| 5)) (= (select |v_#valid_138| 1) 1) (= (store |v_#memory_$Pointer$.offset_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_$Pointer$.offset_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| (select (select |v_#memory_$Pointer$.offset_32| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39|))) |v_#memory_$Pointer$.offset_32|) (= (select .cse3 1) 0) (= 1 (select |v_#valid_138| 4)) (= (select (select |v_#memory_$Pointer$.base_33| |v_~#m~0.base_153|) .cse4) 0) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select |v_#valid_138| 3) 1) (= 0 (select .cse1 (+ |v_~#full~0.offset_36| 16))) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (= |v_ULTIMATE.start_main_#t~pre12#1_29| |v_#pthreadsForks_36|) (= |v_~#m~0.base_153| 3) (= (select .cse2 (+ 22 |v_~#m~0.offset_153|)) 0) (= (store |v_#pthreadsMutex_312| |v_~#m~0.base_153| (store (select |v_#pthreadsMutex_312| |v_~#m~0.base_153|) |v_~#m~0.offset_153| 0)) |v_#pthreadsMutex_311|) (= (store |v_#memory_$Pointer$.base_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_$Pointer$.base_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| (select (select |v_#memory_$Pointer$.base_32| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39|))) |v_#memory_$Pointer$.base_32|) (= (select |v_#valid_138| 2) 1) (= (select .cse2 |v_~#m~0.offset_153|) 0) (= (select .cse2 (+ 16 |v_~#m~0.offset_153|)) 0) (= 0 |v_~#m~0.offset_153|) (= |v_~#empty~0.base_40| 4) (= 40 (select |v_#length_87| 3)) (= (select .cse0 (+ 16 |v_~#empty~0.offset_40|)) 0) (= (select |v_#valid_138| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= (select (select |v_#memory_$Pointer$.offset_33| |v_~#m~0.base_153|) .cse4) 0) (= (select |v_#valid_138| 0) 0) (= (select .cse0 (+ |v_~#empty~0.offset_40| 24)) 0) (= v_~flag~0_41 0) (= (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= (select .cse0 (+ 12 |v_~#empty~0.offset_40|)) 0) (= (select .cse0 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select .cse3 0) 48) (= (select |v_#length_87| 4) 48) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_~#full~0.base_36| 5) (= v_~total~0_85 0) (= (select |v_#valid_138| 5) 1) (= |v_#NULL.offset_10| 0) (= (select |v_#length_87| 2) 1) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select (select |v_#memory_int_120| 2) 0) 0) (= (select .cse2 (+ 20 |v_~#m~0.offset_153|)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= |v_#valid_137| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (= |v_~#empty~0.offset_40| 0) (= 0 (select .cse2 (+ 4 |v_~#m~0.offset_153|))) (= v_~num~0_133 0) (= 2 (select |v_#length_87| 1)) (= |v_#memory_int_119| (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre12#1_29|))) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse2 (+ 8 |v_~#m~0.offset_153|)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_312|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_33|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_120|, #length=|v_#length_87|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_33|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_41, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~total~0=v_~total~0_85, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_34|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_19|, #length=|v_#length_86|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_311|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_48|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~num~0=v_~num~0_133, #NULL.base=|v_#NULL.base_10|, ~#m~0.base=|v_~#m~0.base_153|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, ~#m~0.offset=|v_~#m~0.offset_153|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_119|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|} 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] 3649#[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] 3651#[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] 3197#[L913-4, L878-2]don't care [450] L878-2-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_188| |v_~#m~0.base_95|))) (and (= (store |v_#pthreadsMutex_188| |v_~#m~0.base_95| (store .cse0 |v_~#m~0.offset_95| 1)) |v_#pthreadsMutex_187|) (< v_thread1Thread1of1ForFork1_~i~0_33 3) (= (select .cse0 |v_~#m~0.offset_95|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_188|, ~#m~0.base=|v_~#m~0.base_95|, ~#m~0.offset=|v_~#m~0.offset_95|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} OutVars{thread1Thread1of1ForFork1_#t~nondet4=|v_thread1Thread1of1ForFork1_#t~nondet4_25|, #pthreadsMutex=|v_#pthreadsMutex_187|, ~#m~0.base=|v_~#m~0.base_95|, ~#m~0.offset=|v_~#m~0.offset_95|, thread1Thread1of1ForFork1_~i~0=v_thread1Thread1of1ForFork1_~i~0_33} AuxVars[] AssignedVars[thread1Thread1of1ForFork1_#t~nondet4, #pthreadsMutex] 3199#[L913-4, L880-2]don't care [2022-07-26 13:59:22,827 INFO L735 eck$LassoCheckResult]: Loop: 3199#[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[] 3329#[L881, L913-4]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] 3331#[L881-1, L913-4]don't care [383] L881-1-->L880-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_62| |v_~#m~0.base_39|))) (and (= |v_#pthreadsMutex_61| (store |v_#pthreadsMutex_62| |v_~#m~0.base_39| (store .cse0 |v_~#m~0.offset_39| 1))) (= (select .cse0 |v_~#m~0.offset_39|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_62|, ~#m~0.base=|v_~#m~0.base_39|, ~#m~0.offset=|v_~#m~0.offset_39|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_61|, ~#m~0.base=|v_~#m~0.base_39|, ~#m~0.offset=|v_~#m~0.offset_39|, thread1Thread1of1ForFork1_#t~nondet5=|v_thread1Thread1of1ForFork1_#t~nondet5_15|} AuxVars[] AssignedVars[#pthreadsMutex, thread1Thread1of1ForFork1_#t~nondet5] 3199#[L913-4, L880-2]don't care [2022-07-26 13:59:22,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:22,827 INFO L85 PathProgramCache]: Analyzing trace with hash 15737073, now seen corresponding path program 1 times [2022-07-26 13:59:22,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:22,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349595706] [2022-07-26 13:59:22,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:22,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:22,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:22,843 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:59:22,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:22,858 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:59:22,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash 350652, now seen corresponding path program 1 times [2022-07-26 13:59:22,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:22,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121438023] [2022-07-26 13:59:22,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:22,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:22,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:22,865 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:59:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:22,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:59:22,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:22,868 INFO L85 PathProgramCache]: Analyzing trace with hash 672027340, now seen corresponding path program 1 times [2022-07-26 13:59:22,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:22,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232867622] [2022-07-26 13:59:22,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:22,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:22,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-26 13:59:22,896 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-26 13:59:22,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-26 13:59:22,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232867622] [2022-07-26 13:59:22,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232867622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-26 13:59:22,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-26 13:59:22,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-26 13:59:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022794819] [2022-07-26 13:59:22,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-26 13:59:22,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-26 13:59:22,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-26 13:59:22,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-26 13:59:22,914 INFO L87 Difference]: Start difference. First operand 368 states and 1087 transitions. cyclomatic complexity: 749 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-26 13:59:22,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-26 13:59:22,971 INFO L93 Difference]: Finished difference Result 524 states and 1447 transitions. [2022-07-26 13:59:22,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 524 states and 1447 transitions. [2022-07-26 13:59:22,976 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 180 [2022-07-26 13:59:22,980 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 524 states to 520 states and 1434 transitions. [2022-07-26 13:59:22,981 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 283 [2022-07-26 13:59:22,981 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 283 [2022-07-26 13:59:22,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 520 states and 1434 transitions. [2022-07-26 13:59:22,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-07-26 13:59:22,982 INFO L220 hiAutomatonCegarLoop]: Abstraction has 520 states and 1434 transitions. [2022-07-26 13:59:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states and 1434 transitions. [2022-07-26 13:59:22,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 516. [2022-07-26 13:59:22,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 516 states have (on average 2.7674418604651163) internal successors, (1428), 515 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-26 13:59:22,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 1428 transitions. [2022-07-26 13:59:22,995 INFO L242 hiAutomatonCegarLoop]: Abstraction has 516 states and 1428 transitions. [2022-07-26 13:59:22,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-26 13:59:22,996 INFO L426 stractBuchiCegarLoop]: Abstraction has 516 states and 1428 transitions. [2022-07-26 13:59:22,996 INFO L333 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-07-26 13:59:22,996 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 1428 transitions. [2022-07-26 13:59:22,999 INFO L131 ngComponentsAnalysis]: Automaton has 44 accepting balls. 180 [2022-07-26 13:59:22,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-07-26 13:59:22,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-07-26 13:59:23,000 INFO L150 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2022-07-26 13:59:23,000 INFO L151 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-07-26 13:59:23,001 INFO L733 eck$LassoCheckResult]: Stem: 5127#[ULTIMATE.startENTRY]don't care [485] ULTIMATE.startENTRY-->L913-3: Formula: (let ((.cse4 (+ |v_~#m~0.offset_153| 24)) (.cse0 (select |v_#memory_int_120| |v_~#empty~0.base_40|)) (.cse3 (select |v_#memory_int_120| 1)) (.cse5 (store |v_#valid_138| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 1)) (.cse1 (select |v_#memory_int_120| |v_~#full~0.base_36|)) (.cse2 (select |v_#memory_int_120| |v_~#m~0.base_153|))) (and (= (select .cse0 (+ |v_~#empty~0.offset_40| 28)) 0) (= (store (store |v_#length_87| |v_ULTIMATE.start_main_~#t1~0#1.base_51| 4) |v_ULTIMATE.start_main_~#t2~0#1.base_51| 4) |v_#length_86|) (= |v_#NULL.base_10| 0) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t2~0#1.base_51|) (= (select .cse0 (+ |v_~#empty~0.offset_40| 4)) 0) (= (select .cse0 |v_~#empty~0.offset_40|) 0) (= |v_~#full~0.offset_36| 0) (= |v_ULTIMATE.start_main_~#t2~0#1.offset_41| 0) (<= (+ 4 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (select |v_#length_86| |v_ULTIMATE.start_main_~#t1~0#1.base_51|)) (= 0 (select .cse1 (+ |v_~#full~0.offset_36| 28))) (= (select .cse0 (+ 20 |v_~#empty~0.offset_40|)) 0) (= 0 (select .cse2 (+ 12 |v_~#m~0.offset_153|))) (= 48 (select |v_#length_87| 5)) (= (select |v_#valid_138| 1) 1) (= (store |v_#memory_$Pointer$.offset_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_$Pointer$.offset_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| (select (select |v_#memory_$Pointer$.offset_32| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39|))) |v_#memory_$Pointer$.offset_32|) (= (select .cse3 1) 0) (= 1 (select |v_#valid_138| 4)) (= (select (select |v_#memory_$Pointer$.base_33| |v_~#m~0.base_153|) .cse4) 0) (= (select .cse1 |v_~#full~0.offset_36|) 0) (= (select |v_#valid_138| 3) 1) (= 0 (select .cse1 (+ |v_~#full~0.offset_36| 16))) (= (select .cse1 (+ |v_~#full~0.offset_36| 20)) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 4)) 0) (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_39|) (= |v_ULTIMATE.start_main_#t~pre12#1_29| |v_#pthreadsForks_36|) (= |v_~#m~0.base_153| 3) (= (select .cse2 (+ 22 |v_~#m~0.offset_153|)) 0) (= (store |v_#pthreadsMutex_312| |v_~#m~0.base_153| (store (select |v_#pthreadsMutex_312| |v_~#m~0.base_153|) |v_~#m~0.offset_153| 0)) |v_#pthreadsMutex_311|) (= (store |v_#memory_$Pointer$.base_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_$Pointer$.base_33| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| (select (select |v_#memory_$Pointer$.base_32| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39|))) |v_#memory_$Pointer$.base_32|) (= (select |v_#valid_138| 2) 1) (= (select .cse2 |v_~#m~0.offset_153|) 0) (= (select .cse2 (+ 16 |v_~#m~0.offset_153|)) 0) (= 0 |v_~#m~0.offset_153|) (= |v_~#empty~0.base_40| 4) (= 40 (select |v_#length_87| 3)) (= (select .cse0 (+ 16 |v_~#empty~0.offset_40|)) 0) (= (select |v_#valid_138| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) 0) (= (select .cse1 (+ |v_~#full~0.offset_36| 12)) 0) (= (select (select |v_#memory_$Pointer$.offset_33| |v_~#m~0.base_153|) .cse4) 0) (= (select |v_#valid_138| 0) 0) (= (select .cse0 (+ |v_~#empty~0.offset_40| 24)) 0) (= v_~flag~0_41 0) (= (select .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_51|) 0) (= (select .cse0 (+ 12 |v_~#empty~0.offset_40|)) 0) (= (select .cse0 (+ 8 |v_~#empty~0.offset_40|)) 0) (= (select .cse3 0) 48) (= (select |v_#length_87| 4) 48) (< |v_#StackHeapBarrier_26| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) (= |v_~#full~0.base_36| 5) (= v_~total~0_85 0) (= (select |v_#valid_138| 5) 1) (= |v_#NULL.offset_10| 0) (= (select |v_#length_87| 2) 1) (= (select .cse1 (+ |v_~#full~0.offset_36| 8)) 0) (= (select (select |v_#memory_int_120| 2) 0) 0) (= (select .cse2 (+ 20 |v_~#m~0.offset_153|)) 0) (< 0 |v_#StackHeapBarrier_26|) (= |v_#pthreadsForks_35| (+ |v_#pthreadsForks_36| 1)) (= |v_#valid_137| (store .cse5 |v_ULTIMATE.start_main_~#t2~0#1.base_51| 1)) (= |v_~#empty~0.offset_40| 0) (= 0 (select .cse2 (+ 4 |v_~#m~0.offset_153|))) (= v_~num~0_133 0) (= 2 (select |v_#length_87| 1)) (= |v_#memory_int_119| (store |v_#memory_int_120| |v_ULTIMATE.start_main_~#t1~0#1.base_51| (store (select |v_#memory_int_120| |v_ULTIMATE.start_main_~#t1~0#1.base_51|) |v_ULTIMATE.start_main_~#t1~0#1.offset_39| |v_ULTIMATE.start_main_#t~pre12#1_29|))) (= (select .cse1 (+ |v_~#full~0.offset_36| 24)) 0) (= (select .cse2 (+ 8 |v_~#m~0.offset_153|)) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_312|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, #memory_$Pointer$.base=|v_#memory_$Pointer$.base_33|, #pthreadsForks=|v_#pthreadsForks_36|, #valid=|v_#valid_138|, #memory_int=|v_#memory_int_120|, #length=|v_#length_87|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_33|} OutVars{#memory_$Pointer$.base=|v_#memory_$Pointer$.base_32|, ~#full~0.base=|v_~#full~0.base_36|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_41|, ~#empty~0.offset=|v_~#empty~0.offset_40|, ~flag~0=v_~flag~0_41, #NULL.offset=|v_#NULL.offset_10|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_39|, ~total~0=v_~total~0_85, ULTIMATE.start_main_#t~pre12#1=|v_ULTIMATE.start_main_#t~pre12#1_29|, #pthreadsForks=|v_#pthreadsForks_35|, ULTIMATE.start_main_#t~mem17#1=|v_ULTIMATE.start_main_#t~mem17#1_34|, ULTIMATE.start_main_#t~nondet13#1=|v_ULTIMATE.start_main_#t~nondet13#1_19|, #length=|v_#length_86|, ~#full~0.offset=|v_~#full~0.offset_36|, #pthreadsMutex=|v_#pthreadsMutex_311|, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_48|, ULTIMATE.start_main_#t~mem16#1=|v_ULTIMATE.start_main_#t~mem16#1_20|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_51|, ~num~0=v_~num~0_133, #NULL.base=|v_#NULL.base_10|, ~#m~0.base=|v_~#m~0.base_153|, #StackHeapBarrier=|v_#StackHeapBarrier_26|, ULTIMATE.start_main_#t~pre14#1=|v_ULTIMATE.start_main_#t~pre14#1_27|, ~#m~0.offset=|v_~#m~0.offset_153|, #valid=|v_#valid_137|, #memory_int=|v_#memory_int_119|, ~#empty~0.base=|v_~#empty~0.base_40|, #memory_$Pointer$.offset=|v_#memory_$Pointer$.offset_32|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_51|, ULTIMATE.start_main_#t~nondet15#1=|v_ULTIMATE.start_main_#t~nondet15#1_17|} 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] 5089#[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] 4487#[L913-4, thread1ENTRY]don't care [467] 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] 4489#[L914-3, thread1ENTRY]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] 4651#[thread1ENTRY, L914-4, thread2ENTRY]don't care [452] thread2ENTRY-->L892-2: Formula: (and (= v_thread2Thread1of1ForFork0_~j~0_43 0) (= |v_thread2Thread1of1ForFork0_#in~arg.base_7| v_thread2Thread1of1ForFork0_~arg.base_7) (= |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_43, thread2Thread1of1ForFork0_#in~arg.base=|v_thread2Thread1of1ForFork0_#in~arg.base_7|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_~arg.base, thread2Thread1of1ForFork0_~arg.offset, thread2Thread1of1ForFork0_~j~0] 4655#[L892-2, thread1ENTRY, L914-4]don't care [449] L892-2-->L894-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_184| |v_~#m~0.base_93|))) (and (= |v_#pthreadsMutex_183| (store |v_#pthreadsMutex_184| |v_~#m~0.base_93| (store .cse0 |v_~#m~0.offset_93| 1))) (< v_thread2Thread1of1ForFork0_~j~0_41 3) (= (select .cse0 |v_~#m~0.offset_93|) 0))) InVars {#pthreadsMutex=|v_#pthreadsMutex_184|, ~#m~0.base=|v_~#m~0.base_93|, ~#m~0.offset=|v_~#m~0.offset_93|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_41} OutVars{#pthreadsMutex=|v_#pthreadsMutex_183|, ~#m~0.base=|v_~#m~0.base_93|, ~#m~0.offset=|v_~#m~0.offset_93|, thread2Thread1of1ForFork0_#t~nondet8=|v_thread2Thread1of1ForFork0_#t~nondet8_25|, thread2Thread1of1ForFork0_~j~0=v_thread2Thread1of1ForFork0_~j~0_41} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork0_#t~nondet8] 4443#[thread1ENTRY, L894-2, L914-4]don't care [2022-07-26 13:59:23,001 INFO L735 eck$LassoCheckResult]: Loop: 4443#[thread1ENTRY, L894-2, 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[] 4389#[thread1ENTRY, L914-4, L895]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] 4395#[thread1ENTRY, L914-4, L895-1]don't care [401] L895-1-->L894-2: Formula: (let ((.cse0 (select |v_#pthreadsMutex_108| |v_~#m~0.base_59|))) (and (= (select .cse0 |v_~#m~0.offset_59|) 0) (= |v_#pthreadsMutex_107| (store |v_#pthreadsMutex_108| |v_~#m~0.base_59| (store .cse0 |v_~#m~0.offset_59| 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_108|, ~#m~0.base=|v_~#m~0.base_59|, ~#m~0.offset=|v_~#m~0.offset_59|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_107|, ~#m~0.base=|v_~#m~0.base_59|, thread2Thread1of1ForFork0_#t~nondet9=|v_thread2Thread1of1ForFork0_#t~nondet9_11|, ~#m~0.offset=|v_~#m~0.offset_59|} AuxVars[] AssignedVars[#pthreadsMutex, thread2Thread1of1ForFork0_#t~nondet9] 4443#[thread1ENTRY, L894-2, L914-4]don't care [2022-07-26 13:59:23,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash -2055867363, now seen corresponding path program 1 times [2022-07-26 13:59:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:23,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206723585] [2022-07-26 13:59:23,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:23,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:23,017 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:59:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:23,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:59:23,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:23,030 INFO L85 PathProgramCache]: Analyzing trace with hash 374509, now seen corresponding path program 1 times [2022-07-26 13:59:23,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:23,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314023111] [2022-07-26 13:59:23,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:23,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:23,035 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:59:23,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:23,037 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:59:23,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-26 13:59:23,038 INFO L85 PathProgramCache]: Analyzing trace with hash -110625455, now seen corresponding path program 1 times [2022-07-26 13:59:23,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-26 13:59:23,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956774292] [2022-07-26 13:59:23,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-26 13:59:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-26 13:59:23,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:23,059 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-26 13:59:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-26 13:59:23,075 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-26 13:59:26,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 26.07 01:59:26 BoogieIcfgContainer [2022-07-26 13:59:26,118 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-07-26 13:59:26,119 INFO L158 Benchmark]: Toolchain (without parser) took 19345.39ms. Allocated memory was 184.5MB in the beginning and 346.0MB in the end (delta: 161.5MB). Free memory was 124.3MB in the beginning and 163.7MB in the end (delta: -39.4MB). Peak memory consumption was 176.9MB. Max. memory is 8.0GB. [2022-07-26 13:59:26,120 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 184.5MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-07-26 13:59:26,120 INFO L158 Benchmark]: CACSL2BoogieTranslator took 652.01ms. Allocated memory was 184.5MB in the beginning and 240.1MB in the end (delta: 55.6MB). Free memory was 124.2MB in the beginning and 195.3MB in the end (delta: -71.2MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. [2022-07-26 13:59:26,121 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.20ms. Allocated memory is still 240.1MB. Free memory was 194.8MB in the beginning and 192.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-07-26 13:59:26,121 INFO L158 Benchmark]: Boogie Preprocessor took 26.96ms. Allocated memory is still 240.1MB. Free memory was 192.7MB in the beginning and 191.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-07-26 13:59:26,122 INFO L158 Benchmark]: RCFGBuilder took 431.42ms. Allocated memory is still 240.1MB. Free memory was 191.2MB in the beginning and 175.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-07-26 13:59:26,122 INFO L158 Benchmark]: BuchiAutomizer took 18172.72ms. Allocated memory was 240.1MB in the beginning and 346.0MB in the end (delta: 105.9MB). Free memory was 175.4MB in the beginning and 163.7MB in the end (delta: 11.8MB). Peak memory consumption was 174.3MB. Max. memory is 8.0GB. [2022-07-26 13:59:26,125 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.19ms. Allocated memory is still 184.5MB. Free memory is still 142.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 652.01ms. Allocated memory was 184.5MB in the beginning and 240.1MB in the end (delta: 55.6MB). Free memory was 124.2MB in the beginning and 195.3MB in the end (delta: -71.2MB). Peak memory consumption was 10.4MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 53.20ms. Allocated memory is still 240.1MB. Free memory was 194.8MB in the beginning and 192.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.96ms. Allocated memory is still 240.1MB. Free memory was 192.7MB in the beginning and 191.2MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 431.42ms. Allocated memory is still 240.1MB. Free memory was 191.2MB in the beginning and 175.4MB in the end (delta: 15.7MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 18172.72ms. Allocated memory was 240.1MB in the beginning and 346.0MB in the end (delta: 105.9MB). Free memory was 175.4MB in the beginning and 163.7MB in the end (delta: 11.8MB). Peak memory consumption was 174.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 3 terminating modules (2 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function 5 + i * -2 and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 516 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.0s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 11.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 2. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 59 StatesRemovedByMinimization, 2 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 [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 75 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 65 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 28 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital499 mio100 ax142 hnf100 lsp62 ukn36 mio100 lsp15 div100 bol100 ite100 ukn100 eq223 hnf86 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms 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: 5.9s - 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@2790fbc0=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3f881f65=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@41b1a88b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b2c26d4 in0,-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5e7125f4 in0,0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@752d8fd6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@13803816=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@572f5238=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@12194b1e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@190df40b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5b9fae28=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@6fefe6f4=0, t1={22387:0}, t2={22386: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 < 3 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: 5.8s, 129 PlacesBefore, 32 PlacesAfterwards, 132 TransitionsBefore, 30 TransitionsAfterwards, 1922 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 28 ConcurrentSequentialCompositions, 7 TrivialYvCompositions, 11 ConcurrentYvCompositions, 5 ChoiceCompositions, 118 TotalNumberOfCompositions, 4186 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2606, positive: 2451, positive conditional: 0, positive unconditional: 2451, negative: 155, negative conditional: 0, negative unconditional: 155, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1315, positive: 1274, positive conditional: 0, positive unconditional: 1274, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1315, positive: 1251, positive conditional: 0, positive unconditional: 1251, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 64, positive: 23, positive conditional: 0, positive unconditional: 23, negative: 41, negative conditional: 0, negative unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 142, positive: 48, positive conditional: 0, positive unconditional: 48, negative: 94, negative conditional: 0, negative unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2606, positive: 1177, positive conditional: 0, positive unconditional: 1177, negative: 114, negative conditional: 0, negative unconditional: 114, unknown: 1315, unknown conditional: 0, unknown unconditional: 1315] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 151, Positive conditional cache size: 0, Positive unconditional cache size: 151, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19 RESULT: Ultimate proved your program to be incorrect! [2022-07-26 13:59:26,176 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...