/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/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf --buchiautomizer.fairness.type.for.concurrent.programs NONE -i ../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-wip.me.fairness-42053ae-m [2023-09-17 11:19:46,061 INFO L172 SettingsManager]: Resetting all preferences to default values... [2023-09-17 11:19:46,123 INFO L100 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Termination-32bit-Automizer_Default.epf [2023-09-17 11:19:46,155 INFO L114 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-17 11:19:46,156 INFO L135 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-17 11:19:46,156 INFO L137 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-17 11:19:46,157 INFO L135 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-17 11:19:46,157 INFO L137 SettingsManager]: * Create parallel compositions if possible=false [2023-09-17 11:19:46,158 INFO L137 SettingsManager]: * Use SBE=true [2023-09-17 11:19:46,161 INFO L135 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2023-09-17 11:19:46,161 INFO L137 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2023-09-17 11:19:46,161 INFO L137 SettingsManager]: * Use old map elimination=false [2023-09-17 11:19:46,161 INFO L137 SettingsManager]: * Use external solver (rank synthesis)=false [2023-09-17 11:19:46,162 INFO L137 SettingsManager]: * Use only trivial implications for array writes=true [2023-09-17 11:19:46,163 INFO L137 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2023-09-17 11:19:46,163 INFO L135 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-17 11:19:46,163 INFO L137 SettingsManager]: * sizeof long=4 [2023-09-17 11:19:46,164 INFO L137 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-17 11:19:46,164 INFO L137 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-17 11:19:46,164 INFO L137 SettingsManager]: * sizeof POINTER=4 [2023-09-17 11:19:46,164 INFO L137 SettingsManager]: * Check division by zero=IGNORE [2023-09-17 11:19:46,164 INFO L137 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2023-09-17 11:19:46,165 INFO L137 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2023-09-17 11:19:46,165 INFO L137 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2023-09-17 11:19:46,166 INFO L137 SettingsManager]: * sizeof long double=12 [2023-09-17 11:19:46,166 INFO L137 SettingsManager]: * Check if freed pointer was valid=false [2023-09-17 11:19:46,166 INFO L137 SettingsManager]: * Assume nondeterminstic values are in range=false [2023-09-17 11:19:46,166 INFO L137 SettingsManager]: * Use constant arrays=true [2023-09-17 11:19:46,166 INFO L137 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2023-09-17 11:19:46,166 INFO L135 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-17 11:19:46,167 INFO L137 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-17 11:19:46,167 INFO L135 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-17 11:19:46,167 INFO L137 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-17 11:19:46,167 INFO L137 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-09-17 11:19:46,169 INFO L135 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2023-09-17 11:19:46,169 INFO L137 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: Fairness type for concurrent programs -> NONE [2023-09-17 11:19:46,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-17 11:19:46,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-17 11:19:46,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-17 11:19:46,397 INFO L270 PluginConnector]: Initializing CDTParser... [2023-09-17 11:19:46,398 INFO L274 PluginConnector]: CDTParser initialized [2023-09-17 11:19:46,400 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2023-09-17 11:19:47,451 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-09-17 11:19:47,675 INFO L384 CDTParser]: Found 1 translation units. [2023-09-17 11:19:47,676 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c [2023-09-17 11:19:47,686 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd118205/26361977b5f14b96bfe94d9be12f8b13/FLAGc4bc971da [2023-09-17 11:19:47,701 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd118205/26361977b5f14b96bfe94d9be12f8b13 [2023-09-17 11:19:47,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-17 11:19:47,704 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-09-17 11:19:47,705 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-17 11:19:47,705 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-17 11:19:47,715 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-17 11:19:47,717 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,718 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51eee698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47, skipping insertion in model container [2023-09-17 11:19:47,718 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-17 11:19:47,741 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-17 11:19:47,857 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c[2787,2800] [2023-09-17 11:19:47,858 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:19:47,866 INFO L203 MainTranslator]: Completed pre-run [2023-09-17 11:19:47,888 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-misc-3-extended.wvr.c[2787,2800] [2023-09-17 11:19:47,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-17 11:19:47,902 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:19:47,903 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-09-17 11:19:47,907 INFO L208 MainTranslator]: Completed translation [2023-09-17 11:19:47,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47 WrapperNode [2023-09-17 11:19:47,908 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-17 11:19:47,909 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-17 11:19:47,909 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-17 11:19:47,909 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-17 11:19:47,925 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,931 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,952 INFO L138 Inliner]: procedures = 22, calls = 34, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 62 [2023-09-17 11:19:47,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-17 11:19:47,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-17 11:19:47,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-17 11:19:47,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-09-17 11:19:47,974 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,974 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:47,984 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-17 11:19:47,985 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-17 11:19:47,985 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-09-17 11:19:47,985 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-09-17 11:19:47,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (1/1) ... [2023-09-17 11:19:48,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2023-09-17 11:19:48,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-17 11:19:48,078 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) [2023-09-17 11:19:48,100 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 [2023-09-17 11:19:48,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-17 11:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-17 11:19:48,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-17 11:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-17 11:19:48,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-17 11:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-17 11:19:48,123 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-17 11:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-17 11:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-17 11:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-17 11:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-09-17 11:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-09-17 11:19:48,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-17 11:19:48,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-17 11:19:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-17 11:19:48,127 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-17 11:19:48,191 INFO L236 CfgBuilder]: Building ICFG [2023-09-17 11:19:48,192 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-17 11:19:48,403 INFO L277 CfgBuilder]: Performing block encoding [2023-09-17 11:19:48,420 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-17 11:19:48,421 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-09-17 11:19:48,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:19:48 BoogieIcfgContainer [2023-09-17 11:19:48,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-17 11:19:48,423 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2023-09-17 11:19:48,423 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2023-09-17 11:19:48,426 INFO L274 PluginConnector]: BuchiAutomizer initialized [2023-09-17 11:19:48,427 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:19:48,427 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 17.09 11:19:47" (1/3) ... [2023-09-17 11:19:48,427 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79c4d0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:19:48, skipping insertion in model container [2023-09-17 11:19:48,427 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:19:48,428 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.09 11:19:47" (2/3) ... [2023-09-17 11:19:48,428 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@79c4d0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 17.09 11:19:48, skipping insertion in model container [2023-09-17 11:19:48,428 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2023-09-17 11:19:48,428 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.09 11:19:48" (3/3) ... [2023-09-17 11:19:48,429 INFO L332 chiAutomizerObserver]: Analyzing ICFG parallel-misc-3-extended.wvr.c [2023-09-17 11:19:48,484 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-09-17 11:19:48,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 119 transitions, 253 flow [2023-09-17 11:19:48,548 INFO L124 PetriNetUnfolderBase]: 16/113 cut-off events. [2023-09-17 11:19:48,548 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-09-17 11:19:48,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 16/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 153 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 88. Up to 4 conditions per place. [2023-09-17 11:19:48,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 119 transitions, 253 flow [2023-09-17 11:19:48,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 113 transitions, 235 flow [2023-09-17 11:19:48,569 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2023-09-17 11:19:48,569 INFO L304 stractBuchiCegarLoop]: Hoare is false [2023-09-17 11:19:48,569 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2023-09-17 11:19:48,569 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2023-09-17 11:19:48,569 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2023-09-17 11:19:48,569 INFO L308 stractBuchiCegarLoop]: Difference is false [2023-09-17 11:19:48,569 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2023-09-17 11:19:48,569 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2023-09-17 11:19:48,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 0 states, but on-demand construction may add more states [2023-09-17 11:19:52,076 INFO L131 ngComponentsAnalysis]: Automaton has 714 accepting balls. 50094 [2023-09-17 11:19:52,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:19:52,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:19:52,082 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:19:52,083 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-09-17 11:19:52,083 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2023-09-17 11:19:52,083 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand currently 50680 states, but on-demand construction may add more states [2023-09-17 11:19:53,283 INFO L131 ngComponentsAnalysis]: Automaton has 714 accepting balls. 50094 [2023-09-17 11:19:53,284 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:19:53,284 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:19:53,285 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:19:53,285 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2023-09-17 11:19:53,290 INFO L748 eck$LassoCheckResult]: Stem: 113#[$Ultimate##0]don't care [212] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 116#[L-1]don't care [222] L-1-->L-1-1: Formula: (= (select |v_#valid_16| 0) 0) InVars {#valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|} AuxVars[] AssignedVars[] 118#[L-1-1]don't care [294] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_4|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|} AuxVars[] AssignedVars[] 120#[L21]don't care [268] L21-->L21-1: Formula: (and (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_17|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[] 122#[L21-1]don't care [283] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[] 124#[L21-2]don't care [235] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 126#[L21-3]don't care [262] L21-3-->L21-4: Formula: (and (= (select |v_#valid_18| 2) 1) (= (select |v_#length_11| 2) 31)) InVars {#length=|v_#length_11|, #valid=|v_#valid_18|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] 128#[L21-4]don't care [247] L21-4-->L39: Formula: (= v_~pos~0_14 0) InVars {} OutVars{~pos~0=v_~pos~0_14} AuxVars[] AssignedVars[~pos~0] 130#[L39]don't care [284] L39-->L39-1: Formula: (= v_~d1~0_8 0) InVars {} OutVars{~d1~0=v_~d1~0_8} AuxVars[] AssignedVars[~d1~0] 132#[L39-1]don't care [266] L39-1-->L39-2: Formula: (= v_~d2~0_8 0) InVars {} OutVars{~d2~0=v_~d2~0_8} AuxVars[] AssignedVars[~d2~0] 134#[L39-2]don't care [296] L39-2-->L39-3: Formula: (= v_~d3~0_7 0) InVars {} OutVars{~d3~0=v_~d3~0_7} AuxVars[] AssignedVars[~d3~0] 136#[L39-3]don't care [237] L39-3-->L39-4: Formula: (= v_~g1~0_4 0) InVars {} OutVars{~g1~0=v_~g1~0_4} AuxVars[] AssignedVars[~g1~0] 138#[L39-4]don't care [198] L39-4-->L39-5: Formula: (= v_~g2~0_4 0) InVars {} OutVars{~g2~0=v_~g2~0_4} AuxVars[] AssignedVars[~g2~0] 140#[L39-5]don't care [232] L39-5-->L-1-2: Formula: (= v_~g3~0_4 0) InVars {} OutVars{~g3~0=v_~g3~0_4} AuxVars[] AssignedVars[~g3~0] 142#[L-1-2]don't care [297] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 144#[L-1-3]don't care [299] L-1-3-->L108: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 146#[L108]don't care [199] L108-->L108-1: Formula: (and (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_1|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_1|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 148#[L108-1]don't care [258] L108-1-->L108-2: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_3|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 150#[L108-2]don't care [267] L108-2-->L108-3: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 152#[L108-3]don't care [189] L108-3-->L112: Formula: (= v_~d1~0_7 1) InVars {} OutVars{~d1~0=v_~d1~0_7} AuxVars[] AssignedVars[~d1~0] 154#[L112]don't care [238] L112-->L113: Formula: (= v_~d2~0_7 1) InVars {} OutVars{~d2~0=v_~d2~0_7} AuxVars[] AssignedVars[~d2~0] 156#[L113]don't care [279] L113-->L114: Formula: (= v_~d3~0_8 1) InVars {} OutVars{~d3~0=v_~d3~0_8} AuxVars[] AssignedVars[~d3~0] 158#[L114]don't care [239] L114-->L115: Formula: (= v_~g1~0_5 1) InVars {} OutVars{~g1~0=v_~g1~0_5} AuxVars[] AssignedVars[~g1~0] 160#[L115]don't care [241] L115-->L116: Formula: (= v_~g2~0_5 1) InVars {} OutVars{~g2~0=v_~g2~0_5} AuxVars[] AssignedVars[~g2~0] 162#[L116]don't care [211] L116-->L119: Formula: (= v_~g3~0_5 1) InVars {} OutVars{~g3~0=v_~g3~0_5} AuxVars[] AssignedVars[~g3~0] 164#[L119]don't care [290] L119-->L119-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 166#[L119-1]don't care [210] L119-1-->L119-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 168#[L119-2]don't care [231] L119-2-->L119-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 170#[L119-3]don't care [356] L119-3-->L53-1: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_12|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 172#[L53-1, L119-4]don't care [2023-09-17 11:19:53,291 INFO L750 eck$LassoCheckResult]: Loop: 172#[L53-1, L119-4]don't care [300] L53-1-->L43: Formula: (not (= (mod v_~g1~0_2 256) 0)) InVars {~g1~0=v_~g1~0_2} OutVars{~g1~0=v_~g1~0_2} AuxVars[] AssignedVars[] 174#[L119-4, L43]don't care [304] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[] 180#[L119-4, L48]don't care [307] L48-->L50: Formula: (= v_~pos~0_18 (+ v_~pos~0_17 1)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0] 192#[L119-4, L50]don't care [309] L50-->L53: Formula: (= v_~d1~0_4 (ite (= (ite (= (mod v_~d1~0_5 256) 0) 1 0) 0) 0 1)) InVars {~d1~0=v_~d1~0_5} OutVars{~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[~d1~0] 208#[L119-4, L53]don't care [311] L53-->L53-1: Formula: (= (mod v_~d1~0_1 256) 0) InVars {~d1~0=v_~d1~0_1} OutVars{~d1~0=v_~d1~0_1} AuxVars[] AssignedVars[] 172#[L53-1, L119-4]don't care [2023-09-17 11:19:53,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:19:53,295 INFO L85 PathProgramCache]: Analyzing trace with hash 845555071, now seen corresponding path program 1 times [2023-09-17 11:19:53,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:19:53,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426861248] [2023-09-17 11:19:53,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:19:53,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:19:53,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:53,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:19:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:53,431 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:19:53,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:19:53,433 INFO L85 PathProgramCache]: Analyzing trace with hash 315046832, now seen corresponding path program 1 times [2023-09-17 11:19:53,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:19:53,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105747421] [2023-09-17 11:19:53,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:19:53,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:19:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-17 11:19:53,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-17 11:19:53,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-17 11:19:53,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105747421] [2023-09-17 11:19:53,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105747421] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-17 11:19:53,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-17 11:19:53,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-17 11:19:53,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883930418] [2023-09-17 11:19:53,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-17 11:19:53,617 INFO L765 eck$LassoCheckResult]: loop already infeasible [2023-09-17 11:19:53,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-17 11:19:53,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-17 11:19:53,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-17 11:19:53,644 INFO L87 Difference]: Start difference. First operand currently 50680 states, but on-demand construction may add more states Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2023-09-17 11:19:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-09-17 11:19:54,172 INFO L93 Difference]: Finished difference Result 34847 states and 149317 transitions. [2023-09-17 11:19:54,173 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34847 states and 149317 transitions. [2023-09-17 11:19:54,951 INFO L131 ngComponentsAnalysis]: Automaton has 530 accepting balls. 34242 [2023-09-17 11:19:55,719 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34847 states to 34415 states and 147643 transitions. [2023-09-17 11:19:55,720 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34415 [2023-09-17 11:19:55,818 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34415 [2023-09-17 11:19:55,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34415 states and 147643 transitions. [2023-09-17 11:19:55,915 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-17 11:19:55,915 INFO L218 hiAutomatonCegarLoop]: Abstraction has 34415 states and 147643 transitions. [2023-09-17 11:19:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34415 states and 147643 transitions. [2023-09-17 11:19:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34415 to 29657. [2023-09-17 11:19:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29657 states, 29657 states have (on average 4.348922682671882) internal successors, (128976), 29656 states have internal predecessors, (128976), 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) [2023-09-17 11:19:57,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29657 states to 29657 states and 128976 transitions. [2023-09-17 11:19:57,527 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29657 states and 128976 transitions. [2023-09-17 11:19:57,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-17 11:19:57,533 INFO L428 stractBuchiCegarLoop]: Abstraction has 29657 states and 128976 transitions. [2023-09-17 11:19:57,533 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2023-09-17 11:19:57,533 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29657 states and 128976 transitions. [2023-09-17 11:19:58,023 INFO L131 ngComponentsAnalysis]: Automaton has 344 accepting balls. 29556 [2023-09-17 11:19:58,024 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2023-09-17 11:19:58,024 INFO L119 BuchiIsEmpty]: Starting construction of run [2023-09-17 11:19:58,025 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:19:58,025 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-17 11:19:58,026 INFO L748 eck$LassoCheckResult]: Stem: 175274#[$Ultimate##0]don't care [212] $Ultimate##0-->L-1: Formula: (and (= |v_#NULL.base_1| 0) (= |v_#NULL.offset_1| 0)) InVars {} OutVars{#NULL.offset=|v_#NULL.offset_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] 173982#[L-1]don't care [222] L-1-->L-1-1: Formula: (= (select |v_#valid_16| 0) 0) InVars {#valid=|v_#valid_16|} OutVars{#valid=|v_#valid_16|} AuxVars[] AssignedVars[] 143324#[L-1-1]don't care [294] L-1-1-->L21: Formula: (< 0 |v_#StackHeapBarrier_4|) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_4|} AuxVars[] AssignedVars[] 143326#[L21]don't care [268] L21-->L21-1: Formula: (and (= (select |v_#valid_17| 1) 1) (= 2 (select |v_#length_10| 1))) InVars {#length=|v_#length_10|, #valid=|v_#valid_17|} OutVars{#length=|v_#length_10|, #valid=|v_#valid_17|} AuxVars[] AssignedVars[] 158564#[L21-1]don't care [283] L21-1-->L21-2: Formula: (= (select (select |v_#memory_int_7| 1) 0) 48) InVars {#memory_int=|v_#memory_int_7|} OutVars{#memory_int=|v_#memory_int_7|} AuxVars[] AssignedVars[] 175400#[L21-2]don't care [235] L21-2-->L21-3: Formula: (= (select (select |v_#memory_int_8| 1) 1) 0) InVars {#memory_int=|v_#memory_int_8|} OutVars{#memory_int=|v_#memory_int_8|} AuxVars[] AssignedVars[] 175402#[L21-3]don't care [262] L21-3-->L21-4: Formula: (and (= (select |v_#valid_18| 2) 1) (= (select |v_#length_11| 2) 31)) InVars {#length=|v_#length_11|, #valid=|v_#valid_18|} OutVars{#length=|v_#length_11|, #valid=|v_#valid_18|} AuxVars[] AssignedVars[] 155998#[L21-4]don't care [247] L21-4-->L39: Formula: (= v_~pos~0_14 0) InVars {} OutVars{~pos~0=v_~pos~0_14} AuxVars[] AssignedVars[~pos~0] 156000#[L39]don't care [284] L39-->L39-1: Formula: (= v_~d1~0_8 0) InVars {} OutVars{~d1~0=v_~d1~0_8} AuxVars[] AssignedVars[~d1~0] 146374#[L39-1]don't care [266] L39-1-->L39-2: Formula: (= v_~d2~0_8 0) InVars {} OutVars{~d2~0=v_~d2~0_8} AuxVars[] AssignedVars[~d2~0] 143348#[L39-2]don't care [296] L39-2-->L39-3: Formula: (= v_~d3~0_7 0) InVars {} OutVars{~d3~0=v_~d3~0_7} AuxVars[] AssignedVars[~d3~0] 143350#[L39-3]don't care [237] L39-3-->L39-4: Formula: (= v_~g1~0_4 0) InVars {} OutVars{~g1~0=v_~g1~0_4} AuxVars[] AssignedVars[~g1~0] 174752#[L39-4]don't care [198] L39-4-->L39-5: Formula: (= v_~g2~0_4 0) InVars {} OutVars{~g2~0=v_~g2~0_4} AuxVars[] AssignedVars[~g2~0] 164788#[L39-5]don't care [232] L39-5-->L-1-2: Formula: (= v_~g3~0_4 0) InVars {} OutVars{~g3~0=v_~g3~0_4} AuxVars[] AssignedVars[~g3~0] 164790#[L-1-2]don't care [297] L-1-2-->L-1-3: Formula: true InVars {} OutVars{ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#res#1] 146908#[L-1-3]don't care [299] L-1-3-->L108: Formula: true InVars {} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_1|, ULTIMATE.start_main_#t~nondet9#1=|v_ULTIMATE.start_main_#t~nondet9#1_1|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_1|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_1|, ULTIMATE.start_main_#t~pre8#1=|v_ULTIMATE.start_main_#t~pre8#1_1|, ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_1|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_1|, ULTIMATE.start_main_#t~nondet11#1=|v_ULTIMATE.start_main_#t~nondet11#1_1|, ULTIMATE.start_main_#t~nondet7#1=|v_ULTIMATE.start_main_#t~nondet7#1_1|, ULTIMATE.start_main_#t~pre10#1=|v_ULTIMATE.start_main_#t~pre10#1_1|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet11#1, ULTIMATE.start_main_#t~pre6#1, ULTIMATE.start_main_#t~nondet9#1, ULTIMATE.start_main_~#t2~0#1.offset, ULTIMATE.start_main_~#t3~0#1.offset, ULTIMATE.start_main_#t~nondet7#1, ULTIMATE.start_main_#t~pre10#1, ULTIMATE.start_main_#t~pre8#1, ULTIMATE.start_main_~#t3~0#1.base, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset, ULTIMATE.start_main_~#t2~0#1.base] 146910#[L108]don't care [199] L108-->L108-1: Formula: (and (= (store |v_#valid_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 1) |v_#valid_1|) (= |v_ULTIMATE.start_main_~#t1~0#1.offset_2| 0) (= (select |v_#valid_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) 0) (< |v_#StackHeapBarrier_1| |v_ULTIMATE.start_main_~#t1~0#1.base_2|) (= (store |v_#length_2| |v_ULTIMATE.start_main_~#t1~0#1.base_2| 4) |v_#length_1|) (not (= |v_ULTIMATE.start_main_~#t1~0#1.base_2| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_2|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_2|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_2|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #length, ULTIMATE.start_main_~#t1~0#1.base, ULTIMATE.start_main_~#t1~0#1.offset] 188334#[L108-1]don't care [258] L108-1-->L108-2: Formula: (and (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) (not (= |v_ULTIMATE.start_main_~#t2~0#1.base_2| 0)) (= |v_#length_3| (store |v_#length_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 4)) (= 0 |v_ULTIMATE.start_main_~#t2~0#1.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2| 1) |v_#valid_3|) (= (select |v_#valid_4| |v_ULTIMATE.start_main_~#t2~0#1.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~#t2~0#1.offset=|v_ULTIMATE.start_main_~#t2~0#1.offset_2|, ULTIMATE.start_main_~#t2~0#1.base=|v_ULTIMATE.start_main_~#t2~0#1.base_2|, #valid=|v_#valid_3|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2~0#1.offset, #valid, #length, ULTIMATE.start_main_~#t2~0#1.base] 149526#[L108-2]don't care [267] L108-2-->L108-3: Formula: (and (< |v_#StackHeapBarrier_3| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) (= |v_ULTIMATE.start_main_~#t3~0#1.offset_2| 0) (= |v_#valid_5| (store |v_#valid_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 1)) (not (= |v_ULTIMATE.start_main_~#t3~0#1.base_2| 0)) (= (select |v_#valid_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2|) 0) (= |v_#length_5| (store |v_#length_6| |v_ULTIMATE.start_main_~#t3~0#1.base_2| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_6|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_main_~#t3~0#1.base=|v_ULTIMATE.start_main_~#t3~0#1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, #length=|v_#length_5|, ULTIMATE.start_main_~#t3~0#1.offset=|v_ULTIMATE.start_main_~#t3~0#1.offset_2|, #valid=|v_#valid_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t3~0#1.offset, #valid, ULTIMATE.start_main_~#t3~0#1.base, #length] 149528#[L108-3]don't care [189] L108-3-->L112: Formula: (= v_~d1~0_7 1) InVars {} OutVars{~d1~0=v_~d1~0_7} AuxVars[] AssignedVars[~d1~0] 189696#[L112]don't care [238] L112-->L113: Formula: (= v_~d2~0_7 1) InVars {} OutVars{~d2~0=v_~d2~0_7} AuxVars[] AssignedVars[~d2~0] 179908#[L113]don't care [279] L113-->L114: Formula: (= v_~d3~0_8 1) InVars {} OutVars{~d3~0=v_~d3~0_8} AuxVars[] AssignedVars[~d3~0] 166680#[L114]don't care [239] L114-->L115: Formula: (= v_~g1~0_5 1) InVars {} OutVars{~g1~0=v_~g1~0_5} AuxVars[] AssignedVars[~g1~0] 160494#[L115]don't care [241] L115-->L116: Formula: (= v_~g2~0_5 1) InVars {} OutVars{~g2~0=v_~g2~0_5} AuxVars[] AssignedVars[~g2~0] 160496#[L116]don't care [211] L116-->L119: Formula: (= v_~g3~0_5 1) InVars {} OutVars{~g3~0=v_~g3~0_5} AuxVars[] AssignedVars[~g3~0] 190528#[L119]don't care [290] L119-->L119-1: Formula: (= |v_ULTIMATE.start_main_#t~pre6#1_2| |v_#pthreadsForks_1|) InVars {#pthreadsForks=|v_#pthreadsForks_1|} OutVars{#pthreadsForks=|v_#pthreadsForks_1|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~pre6#1] 177692#[L119-1]don't care [210] L119-1-->L119-2: Formula: (= (+ 1 |v_#pthreadsForks_3|) |v_#pthreadsForks_2|) InVars {#pthreadsForks=|v_#pthreadsForks_3|} OutVars{#pthreadsForks=|v_#pthreadsForks_2|} AuxVars[] AssignedVars[#pthreadsForks] 177694#[L119-2]don't care [231] L119-2-->L119-3: Formula: (and (<= 0 |v_ULTIMATE.start_main_~#t1~0#1.offset_3|) (= (store |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3| (store (select |v_#memory_int_2| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) |v_ULTIMATE.start_main_~#t1~0#1.offset_3| |v_ULTIMATE.start_main_#t~pre6#1_3|)) |v_#memory_int_1|) (<= (+ |v_ULTIMATE.start_main_~#t1~0#1.offset_3| 4) (select |v_#length_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|)) (= (select |v_#valid_7| |v_ULTIMATE.start_main_~#t1~0#1.base_3|) 1)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} OutVars{ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_3|, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, #length=|v_#length_7|, ULTIMATE.start_main_~#t1~0#1.base=|v_ULTIMATE.start_main_~#t1~0#1.base_3|, ULTIMATE.start_main_~#t1~0#1.offset=|v_ULTIMATE.start_main_~#t1~0#1.offset_3|} AuxVars[] AssignedVars[#memory_int] 186050#[L119-3]don't care [356] L119-3-->L53-1: Formula: (and (= |v_ULTIMATE.start_main_#t~pre6#1_6| v_thread1Thread1of1ForFork0_thidvar0_2) (= v_thread1Thread1of1ForFork0_thidvar1_2 0)) InVars {ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_12|, ULTIMATE.start_main_#t~pre6#1=|v_ULTIMATE.start_main_#t~pre6#1_6|, thread1Thread1of1ForFork0_#res.base=|v_thread1Thread1of1ForFork0_#res.base_4|, thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_4|, thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_4|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_2, thread1Thread1of1ForFork0_#res.offset=|v_thread1Thread1of1ForFork0_#res.offset_4|, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_2} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3, thread1Thread1of1ForFork0_#res.base, thread1Thread1of1ForFork0_#t~post1, thread1Thread1of1ForFork0_#t~post2, thread1Thread1of1ForFork0_thidvar0, thread1Thread1of1ForFork0_#res.offset, thread1Thread1of1ForFork0_thidvar1] 186052#[L53-1, L119-4]don't care [2023-09-17 11:19:58,026 INFO L750 eck$LassoCheckResult]: Loop: 186052#[L53-1, L119-4]don't care [300] L53-1-->L43: Formula: (not (= (mod v_~g1~0_2 256) 0)) InVars {~g1~0=v_~g1~0_2} OutVars{~g1~0=v_~g1~0_2} AuxVars[] AssignedVars[] 194426#[L119-4, L43]don't care [303] L43-->L44: Formula: (not (= (mod v_~d1~0_2 256) 0)) InVars {~d1~0=v_~d1~0_2} OutVars{~d1~0=v_~d1~0_2} AuxVars[] AssignedVars[] 175984#[L119-4, L44]don't care [306] L44-->L50: Formula: (= v_~pos~0_23 (+ v_~pos~0_24 1)) InVars {~pos~0=v_~pos~0_24} OutVars{thread1Thread1of1ForFork0_#t~post1=|v_thread1Thread1of1ForFork0_#t~post1_1|, ~pos~0=v_~pos~0_23} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post1, ~pos~0] 175986#[L119-4, L50]don't care [309] L50-->L53: Formula: (= v_~d1~0_4 (ite (= (ite (= (mod v_~d1~0_5 256) 0) 1 0) 0) 0 1)) InVars {~d1~0=v_~d1~0_5} OutVars{~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[~d1~0] 195162#[L119-4, L53]don't care [311] L53-->L53-1: Formula: (= (mod v_~d1~0_1 256) 0) InVars {~d1~0=v_~d1~0_1} OutVars{~d1~0=v_~d1~0_1} AuxVars[] AssignedVars[] 187598#[L53-1, L119-4]don't care [300] L53-1-->L43: Formula: (not (= (mod v_~g1~0_2 256) 0)) InVars {~g1~0=v_~g1~0_2} OutVars{~g1~0=v_~g1~0_2} AuxVars[] AssignedVars[] 187600#[L119-4, L43]don't care [304] L43-->L48: Formula: (= 0 (mod v_~d1~0_3 256)) InVars {~d1~0=v_~d1~0_3} OutVars{~d1~0=v_~d1~0_3} AuxVars[] AssignedVars[] 177194#[L119-4, L48]don't care [307] L48-->L50: Formula: (= v_~pos~0_18 (+ v_~pos~0_17 1)) InVars {~pos~0=v_~pos~0_18} OutVars{thread1Thread1of1ForFork0_#t~post2=|v_thread1Thread1of1ForFork0_#t~post2_1|, ~pos~0=v_~pos~0_17} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~post2, ~pos~0] 177196#[L119-4, L50]don't care [309] L50-->L53: Formula: (= v_~d1~0_4 (ite (= (ite (= (mod v_~d1~0_5 256) 0) 1 0) 0) 0 1)) InVars {~d1~0=v_~d1~0_5} OutVars{~d1~0=v_~d1~0_4} AuxVars[] AssignedVars[~d1~0] 180842#[L119-4, L53]don't care [310] L53-->L54: Formula: (not (= (mod v_~d1~0_6 256) 0)) InVars {~d1~0=v_~d1~0_6} OutVars{~d1~0=v_~d1~0_6} AuxVars[] AssignedVars[] 157074#[L119-4, L54]don't care [312] L54-->L54-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_1|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3] 143606#[L119-4, L54-1]don't care [314] L54-1-->L54-4: Formula: (= (mod |v_thread1Thread1of1ForFork0_#t~nondet3_5| 256) 0) InVars {thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_5|} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_5|} AuxVars[] AssignedVars[] 143610#[L119-4, L54-4]don't care [316] L54-4-->L53-1: Formula: true InVars {} OutVars{thread1Thread1of1ForFork0_#t~nondet3=|v_thread1Thread1of1ForFork0_#t~nondet3_9|} AuxVars[] AssignedVars[thread1Thread1of1ForFork0_#t~nondet3] 186052#[L53-1, L119-4]don't care [2023-09-17 11:19:58,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:19:58,027 INFO L85 PathProgramCache]: Analyzing trace with hash 845555071, now seen corresponding path program 2 times [2023-09-17 11:19:58,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:19:58,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081306690] [2023-09-17 11:19:58,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:19:58,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:19:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:58,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:19:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:58,074 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:19:58,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:19:58,075 INFO L85 PathProgramCache]: Analyzing trace with hash 512553210, now seen corresponding path program 1 times [2023-09-17 11:19:58,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:19:58,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687736938] [2023-09-17 11:19:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:19:58,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:19:58,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:58,097 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:19:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:58,105 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:19:58,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-17 11:19:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1154209732, now seen corresponding path program 1 times [2023-09-17 11:19:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-17 11:19:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072827861] [2023-09-17 11:19:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-17 11:19:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-17 11:19:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:58,127 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:19:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:58,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-09-17 11:19:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:58,948 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-09-17 11:19:58,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-09-17 11:19:59,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 17.09 11:19:59 BoogieIcfgContainer [2023-09-17 11:19:59,003 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2023-09-17 11:19:59,003 INFO L158 Benchmark]: Toolchain (without parser) took 11299.26ms. Allocated memory was 164.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 129.0MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 926.5MB. Max. memory is 8.0GB. [2023-09-17 11:19:59,004 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 164.6MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-09-17 11:19:59,004 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.51ms. Allocated memory is still 164.6MB. Free memory was 128.6MB in the beginning and 117.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-09-17 11:19:59,004 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.13ms. Allocated memory is still 164.6MB. Free memory was 117.4MB in the beginning and 115.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-09-17 11:19:59,005 INFO L158 Benchmark]: Boogie Preprocessor took 30.66ms. Allocated memory is still 164.6MB. Free memory was 115.7MB in the beginning and 114.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-09-17 11:19:59,005 INFO L158 Benchmark]: RCFGBuilder took 437.81ms. Allocated memory is still 164.6MB. Free memory was 114.3MB in the beginning and 99.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-09-17 11:19:59,005 INFO L158 Benchmark]: BuchiAutomizer took 10579.39ms. Allocated memory was 164.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 98.9MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 897.1MB. Max. memory is 8.0GB. [2023-09-17 11:19:59,007 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 164.6MB. Free memory is still 119.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 203.51ms. Allocated memory is still 164.6MB. Free memory was 128.6MB in the beginning and 117.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.13ms. Allocated memory is still 164.6MB. Free memory was 117.4MB in the beginning and 115.7MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.66ms. Allocated memory is still 164.6MB. Free memory was 115.7MB in the beginning and 114.3MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 437.81ms. Allocated memory is still 164.6MB. Free memory was 114.3MB in the beginning and 99.3MB in the end (delta: 15.0MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * BuchiAutomizer took 10579.39ms. Allocated memory was 164.6MB in the beginning and 5.7GB in the end (delta: 5.5GB). Free memory was 98.9MB in the beginning and 4.7GB in the end (delta: -4.6GB). Peak memory consumption was 897.1MB. 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 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 4 locations. The remainder module has 29657 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 10.4s and 2 iterations. TraceHistogramMax:2. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 3.8s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 1.6s AutomataMinimizationTime, 1 MinimizatonAttempts, 4758 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 1.5s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 143 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 143 mSDsluCounter, 294 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 144 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 42]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L38] 0 int pos; VAL [pos=0] [L39] 0 _Bool d1, d2, d3, g1, g2, g3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L108] 0 pthread_t t1, t2, t3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L111] 0 d1 = 1 VAL [d1=1, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L112] 0 d2 = 1 VAL [d1=1, d2=1, d3=0, g1=0, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L113] 0 d3 = 1 VAL [d1=1, d2=1, d3=1, g1=0, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L114] 0 g1 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L115] 0 g2 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L116] 0 g3 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L119] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0, pthread_create(&t1, 0, thread1, 0)=-1, t1={27799:0}, t2={27801:0}, t3={27800:0}] Loop: [L42] COND TRUE \read(g1) [L43] COND TRUE \read(d1) [L45] pos++ [L52] d1 = !d1 [L53] COND FALSE !(\read(d1)) [L42] COND TRUE \read(g1) [L43] COND FALSE !(\read(d1)) [L49] pos-- [L52] d1 = !d1 [L53] COND TRUE \read(d1) [L54] COND FALSE !(__VERIFIER_nondet_bool()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 42]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L38] 0 int pos; VAL [pos=0] [L39] 0 _Bool d1, d2, d3, g1, g2, g3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0] [L108] 0 pthread_t t1, t2, t3; VAL [d1=0, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L111] 0 d1 = 1 VAL [d1=1, d2=0, d3=0, g1=0, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L112] 0 d2 = 1 VAL [d1=1, d2=1, d3=0, g1=0, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L113] 0 d3 = 1 VAL [d1=1, d2=1, d3=1, g1=0, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L114] 0 g1 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=0, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L115] 0 g2 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=0, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L116] 0 g3 = 1 VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0, t1={27799:0}, t2={27801:0}, t3={27800:0}] [L119] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [d1=1, d2=1, d3=1, g1=1, g2=1, g3=1, pos=0, pthread_create(&t1, 0, thread1, 0)=-1, t1={27799:0}, t2={27801:0}, t3={27800:0}] Loop: [L42] COND TRUE \read(g1) [L43] COND TRUE \read(d1) [L45] pos++ [L52] d1 = !d1 [L53] COND FALSE !(\read(d1)) [L42] COND TRUE \read(g1) [L43] COND FALSE !(\read(d1)) [L49] pos-- [L52] d1 = !d1 [L53] COND TRUE \read(d1) [L54] COND FALSE !(__VERIFIER_nondet_bool()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2023-09-17 11:19:59,044 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...