/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-?-3902331-m [2022-09-20 22:29:05,866 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-09-20 22:29:05,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-09-20 22:29:05,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-09-20 22:29:05,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-09-20 22:29:05,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-09-20 22:29:05,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-09-20 22:29:05,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-09-20 22:29:05,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-09-20 22:29:05,926 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-09-20 22:29:05,926 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-09-20 22:29:05,928 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-09-20 22:29:05,928 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-09-20 22:29:05,930 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-09-20 22:29:05,931 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-09-20 22:29:05,933 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-09-20 22:29:05,934 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-09-20 22:29:05,935 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-09-20 22:29:05,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-09-20 22:29:05,942 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-09-20 22:29:05,944 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-09-20 22:29:05,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-09-20 22:29:05,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-09-20 22:29:05,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-09-20 22:29:05,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-09-20 22:29:05,955 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-09-20 22:29:05,955 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-09-20 22:29:05,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-09-20 22:29:05,957 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-09-20 22:29:05,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-09-20 22:29:05,958 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-09-20 22:29:05,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-09-20 22:29:05,960 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-09-20 22:29:05,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-09-20 22:29:05,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-09-20 22:29:05,962 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-09-20 22:29:05,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-09-20 22:29:05,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-09-20 22:29:05,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-09-20 22:29:05,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-09-20 22:29:05,964 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-09-20 22:29:05,965 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-09-20 22:29:05,994 INFO L113 SettingsManager]: Loading preferences was successful [2022-09-20 22:29:05,994 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-09-20 22:29:05,995 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-09-20 22:29:05,996 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-09-20 22:29:05,996 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-09-20 22:29:05,996 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-09-20 22:29:05,996 INFO L138 SettingsManager]: * Use SBE=true [2022-09-20 22:29:05,996 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-09-20 22:29:05,997 INFO L138 SettingsManager]: * sizeof long=4 [2022-09-20 22:29:05,997 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-09-20 22:29:05,997 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-09-20 22:29:05,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-09-20 22:29:05,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-09-20 22:29:05,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-09-20 22:29:05,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-09-20 22:29:05,998 INFO L138 SettingsManager]: * sizeof long double=12 [2022-09-20 22:29:05,998 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-09-20 22:29:05,998 INFO L138 SettingsManager]: * Use constant arrays=true [2022-09-20 22:29:05,998 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-09-20 22:29:05,998 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-09-20 22:29:05,999 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-09-20 22:29:05,999 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-09-20 22:29:05,999 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-09-20 22:29:05,999 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:29:05,999 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-09-20 22:29:06,000 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-09-20 22:29:06,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-09-20 22:29:06,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-09-20 22:29:06,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-09-20 22:29:06,001 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-09-20 22:29:06,001 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-09-20 22:29:06,001 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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-09-20 22:29:06,224 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-09-20 22:29:06,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-09-20 22:29:06,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-09-20 22:29:06,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-09-20 22:29:06,251 INFO L275 PluginConnector]: CDTParser initialized [2022-09-20 22:29:06,252 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-09-20 22:29:06,316 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c14ef80/6acacdab5c4a4495bf66958101f902a4/FLAGb4d807171 [2022-09-20 22:29:06,821 INFO L306 CDTParser]: Found 1 translation units. [2022-09-20 22:29:06,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix051_tso.oepc.i [2022-09-20 22:29:06,856 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c14ef80/6acacdab5c4a4495bf66958101f902a4/FLAGb4d807171 [2022-09-20 22:29:07,301 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c14ef80/6acacdab5c4a4495bf66958101f902a4 [2022-09-20 22:29:07,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-09-20 22:29:07,305 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-09-20 22:29:07,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-09-20 22:29:07,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-09-20 22:29:07,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-09-20 22:29:07,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:07,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32796962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07, skipping insertion in model container [2022-09-20 22:29:07,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:07,341 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-09-20 22:29:07,392 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-09-20 22:29:07,541 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-wmm/mix051_tso.oepc.i[949,962] [2022-09-20 22:29:07,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:29:07,770 INFO L203 MainTranslator]: Completed pre-run [2022-09-20 22:29:07,780 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-wmm/mix051_tso.oepc.i[949,962] [2022-09-20 22:29:07,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-09-20 22:29:07,868 INFO L208 MainTranslator]: Completed translation [2022-09-20 22:29:07,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07 WrapperNode [2022-09-20 22:29:07,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-09-20 22:29:07,870 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-09-20 22:29:07,870 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-09-20 22:29:07,870 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-09-20 22:29:07,877 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:07,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:07,958 INFO L138 Inliner]: procedures = 177, calls = 67, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 291 [2022-09-20 22:29:07,958 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-09-20 22:29:07,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-09-20 22:29:07,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-09-20 22:29:07,959 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-09-20 22:29:07,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:07,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:07,983 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:07,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:07,994 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:07,997 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:08,015 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:08,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-09-20 22:29:08,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-09-20 22:29:08,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-09-20 22:29:08,020 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-09-20 22:29:08,028 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (1/1) ... [2022-09-20 22:29:08,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-09-20 22:29:08,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-09-20 22:29:08,057 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-09-20 22:29:08,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-09-20 22:29:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-09-20 22:29:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-09-20 22:29:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-09-20 22:29:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-09-20 22:29:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-09-20 22:29:08,110 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-09-20 22:29:08,110 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-09-20 22:29:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-09-20 22:29:08,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-09-20 22:29:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-09-20 22:29:08,111 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-09-20 22:29:08,111 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-09-20 22:29:08,112 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-09-20 22:29:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-09-20 22:29:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-09-20 22:29:08,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-09-20 22:29:08,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-09-20 22:29:08,114 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-09-20 22:29:08,223 INFO L234 CfgBuilder]: Building ICFG [2022-09-20 22:29:08,224 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-09-20 22:29:08,808 INFO L275 CfgBuilder]: Performing block encoding [2022-09-20 22:29:09,190 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-09-20 22:29:09,191 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-09-20 22:29:09,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:29:09 BoogieIcfgContainer [2022-09-20 22:29:09,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-09-20 22:29:09,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-09-20 22:29:09,196 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-09-20 22:29:09,202 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-09-20 22:29:09,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 10:29:07" (1/3) ... [2022-09-20 22:29:09,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679c0d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:29:09, skipping insertion in model container [2022-09-20 22:29:09,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 10:29:07" (2/3) ... [2022-09-20 22:29:09,203 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@679c0d1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 10:29:09, skipping insertion in model container [2022-09-20 22:29:09,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 10:29:09" (3/3) ... [2022-09-20 22:29:09,205 INFO L112 eAbstractionObserver]: Analyzing ICFG mix051_tso.oepc.i [2022-09-20 22:29:09,220 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-09-20 22:29:09,220 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-09-20 22:29:09,220 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-09-20 22:29:09,290 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-09-20 22:29:09,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 136 transitions, 292 flow [2022-09-20 22:29:09,403 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-09-20 22:29:09,403 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:29:09,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 70 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 91. Up to 2 conditions per place. [2022-09-20 22:29:09,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 147 places, 136 transitions, 292 flow [2022-09-20 22:29:09,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 143 places, 132 transitions, 276 flow [2022-09-20 22:29:09,430 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-09-20 22:29:09,437 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5187c197, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-09-20 22:29:09,438 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-09-20 22:29:09,459 INFO L130 PetriNetUnfolder]: 0/63 cut-off events. [2022-09-20 22:29:09,459 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-09-20 22:29:09,459 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:09,461 INFO L208 CegarLoopForPetriNet]: trace 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, 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] [2022-09-20 22:29:09,461 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:09,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:09,465 INFO L85 PathProgramCache]: Analyzing trace with hash 622711834, now seen corresponding path program 1 times [2022-09-20 22:29:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:09,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566009453] [2022-09-20 22:29:09,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:09,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:09,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:09,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566009453] [2022-09-20 22:29:09,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566009453] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:09,813 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:09,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-09-20 22:29:09,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255212895] [2022-09-20 22:29:09,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:09,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-09-20 22:29:09,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:09,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-09-20 22:29:09,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-09-20 22:29:09,853 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 136 [2022-09-20 22:29:09,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 132 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-09-20 22:29:09,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:09,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 136 [2022-09-20 22:29:09,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:10,166 INFO L130 PetriNetUnfolder]: 161/674 cut-off events. [2022-09-20 22:29:10,167 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2022-09-20 22:29:10,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 976 conditions, 674 events. 161/674 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3712 event pairs, 35 based on Foata normal form. 27/670 useless extension candidates. Maximal degree in co-relation 919. Up to 187 conditions per place. [2022-09-20 22:29:10,178 INFO L137 encePairwiseOnDemand]: 131/136 looper letters, 17 selfloop transitions, 2 changer transitions 0/135 dead transitions. [2022-09-20 22:29:10,178 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 135 transitions, 326 flow [2022-09-20 22:29:10,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-09-20 22:29:10,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-09-20 22:29:10,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2022-09-20 22:29:10,198 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.9411764705882353 [2022-09-20 22:29:10,199 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2022-09-20 22:29:10,199 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2022-09-20 22:29:10,203 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:10,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2022-09-20 22:29:10,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 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-09-20 22:29:10,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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-09-20 22:29:10,219 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 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-09-20 22:29:10,221 INFO L175 Difference]: Start difference. First operand has 143 places, 132 transitions, 276 flow. Second operand 3 states and 384 transitions. [2022-09-20 22:29:10,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 135 transitions, 326 flow [2022-09-20 22:29:10,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 135 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-09-20 22:29:10,230 INFO L231 Difference]: Finished difference. Result has 139 places, 128 transitions, 268 flow [2022-09-20 22:29:10,232 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-09-20 22:29:10,238 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, -4 predicate places. [2022-09-20 22:29:10,239 INFO L495 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 268 flow [2022-09-20 22:29:10,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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-09-20 22:29:10,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:10,240 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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] [2022-09-20 22:29:10,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-09-20 22:29:10,241 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:10,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:10,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1216340586, now seen corresponding path program 1 times [2022-09-20 22:29:10,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:10,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953714120] [2022-09-20 22:29:10,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:10,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:10,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:10,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:10,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:10,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953714120] [2022-09-20 22:29:10,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953714120] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:10,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:10,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:29:10,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037874790] [2022-09-20 22:29:10,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:10,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:29:10,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:10,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:29:10,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:29:10,664 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-09-20 22:29:10,665 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 268 flow. Second operand has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 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-09-20 22:29:10,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:10,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-09-20 22:29:10,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:11,598 INFO L130 PetriNetUnfolder]: 1059/3132 cut-off events. [2022-09-20 22:29:11,598 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-09-20 22:29:11,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4901 conditions, 3132 events. 1059/3132 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 25971 event pairs, 476 based on Foata normal form. 0/3044 useless extension candidates. Maximal degree in co-relation 4843. Up to 906 conditions per place. [2022-09-20 22:29:11,616 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 25 selfloop transitions, 11 changer transitions 69/199 dead transitions. [2022-09-20 22:29:11,616 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 199 transitions, 618 flow [2022-09-20 22:29:11,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-09-20 22:29:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-09-20 22:29:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1649 transitions. [2022-09-20 22:29:11,620 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8660714285714286 [2022-09-20 22:29:11,621 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1649 transitions. [2022-09-20 22:29:11,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1649 transitions. [2022-09-20 22:29:11,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:11,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1649 transitions. [2022-09-20 22:29:11,626 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 117.78571428571429) internal successors, (1649), 14 states have internal predecessors, (1649), 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-09-20 22:29:11,630 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 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-09-20 22:29:11,631 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 136.0) internal successors, (2040), 15 states have internal predecessors, (2040), 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-09-20 22:29:11,631 INFO L175 Difference]: Start difference. First operand has 139 places, 128 transitions, 268 flow. Second operand 14 states and 1649 transitions. [2022-09-20 22:29:11,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 199 transitions, 618 flow [2022-09-20 22:29:11,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 199 transitions, 600 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-09-20 22:29:11,636 INFO L231 Difference]: Finished difference. Result has 161 places, 122 transitions, 344 flow [2022-09-20 22:29:11,636 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=344, PETRI_PLACES=161, PETRI_TRANSITIONS=122} [2022-09-20 22:29:11,637 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 18 predicate places. [2022-09-20 22:29:11,637 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 122 transitions, 344 flow [2022-09-20 22:29:11,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.75) internal successors, (902), 8 states have internal predecessors, (902), 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-09-20 22:29:11,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:11,638 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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] [2022-09-20 22:29:11,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-09-20 22:29:11,638 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:11,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:11,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1246524072, now seen corresponding path program 1 times [2022-09-20 22:29:11,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:11,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979524928] [2022-09-20 22:29:11,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:11,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:11,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:11,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:11,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:11,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979524928] [2022-09-20 22:29:11,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979524928] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:11,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:11,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-09-20 22:29:11,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411203966] [2022-09-20 22:29:11,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:11,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-09-20 22:29:11,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:11,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-09-20 22:29:11,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-09-20 22:29:11,994 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-09-20 22:29:11,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 122 transitions, 344 flow. Second operand has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 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-09-20 22:29:11,996 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:11,996 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-09-20 22:29:11,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:12,681 INFO L130 PetriNetUnfolder]: 764/1556 cut-off events. [2022-09-20 22:29:12,682 INFO L131 PetriNetUnfolder]: For 4597/4915 co-relation queries the response was YES. [2022-09-20 22:29:12,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5731 conditions, 1556 events. 764/1556 cut-off events. For 4597/4915 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 9808 event pairs, 172 based on Foata normal form. 36/1558 useless extension candidates. Maximal degree in co-relation 5657. Up to 777 conditions per place. [2022-09-20 22:29:12,703 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 27 selfloop transitions, 14 changer transitions 35/168 dead transitions. [2022-09-20 22:29:12,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 168 transitions, 826 flow [2022-09-20 22:29:12,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:29:12,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:29:12,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1490 transitions. [2022-09-20 22:29:12,707 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8427601809954751 [2022-09-20 22:29:12,707 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1490 transitions. [2022-09-20 22:29:12,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1490 transitions. [2022-09-20 22:29:12,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:12,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1490 transitions. [2022-09-20 22:29:12,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 114.61538461538461) internal successors, (1490), 13 states have internal predecessors, (1490), 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-09-20 22:29:12,715 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 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-09-20 22:29:12,716 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 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-09-20 22:29:12,716 INFO L175 Difference]: Start difference. First operand has 161 places, 122 transitions, 344 flow. Second operand 13 states and 1490 transitions. [2022-09-20 22:29:12,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 168 transitions, 826 flow [2022-09-20 22:29:12,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 168 transitions, 810 flow, removed 7 selfloop flow, removed 4 redundant places. [2022-09-20 22:29:12,731 INFO L231 Difference]: Finished difference. Result has 153 places, 125 transitions, 448 flow [2022-09-20 22:29:12,731 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=448, PETRI_PLACES=153, PETRI_TRANSITIONS=125} [2022-09-20 22:29:12,733 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 10 predicate places. [2022-09-20 22:29:12,733 INFO L495 AbstractCegarLoop]: Abstraction has has 153 places, 125 transitions, 448 flow [2022-09-20 22:29:12,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 110.7) internal successors, (1107), 10 states have internal predecessors, (1107), 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-09-20 22:29:12,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:12,736 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1] [2022-09-20 22:29:12,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-09-20 22:29:12,736 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:12,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:12,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1106792230, now seen corresponding path program 1 times [2022-09-20 22:29:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:12,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168994111] [2022-09-20 22:29:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:12,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:12,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:12,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:12,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168994111] [2022-09-20 22:29:12,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168994111] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:12,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:12,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:29:12,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145812407] [2022-09-20 22:29:12,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:12,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:29:12,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:12,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:29:12,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:29:12,975 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 136 [2022-09-20 22:29:12,976 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 125 transitions, 448 flow. Second operand has 8 states, 8 states have (on average 113.75) internal successors, (910), 8 states have internal predecessors, (910), 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-09-20 22:29:12,976 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:12,976 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 136 [2022-09-20 22:29:12,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:13,713 INFO L130 PetriNetUnfolder]: 778/1768 cut-off events. [2022-09-20 22:29:13,713 INFO L131 PetriNetUnfolder]: For 12988/13232 co-relation queries the response was YES. [2022-09-20 22:29:13,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8354 conditions, 1768 events. 778/1768 cut-off events. For 12988/13232 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11362 event pairs, 252 based on Foata normal form. 32/1747 useless extension candidates. Maximal degree in co-relation 8275. Up to 646 conditions per place. [2022-09-20 22:29:13,742 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 40 selfloop transitions, 9 changer transitions 46/190 dead transitions. [2022-09-20 22:29:13,742 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 190 transitions, 1322 flow [2022-09-20 22:29:13,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:29:13,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:29:13,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1544 transitions. [2022-09-20 22:29:13,746 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8733031674208145 [2022-09-20 22:29:13,746 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1544 transitions. [2022-09-20 22:29:13,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1544 transitions. [2022-09-20 22:29:13,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:13,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1544 transitions. [2022-09-20 22:29:13,750 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.76923076923077) internal successors, (1544), 13 states have internal predecessors, (1544), 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-09-20 22:29:13,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 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-09-20 22:29:13,754 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 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-09-20 22:29:13,755 INFO L175 Difference]: Start difference. First operand has 153 places, 125 transitions, 448 flow. Second operand 13 states and 1544 transitions. [2022-09-20 22:29:13,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 190 transitions, 1322 flow [2022-09-20 22:29:13,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 190 transitions, 1261 flow, removed 21 selfloop flow, removed 8 redundant places. [2022-09-20 22:29:13,769 INFO L231 Difference]: Finished difference. Result has 161 places, 130 transitions, 527 flow [2022-09-20 22:29:13,769 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=527, PETRI_PLACES=161, PETRI_TRANSITIONS=130} [2022-09-20 22:29:13,770 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 18 predicate places. [2022-09-20 22:29:13,770 INFO L495 AbstractCegarLoop]: Abstraction has has 161 places, 130 transitions, 527 flow [2022-09-20 22:29:13,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.75) internal successors, (910), 8 states have internal predecessors, (910), 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-09-20 22:29:13,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:13,771 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1] [2022-09-20 22:29:13,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-09-20 22:29:13,771 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:13,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:13,772 INFO L85 PathProgramCache]: Analyzing trace with hash 281897356, now seen corresponding path program 2 times [2022-09-20 22:29:13,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:13,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772482185] [2022-09-20 22:29:13,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:13,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:13,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:14,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:14,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:14,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772482185] [2022-09-20 22:29:14,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772482185] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:14,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:14,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-09-20 22:29:14,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483434883] [2022-09-20 22:29:14,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:14,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-09-20 22:29:14,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:14,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-09-20 22:29:14,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2022-09-20 22:29:14,018 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-09-20 22:29:14,019 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 130 transitions, 527 flow. Second operand has 11 states, 11 states have (on average 110.54545454545455) internal successors, (1216), 11 states have internal predecessors, (1216), 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-09-20 22:29:14,019 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:14,019 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-09-20 22:29:14,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:14,779 INFO L130 PetriNetUnfolder]: 763/1665 cut-off events. [2022-09-20 22:29:14,780 INFO L131 PetriNetUnfolder]: For 23964/24477 co-relation queries the response was YES. [2022-09-20 22:29:14,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10495 conditions, 1665 events. 763/1665 cut-off events. For 23964/24477 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10532 event pairs, 253 based on Foata normal form. 39/1652 useless extension candidates. Maximal degree in co-relation 10409. Up to 642 conditions per place. [2022-09-20 22:29:14,813 INFO L137 encePairwiseOnDemand]: 123/136 looper letters, 41 selfloop transitions, 15 changer transitions 46/194 dead transitions. [2022-09-20 22:29:14,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 194 transitions, 1731 flow [2022-09-20 22:29:14,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:29:14,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:29:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1835 transitions. [2022-09-20 22:29:14,818 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8432904411764706 [2022-09-20 22:29:14,818 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1835 transitions. [2022-09-20 22:29:14,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1835 transitions. [2022-09-20 22:29:14,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:14,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1835 transitions. [2022-09-20 22:29:14,823 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 114.6875) internal successors, (1835), 16 states have internal predecessors, (1835), 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-09-20 22:29:14,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 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-09-20 22:29:14,827 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 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-09-20 22:29:14,827 INFO L175 Difference]: Start difference. First operand has 161 places, 130 transitions, 527 flow. Second operand 16 states and 1835 transitions. [2022-09-20 22:29:14,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 194 transitions, 1731 flow [2022-09-20 22:29:14,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 194 transitions, 1438 flow, removed 141 selfloop flow, removed 10 redundant places. [2022-09-20 22:29:14,847 INFO L231 Difference]: Finished difference. Result has 167 places, 134 transitions, 589 flow [2022-09-20 22:29:14,847 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=589, PETRI_PLACES=167, PETRI_TRANSITIONS=134} [2022-09-20 22:29:14,848 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 24 predicate places. [2022-09-20 22:29:14,848 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 134 transitions, 589 flow [2022-09-20 22:29:14,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 110.54545454545455) internal successors, (1216), 11 states have internal predecessors, (1216), 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-09-20 22:29:14,849 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:14,849 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1, 1] [2022-09-20 22:29:14,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-09-20 22:29:14,849 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:14,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:14,850 INFO L85 PathProgramCache]: Analyzing trace with hash 753786122, now seen corresponding path program 1 times [2022-09-20 22:29:14,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:14,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988263693] [2022-09-20 22:29:14,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:14,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:15,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:15,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:15,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988263693] [2022-09-20 22:29:15,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988263693] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:15,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:15,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-09-20 22:29:15,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806099273] [2022-09-20 22:29:15,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:15,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-09-20 22:29:15,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:15,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-09-20 22:29:15,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-09-20 22:29:15,119 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-09-20 22:29:15,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 134 transitions, 589 flow. Second operand has 12 states, 12 states have (on average 110.5) internal successors, (1326), 12 states have internal predecessors, (1326), 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-09-20 22:29:15,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:15,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-09-20 22:29:15,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:15,984 INFO L130 PetriNetUnfolder]: 673/1511 cut-off events. [2022-09-20 22:29:15,984 INFO L131 PetriNetUnfolder]: For 25545/26114 co-relation queries the response was YES. [2022-09-20 22:29:15,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9745 conditions, 1511 events. 673/1511 cut-off events. For 25545/26114 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9379 event pairs, 131 based on Foata normal form. 58/1522 useless extension candidates. Maximal degree in co-relation 9654. Up to 631 conditions per place. [2022-09-20 22:29:16,018 INFO L137 encePairwiseOnDemand]: 121/136 looper letters, 46 selfloop transitions, 18 changer transitions 32/188 dead transitions. [2022-09-20 22:29:16,018 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 188 transitions, 1658 flow [2022-09-20 22:29:16,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-09-20 22:29:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-09-20 22:29:16,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1720 transitions. [2022-09-20 22:29:16,023 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8431372549019608 [2022-09-20 22:29:16,023 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1720 transitions. [2022-09-20 22:29:16,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1720 transitions. [2022-09-20 22:29:16,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:16,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1720 transitions. [2022-09-20 22:29:16,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 114.66666666666667) internal successors, (1720), 15 states have internal predecessors, (1720), 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-09-20 22:29:16,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 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-09-20 22:29:16,032 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 136.0) internal successors, (2176), 16 states have internal predecessors, (2176), 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-09-20 22:29:16,032 INFO L175 Difference]: Start difference. First operand has 167 places, 134 transitions, 589 flow. Second operand 15 states and 1720 transitions. [2022-09-20 22:29:16,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 188 transitions, 1658 flow [2022-09-20 22:29:16,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 188 transitions, 1374 flow, removed 135 selfloop flow, removed 13 redundant places. [2022-09-20 22:29:16,053 INFO L231 Difference]: Finished difference. Result has 167 places, 139 transitions, 642 flow [2022-09-20 22:29:16,053 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=642, PETRI_PLACES=167, PETRI_TRANSITIONS=139} [2022-09-20 22:29:16,054 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 24 predicate places. [2022-09-20 22:29:16,054 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 139 transitions, 642 flow [2022-09-20 22:29:16,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 110.5) internal successors, (1326), 12 states have internal predecessors, (1326), 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-09-20 22:29:16,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:16,055 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1, 1] [2022-09-20 22:29:16,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-09-20 22:29:16,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:16,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:16,056 INFO L85 PathProgramCache]: Analyzing trace with hash -184029273, now seen corresponding path program 1 times [2022-09-20 22:29:16,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:16,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792583524] [2022-09-20 22:29:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:16,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:16,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:16,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:16,172 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792583524] [2022-09-20 22:29:16,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792583524] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:16,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:16,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-09-20 22:29:16,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60128614] [2022-09-20 22:29:16,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:16,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-09-20 22:29:16,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:16,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-09-20 22:29:16,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-09-20 22:29:16,175 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-09-20 22:29:16,176 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 139 transitions, 642 flow. Second operand has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 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-09-20 22:29:16,176 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:16,176 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-09-20 22:29:16,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:17,863 INFO L130 PetriNetUnfolder]: 5006/8400 cut-off events. [2022-09-20 22:29:17,863 INFO L131 PetriNetUnfolder]: For 110858/111074 co-relation queries the response was YES. [2022-09-20 22:29:17,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42193 conditions, 8400 events. 5006/8400 cut-off events. For 110858/111074 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 60526 event pairs, 203 based on Foata normal form. 206/8447 useless extension candidates. Maximal degree in co-relation 42106. Up to 2926 conditions per place. [2022-09-20 22:29:17,985 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 131 selfloop transitions, 18 changer transitions 55/298 dead transitions. [2022-09-20 22:29:17,985 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 298 transitions, 2844 flow [2022-09-20 22:29:17,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-09-20 22:29:17,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-09-20 22:29:17,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1190 transitions. [2022-09-20 22:29:17,989 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.875 [2022-09-20 22:29:17,989 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1190 transitions. [2022-09-20 22:29:17,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1190 transitions. [2022-09-20 22:29:17,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:17,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1190 transitions. [2022-09-20 22:29:17,992 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 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-09-20 22:29:17,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 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-09-20 22:29:17,995 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 136.0) internal successors, (1496), 11 states have internal predecessors, (1496), 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-09-20 22:29:17,995 INFO L175 Difference]: Start difference. First operand has 167 places, 139 transitions, 642 flow. Second operand 10 states and 1190 transitions. [2022-09-20 22:29:17,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 298 transitions, 2844 flow [2022-09-20 22:29:18,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 298 transitions, 2149 flow, removed 275 selfloop flow, removed 16 redundant places. [2022-09-20 22:29:18,038 INFO L231 Difference]: Finished difference. Result has 160 places, 155 transitions, 653 flow [2022-09-20 22:29:18,038 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=653, PETRI_PLACES=160, PETRI_TRANSITIONS=155} [2022-09-20 22:29:18,039 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 17 predicate places. [2022-09-20 22:29:18,039 INFO L495 AbstractCegarLoop]: Abstraction has has 160 places, 155 transitions, 653 flow [2022-09-20 22:29:18,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.5) internal successors, (669), 6 states have internal predecessors, (669), 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-09-20 22:29:18,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:18,039 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1, 1, 1] [2022-09-20 22:29:18,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-09-20 22:29:18,040 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:18,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:18,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1869722206, now seen corresponding path program 1 times [2022-09-20 22:29:18,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:18,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540199934] [2022-09-20 22:29:18,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:18,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:18,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:18,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:18,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540199934] [2022-09-20 22:29:18,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540199934] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:18,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:18,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:29:18,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007391099] [2022-09-20 22:29:18,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:18,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:29:18,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:18,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:29:18,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:29:18,159 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-09-20 22:29:18,160 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 155 transitions, 653 flow. Second operand has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 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-09-20 22:29:18,160 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:18,160 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-09-20 22:29:18,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:19,717 INFO L130 PetriNetUnfolder]: 4554/7946 cut-off events. [2022-09-20 22:29:19,717 INFO L131 PetriNetUnfolder]: For 97569/97833 co-relation queries the response was YES. [2022-09-20 22:29:19,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41501 conditions, 7946 events. 4554/7946 cut-off events. For 97569/97833 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 59871 event pairs, 173 based on Foata normal form. 346/8258 useless extension candidates. Maximal degree in co-relation 41420. Up to 2233 conditions per place. [2022-09-20 22:29:19,891 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 147 selfloop transitions, 34 changer transitions 63/338 dead transitions. [2022-09-20 22:29:19,892 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 338 transitions, 2835 flow [2022-09-20 22:29:19,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-09-20 22:29:19,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-09-20 22:29:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1549 transitions. [2022-09-20 22:29:19,898 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.876131221719457 [2022-09-20 22:29:19,898 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1549 transitions. [2022-09-20 22:29:19,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1549 transitions. [2022-09-20 22:29:19,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:19,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1549 transitions. [2022-09-20 22:29:19,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.15384615384616) internal successors, (1549), 13 states have internal predecessors, (1549), 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-09-20 22:29:19,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 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-09-20 22:29:19,907 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 136.0) internal successors, (1904), 14 states have internal predecessors, (1904), 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-09-20 22:29:19,907 INFO L175 Difference]: Start difference. First operand has 160 places, 155 transitions, 653 flow. Second operand 13 states and 1549 transitions. [2022-09-20 22:29:19,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 338 transitions, 2835 flow [2022-09-20 22:29:19,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 338 transitions, 2833 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-09-20 22:29:19,956 INFO L231 Difference]: Finished difference. Result has 177 places, 169 transitions, 889 flow [2022-09-20 22:29:19,957 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=625, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=889, PETRI_PLACES=177, PETRI_TRANSITIONS=169} [2022-09-20 22:29:19,959 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 34 predicate places. [2022-09-20 22:29:19,960 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 169 transitions, 889 flow [2022-09-20 22:29:19,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 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-09-20 22:29:19,960 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:19,960 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:29:19,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-09-20 22:29:19,961 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:19,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:19,961 INFO L85 PathProgramCache]: Analyzing trace with hash -2142636167, now seen corresponding path program 1 times [2022-09-20 22:29:19,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:19,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542796693] [2022-09-20 22:29:19,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:19,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:20,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:20,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542796693] [2022-09-20 22:29:20,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542796693] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:20,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:20,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-09-20 22:29:20,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567295127] [2022-09-20 22:29:20,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:20,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-09-20 22:29:20,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:20,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-09-20 22:29:20,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-09-20 22:29:20,095 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-09-20 22:29:20,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 169 transitions, 889 flow. Second operand has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 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-09-20 22:29:20,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:20,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-09-20 22:29:20,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:21,776 INFO L130 PetriNetUnfolder]: 4153/7418 cut-off events. [2022-09-20 22:29:21,776 INFO L131 PetriNetUnfolder]: For 104514/104759 co-relation queries the response was YES. [2022-09-20 22:29:21,937 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43076 conditions, 7418 events. 4153/7418 cut-off events. For 104514/104759 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 57243 event pairs, 170 based on Foata normal form. 245/7629 useless extension candidates. Maximal degree in co-relation 42987. Up to 2013 conditions per place. [2022-09-20 22:29:21,970 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 133 selfloop transitions, 52 changer transitions 81/359 dead transitions. [2022-09-20 22:29:21,970 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 359 transitions, 3492 flow [2022-09-20 22:29:21,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-09-20 22:29:21,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-09-20 22:29:21,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1907 transitions. [2022-09-20 22:29:21,982 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8763786764705882 [2022-09-20 22:29:21,983 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1907 transitions. [2022-09-20 22:29:21,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1907 transitions. [2022-09-20 22:29:21,986 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:21,986 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1907 transitions. [2022-09-20 22:29:21,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 119.1875) internal successors, (1907), 16 states have internal predecessors, (1907), 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-09-20 22:29:22,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 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-09-20 22:29:22,075 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 136.0) internal successors, (2312), 17 states have internal predecessors, (2312), 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-09-20 22:29:22,075 INFO L175 Difference]: Start difference. First operand has 177 places, 169 transitions, 889 flow. Second operand 16 states and 1907 transitions. [2022-09-20 22:29:22,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 359 transitions, 3492 flow [2022-09-20 22:29:22,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 359 transitions, 3163 flow, removed 80 selfloop flow, removed 9 redundant places. [2022-09-20 22:29:22,362 INFO L231 Difference]: Finished difference. Result has 189 places, 185 transitions, 1160 flow [2022-09-20 22:29:22,363 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=731, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1160, PETRI_PLACES=189, PETRI_TRANSITIONS=185} [2022-09-20 22:29:22,364 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 46 predicate places. [2022-09-20 22:29:22,364 INFO L495 AbstractCegarLoop]: Abstraction has has 189 places, 185 transitions, 1160 flow [2022-09-20 22:29:22,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.25) internal successors, (890), 8 states have internal predecessors, (890), 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-09-20 22:29:22,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:22,365 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:29:22,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-09-20 22:29:22,365 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:22,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:22,365 INFO L85 PathProgramCache]: Analyzing trace with hash 583969977, now seen corresponding path program 1 times [2022-09-20 22:29:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:22,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462737110] [2022-09-20 22:29:22,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:22,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:22,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:22,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:22,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462737110] [2022-09-20 22:29:22,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462737110] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:22,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:22,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:29:22,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530158320] [2022-09-20 22:29:22,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:22,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:29:22,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:22,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:29:22,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:29:22,521 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-09-20 22:29:22,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 185 transitions, 1160 flow. Second operand has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 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-09-20 22:29:22,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:22,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-09-20 22:29:22,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:24,047 INFO L130 PetriNetUnfolder]: 3979/7153 cut-off events. [2022-09-20 22:29:24,047 INFO L131 PetriNetUnfolder]: For 90507/90708 co-relation queries the response was YES. [2022-09-20 22:29:24,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40119 conditions, 7153 events. 3979/7153 cut-off events. For 90507/90708 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 56904 event pairs, 112 based on Foata normal form. 140/7265 useless extension candidates. Maximal degree in co-relation 40027. Up to 1970 conditions per place. [2022-09-20 22:29:24,130 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 122 selfloop transitions, 57 changer transitions 87/359 dead transitions. [2022-09-20 22:29:24,130 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 359 transitions, 3265 flow [2022-09-20 22:29:24,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-09-20 22:29:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-09-20 22:29:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2219 transitions. [2022-09-20 22:29:24,135 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8587461300309598 [2022-09-20 22:29:24,135 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 2219 transitions. [2022-09-20 22:29:24,135 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 2219 transitions. [2022-09-20 22:29:24,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:24,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 2219 transitions. [2022-09-20 22:29:24,141 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 116.78947368421052) internal successors, (2219), 19 states have internal predecessors, (2219), 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-09-20 22:29:24,145 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 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-09-20 22:29:24,146 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 136.0) internal successors, (2720), 20 states have internal predecessors, (2720), 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-09-20 22:29:24,146 INFO L175 Difference]: Start difference. First operand has 189 places, 185 transitions, 1160 flow. Second operand 19 states and 2219 transitions. [2022-09-20 22:29:24,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 359 transitions, 3265 flow [2022-09-20 22:29:24,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 359 transitions, 3027 flow, removed 80 selfloop flow, removed 8 redundant places. [2022-09-20 22:29:24,692 INFO L231 Difference]: Finished difference. Result has 206 places, 185 transitions, 1100 flow [2022-09-20 22:29:24,693 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=959, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=54, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=1100, PETRI_PLACES=206, PETRI_TRANSITIONS=185} [2022-09-20 22:29:24,693 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 63 predicate places. [2022-09-20 22:29:24,693 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 185 transitions, 1100 flow [2022-09-20 22:29:24,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.22222222222223) internal successors, (1001), 9 states have internal predecessors, (1001), 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-09-20 22:29:24,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:24,694 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:29:24,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-09-20 22:29:24,695 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1251647534, now seen corresponding path program 1 times [2022-09-20 22:29:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:24,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146603696] [2022-09-20 22:29:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:24,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:24,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146603696] [2022-09-20 22:29:24,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146603696] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:24,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:24,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-09-20 22:29:24,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615157547] [2022-09-20 22:29:24,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:24,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-09-20 22:29:24,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:24,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-09-20 22:29:24,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-09-20 22:29:24,849 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 136 [2022-09-20 22:29:24,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 206 places, 185 transitions, 1100 flow. Second operand has 9 states, 9 states have (on average 111.44444444444444) internal successors, (1003), 9 states have internal predecessors, (1003), 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-09-20 22:29:24,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:24,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 136 [2022-09-20 22:29:24,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:25,843 INFO L130 PetriNetUnfolder]: 1409/4650 cut-off events. [2022-09-20 22:29:25,844 INFO L131 PetriNetUnfolder]: For 19516/20519 co-relation queries the response was YES. [2022-09-20 22:29:25,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17911 conditions, 4650 events. 1409/4650 cut-off events. For 19516/20519 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 52402 event pairs, 56 based on Foata normal form. 10/4365 useless extension candidates. Maximal degree in co-relation 17828. Up to 522 conditions per place. [2022-09-20 22:29:25,910 INFO L137 encePairwiseOnDemand]: 125/136 looper letters, 57 selfloop transitions, 31 changer transitions 5/244 dead transitions. [2022-09-20 22:29:25,910 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 244 transitions, 1739 flow [2022-09-20 22:29:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-09-20 22:29:25,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-09-20 22:29:25,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1028 transitions. [2022-09-20 22:29:25,913 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8398692810457516 [2022-09-20 22:29:25,914 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1028 transitions. [2022-09-20 22:29:25,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1028 transitions. [2022-09-20 22:29:25,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:25,914 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1028 transitions. [2022-09-20 22:29:25,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.22222222222223) internal successors, (1028), 9 states have internal predecessors, (1028), 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-09-20 22:29:25,918 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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-09-20 22:29:25,918 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 136.0) internal successors, (1360), 10 states have internal predecessors, (1360), 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-09-20 22:29:25,919 INFO L175 Difference]: Start difference. First operand has 206 places, 185 transitions, 1100 flow. Second operand 9 states and 1028 transitions. [2022-09-20 22:29:25,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 244 transitions, 1739 flow [2022-09-20 22:29:26,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 244 transitions, 1366 flow, removed 117 selfloop flow, removed 26 redundant places. [2022-09-20 22:29:26,182 INFO L231 Difference]: Finished difference. Result has 191 places, 215 transitions, 1196 flow [2022-09-20 22:29:26,183 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1196, PETRI_PLACES=191, PETRI_TRANSITIONS=215} [2022-09-20 22:29:26,183 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 48 predicate places. [2022-09-20 22:29:26,183 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 215 transitions, 1196 flow [2022-09-20 22:29:26,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 111.44444444444444) internal successors, (1003), 9 states have internal predecessors, (1003), 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-09-20 22:29:26,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:26,184 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:29:26,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-09-20 22:29:26,184 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:26,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:26,185 INFO L85 PathProgramCache]: Analyzing trace with hash 287090228, now seen corresponding path program 2 times [2022-09-20 22:29:26,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:26,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598276234] [2022-09-20 22:29:26,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:26,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:26,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:26,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:26,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598276234] [2022-09-20 22:29:26,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598276234] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:26,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:26,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:29:26,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926335889] [2022-09-20 22:29:26,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:26,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:29:26,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:26,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:29:26,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:29:26,312 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-09-20 22:29:26,312 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 215 transitions, 1196 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 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-09-20 22:29:26,312 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:26,313 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-09-20 22:29:26,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:27,872 INFO L130 PetriNetUnfolder]: 3166/10559 cut-off events. [2022-09-20 22:29:27,873 INFO L131 PetriNetUnfolder]: For 22559/23368 co-relation queries the response was YES. [2022-09-20 22:29:27,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32540 conditions, 10559 events. 3166/10559 cut-off events. For 22559/23368 co-relation queries the response was YES. Maximal size of possible extension queue 1379. Compared 139798 event pairs, 40 based on Foata normal form. 23/9955 useless extension candidates. Maximal degree in co-relation 32507. Up to 1165 conditions per place. [2022-09-20 22:29:28,024 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 118 selfloop transitions, 2 changer transitions 5/280 dead transitions. [2022-09-20 22:29:28,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 280 transitions, 2013 flow [2022-09-20 22:29:28,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:29:28,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:29:28,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 816 transitions. [2022-09-20 22:29:28,026 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2022-09-20 22:29:28,026 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 816 transitions. [2022-09-20 22:29:28,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 816 transitions. [2022-09-20 22:29:28,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:28,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 816 transitions. [2022-09-20 22:29:28,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.57142857142857) internal successors, (816), 7 states have internal predecessors, (816), 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-09-20 22:29:28,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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-09-20 22:29:28,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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-09-20 22:29:28,030 INFO L175 Difference]: Start difference. First operand has 191 places, 215 transitions, 1196 flow. Second operand 7 states and 816 transitions. [2022-09-20 22:29:28,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 280 transitions, 2013 flow [2022-09-20 22:29:28,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 280 transitions, 1979 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-09-20 22:29:28,541 INFO L231 Difference]: Finished difference. Result has 196 places, 216 transitions, 1197 flow [2022-09-20 22:29:28,542 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1178, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1197, PETRI_PLACES=196, PETRI_TRANSITIONS=216} [2022-09-20 22:29:28,542 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 53 predicate places. [2022-09-20 22:29:28,542 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 216 transitions, 1197 flow [2022-09-20 22:29:28,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 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-09-20 22:29:28,543 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:28,543 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:29:28,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-09-20 22:29:28,543 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash -701990844, now seen corresponding path program 3 times [2022-09-20 22:29:28,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:28,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050927315] [2022-09-20 22:29:28,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:28,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-09-20 22:29:28,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-09-20 22:29:28,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-09-20 22:29:28,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050927315] [2022-09-20 22:29:28,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050927315] provided 1 perfect and 0 imperfect interpolant sequences [2022-09-20 22:29:28,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-09-20 22:29:28,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-09-20 22:29:28,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980354897] [2022-09-20 22:29:28,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-09-20 22:29:28,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-09-20 22:29:28,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-09-20 22:29:28,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-09-20 22:29:28,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-09-20 22:29:28,739 INFO L477 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 136 [2022-09-20 22:29:28,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 216 transitions, 1197 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 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-09-20 22:29:28,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-09-20 22:29:28,740 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 136 [2022-09-20 22:29:28,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-09-20 22:29:31,360 INFO L130 PetriNetUnfolder]: 5261/17642 cut-off events. [2022-09-20 22:29:31,361 INFO L131 PetriNetUnfolder]: For 35545/36666 co-relation queries the response was YES. [2022-09-20 22:29:31,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53657 conditions, 17642 events. 5261/17642 cut-off events. For 35545/36666 co-relation queries the response was YES. Maximal size of possible extension queue 2265. Compared 254245 event pairs, 74 based on Foata normal form. 48/16618 useless extension candidates. Maximal degree in co-relation 53621. Up to 1841 conditions per place. [2022-09-20 22:29:31,615 INFO L137 encePairwiseOnDemand]: 130/136 looper letters, 97 selfloop transitions, 2 changer transitions 26/281 dead transitions. [2022-09-20 22:29:31,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 281 transitions, 1991 flow [2022-09-20 22:29:31,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-09-20 22:29:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-09-20 22:29:31,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 814 transitions. [2022-09-20 22:29:31,619 INFO L522 CegarLoopForPetriNet]: DFA transition density 0.8550420168067226 [2022-09-20 22:29:31,619 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 814 transitions. [2022-09-20 22:29:31,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 814 transitions. [2022-09-20 22:29:31,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-09-20 22:29:31,619 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 814 transitions. [2022-09-20 22:29:31,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 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-09-20 22:29:31,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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-09-20 22:29:31,622 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 136.0) internal successors, (1088), 8 states have internal predecessors, (1088), 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-09-20 22:29:31,622 INFO L175 Difference]: Start difference. First operand has 196 places, 216 transitions, 1197 flow. Second operand 7 states and 814 transitions. [2022-09-20 22:29:31,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 281 transitions, 1991 flow [2022-09-20 22:29:33,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 281 transitions, 1980 flow, removed 5 selfloop flow, removed 4 redundant places. [2022-09-20 22:29:33,080 INFO L231 Difference]: Finished difference. Result has 200 places, 208 transitions, 1137 flow [2022-09-20 22:29:33,080 INFO L270 CegarLoopForPetriNet]: {PETRI_ALPHABET=136, PETRI_DIFFERENCE_MINUEND_FLOW=1190, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1137, PETRI_PLACES=200, PETRI_TRANSITIONS=208} [2022-09-20 22:29:33,080 INFO L287 CegarLoopForPetriNet]: 143 programPoint places, 57 predicate places. [2022-09-20 22:29:33,081 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 208 transitions, 1137 flow [2022-09-20 22:29:33,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 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-09-20 22:29:33,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2022-09-20 22:29:33,081 INFO L208 CegarLoopForPetriNet]: trace 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:29:33,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-09-20 22:29:33,081 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-09-20 22:29:33,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-09-20 22:29:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1337580954, now seen corresponding path program 4 times [2022-09-20 22:29:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-09-20 22:29:33,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184153668] [2022-09-20 22:29:33,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-09-20 22:29:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-09-20 22:29:33,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:29:33,135 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-09-20 22:29:33,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-09-20 22:29:33,275 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-09-20 22:29:33,275 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-09-20 22:29:33,276 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-09-20 22:29:33,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-09-20 22:29:33,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-09-20 22:29:33,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-09-20 22:29:33,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-09-20 22:29:33,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-09-20 22:29:33,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-09-20 22:29:33,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-09-20 22:29:33,280 INFO L444 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-09-20 22:29:33,285 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-09-20 22:29:33,286 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-09-20 22:29:33,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 10:29:33 BasicIcfg [2022-09-20 22:29:33,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-09-20 22:29:33,475 INFO L158 Benchmark]: Toolchain (without parser) took 26170.49ms. Allocated memory was 197.1MB in the beginning and 4.6GB in the end (delta: 4.4GB). Free memory was 139.3MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 803.5MB. Max. memory is 8.0GB. [2022-09-20 22:29:33,476 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 197.1MB. Free memory was 157.5MB in the beginning and 157.4MB in the end (delta: 80.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-09-20 22:29:33,476 INFO L158 Benchmark]: CACSL2BoogieTranslator took 562.68ms. Allocated memory is still 197.1MB. Free memory was 139.1MB in the beginning and 157.6MB in the end (delta: -18.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-09-20 22:29:33,476 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.68ms. Allocated memory is still 197.1MB. Free memory was 157.6MB in the beginning and 154.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-09-20 22:29:33,476 INFO L158 Benchmark]: Boogie Preprocessor took 60.15ms. Allocated memory is still 197.1MB. Free memory was 154.5MB in the beginning and 152.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-09-20 22:29:33,477 INFO L158 Benchmark]: RCFGBuilder took 1173.35ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 152.1MB in the beginning and 166.2MB in the end (delta: -14.0MB). Peak memory consumption was 48.8MB. Max. memory is 8.0GB. [2022-09-20 22:29:33,477 INFO L158 Benchmark]: TraceAbstraction took 24279.51ms. Allocated memory was 237.0MB in the beginning and 4.6GB in the end (delta: 4.3GB). Free memory was 165.7MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 790.3MB. Max. memory is 8.0GB. [2022-09-20 22:29:33,478 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.16ms. Allocated memory is still 197.1MB. Free memory was 157.5MB in the beginning and 157.4MB in the end (delta: 80.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 562.68ms. Allocated memory is still 197.1MB. Free memory was 139.1MB in the beginning and 157.6MB in the end (delta: -18.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 88.68ms. Allocated memory is still 197.1MB. Free memory was 157.6MB in the beginning and 154.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.15ms. Allocated memory is still 197.1MB. Free memory was 154.5MB in the beginning and 152.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 1173.35ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 152.1MB in the beginning and 166.2MB in the end (delta: -14.0MB). Peak memory consumption was 48.8MB. Max. memory is 8.0GB. * TraceAbstraction took 24279.51ms. Allocated memory was 237.0MB in the beginning and 4.6GB in the end (delta: 4.3GB). Free memory was 165.7MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 790.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L714] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L716] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0] [L719] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0] [L720] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L722] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L723] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L724] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L725] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L726] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L727] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L728] 0 _Bool x$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0] [L729] 0 _Bool x$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0] [L730] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0] [L731] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L732] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L733] 0 _Bool x$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0] [L734] 0 _Bool x$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0] [L735] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0] [L736] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L737] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L738] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L739] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L740] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L742] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L745] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L746] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L848] 0 pthread_t t1377; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t1377, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1377, ((void *)0), P0, ((void *)0))=-3, t1377={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L850] 0 pthread_t t1378; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t1378, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1378, ((void *)0), P1, ((void *)0))=-2, t1377={5:0}, t1378={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L852] 0 pthread_t t1379; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] FCALL, FORK 0 pthread_create(&t1379, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1379, ((void *)0), P2, ((void *)0))=-1, t1377={5:0}, t1378={6:0}, t1379={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L854] 0 pthread_t t1380; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] FCALL, FORK 0 pthread_create(&t1380, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1380, ((void *)0), P3, ((void *)0))=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L820] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L823] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L826] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L826] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L827] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L827] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L828] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L828] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L829] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L830] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L861] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L861] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L862] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L863] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L865] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L869] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L870] 0 x$flush_delayed = weak$$choice2 [L871] 0 x$mem_tmp = x [L872] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L872] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L873] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L873] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L873] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L874] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L874] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L874] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L875] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L875] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L875] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L876] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0) [L877] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L877] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L878] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L878] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L878] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) [L880] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L880] 0 x = x$flush_delayed ? x$mem_tmp : x [L881] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1377={5:0}, t1378={6:0}, t1379={7:0}, t1380={3:0}, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L883] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 851]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 172 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.9s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 944 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 944 mSDsluCounter, 517 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1244 mSDsCounter, 320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2315 IncrementalHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 320 mSolverCounterUnsat, 93 mSDtfsCounter, 2315 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1197occurred in iteration=12, InterpolantAutomatonStates: 155, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1287 NumberOfCodeBlocks, 1287 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1169 ConstructedInterpolants, 0 QuantifiedInterpolants, 5147 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-09-20 22:29:33,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...