/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 00:15:13,583 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 00:15:13,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 00:15:13,664 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 00:15:13,664 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 00:15:13,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 00:15:13,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 00:15:13,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 00:15:13,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 00:15:13,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 00:15:13,697 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 00:15:13,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 00:15:13,698 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 00:15:13,699 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 00:15:13,699 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 00:15:13,700 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 00:15:13,700 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 00:15:13,700 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 00:15:13,700 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 00:15:13,701 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 00:15:13,701 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 00:15:13,701 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 00:15:13,701 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 00:15:13,701 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 00:15:13,702 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 00:15:13,702 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 00:15:13,702 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 00:15:13,702 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 00:15:13,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 00:15:13,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 00:15:13,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:15:13,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 00:15:13,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 00:15:13,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 00:15:13,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 00:15:13,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 00:15:13,705 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 00:15:13,705 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 00:15:13,705 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 00:15:13,705 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 00:15:13,705 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 00:15:13,705 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-04 00:15:13,930 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 00:15:13,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 00:15:13,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 00:15:13,964 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 00:15:13,965 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 00:15:13,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt_bound2.i [2023-08-04 00:15:15,110 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 00:15:15,313 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 00:15:15,314 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt_bound2.i [2023-08-04 00:15:15,337 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d3bcf13/d6af3300e43940a0a28a48950dae0e62/FLAG18e9195da [2023-08-04 00:15:15,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28d3bcf13/d6af3300e43940a0a28a48950dae0e62 [2023-08-04 00:15:15,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 00:15:15,357 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 00:15:15,361 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 00:15:15,361 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 00:15:15,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 00:15:15,364 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a32cba8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15, skipping insertion in model container [2023-08-04 00:15:15,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,408 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 00:15:15,576 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt_bound2.i[1026,1039] [2023-08-04 00:15:15,775 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:15:15,782 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 00:15:15,793 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt_bound2.i[1026,1039] [2023-08-04 00:15:15,811 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 00:15:15,813 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 00:15:15,844 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 00:15:15,867 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:15:15,868 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 00:15:15,872 INFO L206 MainTranslator]: Completed translation [2023-08-04 00:15:15,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15 WrapperNode [2023-08-04 00:15:15,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 00:15:15,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 00:15:15,874 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 00:15:15,874 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 00:15:15,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,892 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,911 INFO L138 Inliner]: procedures = 175, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-08-04 00:15:15,911 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 00:15:15,912 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 00:15:15,912 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 00:15:15,912 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 00:15:15,919 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,919 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,927 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,952 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,957 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 00:15:15,958 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 00:15:15,958 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 00:15:15,958 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 00:15:15,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (1/1) ... [2023-08-04 00:15:15,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 00:15:15,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:15,998 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) [2023-08-04 00:15:16,004 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 [2023-08-04 00:15:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 00:15:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 00:15:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 00:15:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 00:15:16,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 00:15:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 00:15:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 00:15:16,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 00:15:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 00:15:16,033 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 00:15:16,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 00:15:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 00:15:16,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 00:15:16,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 00:15:16,035 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 00:15:16,207 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 00:15:16,209 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 00:15:16,530 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 00:15:16,729 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 00:15:16,729 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 00:15:16,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:15:16 BoogieIcfgContainer [2023-08-04 00:15:16,731 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 00:15:16,733 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 00:15:16,733 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 00:15:16,737 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 00:15:16,738 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 12:15:15" (1/3) ... [2023-08-04 00:15:16,738 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5847709e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:15:16, skipping insertion in model container [2023-08-04 00:15:16,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 12:15:15" (2/3) ... [2023-08-04 00:15:16,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5847709e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 12:15:16, skipping insertion in model container [2023-08-04 00:15:16,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 12:15:16" (3/3) ... [2023-08-04 00:15:16,741 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt_bound2.i [2023-08-04 00:15:16,747 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 00:15:16,755 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 00:15:16,755 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 00:15:16,755 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 00:15:16,813 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:15:16,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 117 transitions, 244 flow [2023-08-04 00:15:16,936 INFO L124 PetriNetUnfolderBase]: 14/232 cut-off events. [2023-08-04 00:15:16,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:15:16,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 232 events. 14/232 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 581 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 145. Up to 8 conditions per place. [2023-08-04 00:15:16,942 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 117 transitions, 244 flow [2023-08-04 00:15:16,946 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 90 transitions, 190 flow [2023-08-04 00:15:16,948 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:15:16,960 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 90 transitions, 190 flow [2023-08-04 00:15:16,967 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 90 transitions, 190 flow [2023-08-04 00:15:16,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 90 transitions, 190 flow [2023-08-04 00:15:16,994 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-04 00:15:16,994 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:15:16,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 124 events. 2/124 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 143 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 91. Up to 4 conditions per place. [2023-08-04 00:15:16,995 INFO L119 LiptonReduction]: Number of co-enabled transitions 524 [2023-08-04 00:15:20,983 INFO L134 LiptonReduction]: Checked pairs total: 1247 [2023-08-04 00:15:20,983 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-04 00:15:20,995 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:15:21,013 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=true, 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;@475cf05a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:15:21,039 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 00:15:21,044 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:15:21,045 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 00:15:21,067 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:15:21,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:21,068 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 00:15:21,068 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:15:21,094 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:21,094 INFO L85 PathProgramCache]: Analyzing trace with hash 558849505, now seen corresponding path program 1 times [2023-08-04 00:15:21,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:21,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701979784] [2023-08-04 00:15:21,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:21,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:21,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:15:21,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:21,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701979784] [2023-08-04 00:15:21,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1701979784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:21,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:15:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:15:21,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405642684] [2023-08-04 00:15:21,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:21,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:15:21,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:21,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:15:21,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:15:21,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 195 [2023-08-04 00:15:21,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 21 places, 16 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:21,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:21,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 195 [2023-08-04 00:15:21,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:22,042 INFO L124 PetriNetUnfolderBase]: 31/85 cut-off events. [2023-08-04 00:15:22,042 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:15:22,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 85 events. 31/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 290 event pairs, 9 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 160. Up to 65 conditions per place. [2023-08-04 00:15:22,044 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 13 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2023-08-04 00:15:22,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 78 flow [2023-08-04 00:15:22,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:15:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:15:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-08-04 00:15:22,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5504273504273505 [2023-08-04 00:15:22,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-08-04 00:15:22,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-08-04 00:15:22,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:22,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-08-04 00:15:22,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:22,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:22,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:22,071 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 42 flow. Second operand 3 states and 322 transitions. [2023-08-04 00:15:22,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 78 flow [2023-08-04 00:15:22,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:15:22,074 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 50 flow [2023-08-04 00:15:22,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=24, PETRI_TRANSITIONS=16} [2023-08-04 00:15:22,080 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2023-08-04 00:15:22,080 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 50 flow [2023-08-04 00:15:22,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.33333333333333) internal successors, (310), 3 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:22,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:22,080 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 00:15:22,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 00:15:22,081 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:15:22,081 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:22,081 INFO L85 PathProgramCache]: Analyzing trace with hash 129622061, now seen corresponding path program 1 times [2023-08-04 00:15:22,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:22,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730827125] [2023-08-04 00:15:22,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:22,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:15:22,103 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:15:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:15:22,139 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:15:22,140 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:15:22,142 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 00:15:22,143 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 00:15:22,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 00:15:22,144 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 00:15:22,145 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (1/2) [2023-08-04 00:15:22,146 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 00:15:22,146 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 00:15:22,175 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 00:15:22,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 132 transitions, 288 flow [2023-08-04 00:15:22,224 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 00:15:22,225 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 00:15:22,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 460 events. 30/460 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1825 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 338. Up to 18 conditions per place. [2023-08-04 00:15:22,226 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 132 transitions, 288 flow [2023-08-04 00:15:22,228 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 234 flow [2023-08-04 00:15:22,228 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:15:22,228 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 234 flow [2023-08-04 00:15:22,228 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 234 flow [2023-08-04 00:15:22,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 234 flow [2023-08-04 00:15:22,248 INFO L124 PetriNetUnfolderBase]: 3/217 cut-off events. [2023-08-04 00:15:22,248 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 00:15:22,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 217 events. 3/217 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 466 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 176. Up to 9 conditions per place. [2023-08-04 00:15:22,251 INFO L119 LiptonReduction]: Number of co-enabled transitions 1436 [2023-08-04 00:15:26,547 INFO L134 LiptonReduction]: Checked pairs total: 4543 [2023-08-04 00:15:26,548 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-04 00:15:26,550 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 00:15:26,550 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=true, 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;@475cf05a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:15:26,551 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 00:15:26,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:15:26,557 INFO L124 PetriNetUnfolderBase]: 0/33 cut-off events. [2023-08-04 00:15:26,558 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 00:15:26,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:26,561 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2023-08-04 00:15:26,564 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:15:26,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:26,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1864659355, now seen corresponding path program 1 times [2023-08-04 00:15:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:26,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345068249] [2023-08-04 00:15:26,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:26,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:15:26,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:26,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345068249] [2023-08-04 00:15:26,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345068249] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:26,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:15:26,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:15:26,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578949077] [2023-08-04 00:15:26,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:26,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:15:26,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:26,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:15:26,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:15:26,683 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 214 [2023-08-04 00:15:26,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:26,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:26,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 214 [2023-08-04 00:15:26,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:27,008 INFO L124 PetriNetUnfolderBase]: 1076/1830 cut-off events. [2023-08-04 00:15:27,008 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-08-04 00:15:27,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3699 conditions, 1830 events. 1076/1830 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10434 event pairs, 726 based on Foata normal form. 0/1802 useless extension candidates. Maximal degree in co-relation 1049. Up to 1602 conditions per place. [2023-08-04 00:15:27,020 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 21 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-04 00:15:27,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 31 transitions, 132 flow [2023-08-04 00:15:27,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:15:27,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:15:27,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2023-08-04 00:15:27,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5654205607476636 [2023-08-04 00:15:27,023 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 363 transitions. [2023-08-04 00:15:27,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 363 transitions. [2023-08-04 00:15:27,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:27,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 363 transitions. [2023-08-04 00:15:27,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:27,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:27,027 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:27,028 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 78 flow. Second operand 3 states and 363 transitions. [2023-08-04 00:15:27,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 31 transitions, 132 flow [2023-08-04 00:15:27,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 128 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 00:15:27,030 INFO L231 Difference]: Finished difference. Result has 39 places, 28 transitions, 86 flow [2023-08-04 00:15:27,030 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=39, PETRI_TRANSITIONS=28} [2023-08-04 00:15:27,030 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-04 00:15:27,031 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 28 transitions, 86 flow [2023-08-04 00:15:27,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:27,031 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:27,031 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-04 00:15:27,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 00:15:27,031 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:15:27,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:27,032 INFO L85 PathProgramCache]: Analyzing trace with hash 1069443386, now seen corresponding path program 1 times [2023-08-04 00:15:27,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:27,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40835048] [2023-08-04 00:15:27,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:27,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:27,089 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:15:27,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40835048] [2023-08-04 00:15:27,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40835048] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:27,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806205761] [2023-08-04 00:15:27,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:27,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:27,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:27,097 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:27,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 00:15:27,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:27,209 INFO L262 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:15:27,211 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:27,253 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:15:27,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:15:27,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806205761] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:27,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:15:27,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:15:27,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011855294] [2023-08-04 00:15:27,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:27,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:15:27,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:27,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:15:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-04 00:15:27,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 214 [2023-08-04 00:15:27,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 28 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:27,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:27,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 214 [2023-08-04 00:15:27,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:27,555 INFO L124 PetriNetUnfolderBase]: 1064/1797 cut-off events. [2023-08-04 00:15:27,555 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-08-04 00:15:27,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3633 conditions, 1797 events. 1064/1797 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 10195 event pairs, 468 based on Foata normal form. 9/1793 useless extension candidates. Maximal degree in co-relation 1315. Up to 1555 conditions per place. [2023-08-04 00:15:27,567 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 24 selfloop transitions, 4 changer transitions 0/35 dead transitions. [2023-08-04 00:15:27,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 156 flow [2023-08-04 00:15:27,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:15:27,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:15:27,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2023-08-04 00:15:27,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5504672897196262 [2023-08-04 00:15:27,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2023-08-04 00:15:27,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2023-08-04 00:15:27,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:27,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2023-08-04 00:15:27,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:27,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:27,575 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:27,575 INFO L175 Difference]: Start difference. First operand has 39 places, 28 transitions, 86 flow. Second operand 5 states and 589 transitions. [2023-08-04 00:15:27,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 156 flow [2023-08-04 00:15:27,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 153 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 00:15:27,577 INFO L231 Difference]: Finished difference. Result has 42 places, 28 transitions, 100 flow [2023-08-04 00:15:27,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=42, PETRI_TRANSITIONS=28} [2023-08-04 00:15:27,577 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-04 00:15:27,578 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 28 transitions, 100 flow [2023-08-04 00:15:27,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.6) internal successors, (568), 5 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:27,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:27,578 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:27,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 00:15:27,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:27,785 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:15:27,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:27,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1367335481, now seen corresponding path program 1 times [2023-08-04 00:15:27,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:27,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199215597] [2023-08-04 00:15:27,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:27,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:27,873 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:15:27,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:27,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199215597] [2023-08-04 00:15:27,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199215597] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:27,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817054676] [2023-08-04 00:15:27,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:27,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:27,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:27,876 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:27,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 00:15:27,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:27,988 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:15:27,989 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:28,001 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:15:28,002 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:15:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 00:15:28,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817054676] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:15:28,021 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:15:28,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:15:28,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952991994] [2023-08-04 00:15:28,021 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:15:28,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:15:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:28,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:15:28,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:15:28,035 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 214 [2023-08-04 00:15:28,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 28 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:28,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 214 [2023-08-04 00:15:28,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:28,274 INFO L124 PetriNetUnfolderBase]: 865/1424 cut-off events. [2023-08-04 00:15:28,275 INFO L125 PetriNetUnfolderBase]: For 162/162 co-relation queries the response was YES. [2023-08-04 00:15:28,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2917 conditions, 1424 events. 865/1424 cut-off events. For 162/162 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 7456 event pairs, 351 based on Foata normal form. 3/1417 useless extension candidates. Maximal degree in co-relation 1036. Up to 1234 conditions per place. [2023-08-04 00:15:28,283 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 24 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2023-08-04 00:15:28,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 34 transitions, 162 flow [2023-08-04 00:15:28,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:15:28,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:15:28,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-04 00:15:28,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5560747663551402 [2023-08-04 00:15:28,285 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-04 00:15:28,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-04 00:15:28,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:28,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-04 00:15:28,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,289 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,289 INFO L175 Difference]: Start difference. First operand has 42 places, 28 transitions, 100 flow. Second operand 4 states and 476 transitions. [2023-08-04 00:15:28,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 34 transitions, 162 flow [2023-08-04 00:15:28,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 34 transitions, 157 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-04 00:15:28,291 INFO L231 Difference]: Finished difference. Result has 43 places, 27 transitions, 93 flow [2023-08-04 00:15:28,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=93, PETRI_PLACES=43, PETRI_TRANSITIONS=27} [2023-08-04 00:15:28,292 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-08-04 00:15:28,292 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 27 transitions, 93 flow [2023-08-04 00:15:28,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 114.4) internal successors, (572), 5 states have internal predecessors, (572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:28,292 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:28,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 00:15:28,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:28,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 00:15:28,504 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:28,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1381162702, now seen corresponding path program 1 times [2023-08-04 00:15:28,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:28,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4537798] [2023-08-04 00:15:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:28,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:28,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:15:28,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:28,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4537798] [2023-08-04 00:15:28,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4537798] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:28,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636466048] [2023-08-04 00:15:28,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:28,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:28,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:28,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:28,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 00:15:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:28,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 00:15:28,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:28,712 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:15:28,712 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:15:28,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636466048] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:28,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:15:28,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-04 00:15:28,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922701664] [2023-08-04 00:15:28,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:28,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:15:28,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:15:28,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:15:28,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 214 [2023-08-04 00:15:28,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 27 transitions, 93 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:28,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 214 [2023-08-04 00:15:28,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:28,883 INFO L124 PetriNetUnfolderBase]: 457/814 cut-off events. [2023-08-04 00:15:28,883 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2023-08-04 00:15:28,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1731 conditions, 814 events. 457/814 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3939 event pairs, 22 based on Foata normal form. 144/948 useless extension candidates. Maximal degree in co-relation 654. Up to 555 conditions per place. [2023-08-04 00:15:28,885 INFO L140 encePairwiseOnDemand]: 212/214 looper letters, 0 selfloop transitions, 0 changer transitions 37/37 dead transitions. [2023-08-04 00:15:28,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 173 flow [2023-08-04 00:15:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:15:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:15:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 483 transitions. [2023-08-04 00:15:28,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5642523364485982 [2023-08-04 00:15:28,887 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 483 transitions. [2023-08-04 00:15:28,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 483 transitions. [2023-08-04 00:15:28,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:28,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 483 transitions. [2023-08-04 00:15:28,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.75) internal successors, (483), 4 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,890 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,891 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,891 INFO L175 Difference]: Start difference. First operand has 43 places, 27 transitions, 93 flow. Second operand 4 states and 483 transitions. [2023-08-04 00:15:28,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 173 flow [2023-08-04 00:15:28,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 166 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 00:15:28,893 INFO L231 Difference]: Finished difference. Result has 41 places, 0 transitions, 0 flow [2023-08-04 00:15:28,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=41, PETRI_TRANSITIONS=0} [2023-08-04 00:15:28,894 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 5 predicate places. [2023-08-04 00:15:28,894 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 0 transitions, 0 flow [2023-08-04 00:15:28,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:28,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 00:15:28,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 00:15:28,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 00:15:29,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:29,100 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-04 00:15:29,101 INFO L307 ceAbstractionStarter]: Result for error location InUseError was SAFE,SAFE (1/2) [2023-08-04 00:15:29,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 132 transitions, 288 flow [2023-08-04 00:15:29,139 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 00:15:29,139 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 00:15:29,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 460 events. 30/460 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1825 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 338. Up to 18 conditions per place. [2023-08-04 00:15:29,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 132 transitions, 288 flow [2023-08-04 00:15:29,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 120 transitions, 256 flow [2023-08-04 00:15:29,141 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 00:15:29,141 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 120 transitions, 256 flow [2023-08-04 00:15:29,142 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 120 transitions, 256 flow [2023-08-04 00:15:29,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 120 transitions, 256 flow [2023-08-04 00:15:29,169 INFO L124 PetriNetUnfolderBase]: 21/366 cut-off events. [2023-08-04 00:15:29,169 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 00:15:29,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 366 events. 21/366 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1265 event pairs, 0 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 275. Up to 18 conditions per place. [2023-08-04 00:15:29,172 INFO L119 LiptonReduction]: Number of co-enabled transitions 2244 [2023-08-04 00:15:34,181 INFO L134 LiptonReduction]: Checked pairs total: 6276 [2023-08-04 00:15:34,181 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-04 00:15:34,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 00:15:34,183 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=true, 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;@475cf05a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 00:15:34,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 00:15:34,186 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 00:15:34,186 INFO L124 PetriNetUnfolderBase]: 0/14 cut-off events. [2023-08-04 00:15:34,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 00:15:34,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:34,187 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 00:15:34,187 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:15:34,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:34,187 INFO L85 PathProgramCache]: Analyzing trace with hash 867748376, now seen corresponding path program 1 times [2023-08-04 00:15:34,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:34,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195750714] [2023-08-04 00:15:34,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:34,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:34,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:15:34,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:34,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195750714] [2023-08-04 00:15:34,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195750714] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:34,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:15:34,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:15:34,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873671325] [2023-08-04 00:15:34,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:34,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:15:34,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:34,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:15:34,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:15:34,264 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 227 [2023-08-04 00:15:34,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:34,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:34,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 227 [2023-08-04 00:15:34,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:35,026 INFO L124 PetriNetUnfolderBase]: 3548/5505 cut-off events. [2023-08-04 00:15:35,026 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-08-04 00:15:35,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10776 conditions, 5505 events. 3548/5505 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 32376 event pairs, 2526 based on Foata normal form. 0/5210 useless extension candidates. Maximal degree in co-relation 3073. Up to 5082 conditions per place. [2023-08-04 00:15:35,052 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 25 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-04 00:15:35,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 136 flow [2023-08-04 00:15:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:15:35,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:15:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-04 00:15:35,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5389133627019089 [2023-08-04 00:15:35,054 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-04 00:15:35,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-04 00:15:35,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:35,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-04 00:15:35,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:35,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:35,057 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:35,057 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 74 flow. Second operand 3 states and 367 transitions. [2023-08-04 00:15:35,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 136 flow [2023-08-04 00:15:35,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 33 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 00:15:35,059 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 86 flow [2023-08-04 00:15:35,059 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-04 00:15:35,061 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-04 00:15:35,061 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 86 flow [2023-08-04 00:15:35,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:35,061 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:35,061 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:35,061 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 00:15:35,062 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:15:35,062 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:35,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1273890317, now seen corresponding path program 1 times [2023-08-04 00:15:35,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:35,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322118519] [2023-08-04 00:15:35,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:35,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:35,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:35,130 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 00:15:35,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:35,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322118519] [2023-08-04 00:15:35,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322118519] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:35,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535854294] [2023-08-04 00:15:35,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:35,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:35,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:35,132 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:35,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 00:15:35,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:35,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 00:15:35,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:35,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:15:35,239 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:15:35,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535854294] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:35,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:15:35,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 00:15:35,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011840615] [2023-08-04 00:15:35,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:35,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:15:35,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:35,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:15:35,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:15:35,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 227 [2023-08-04 00:15:35,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:35,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:35,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 227 [2023-08-04 00:15:35,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:35,992 INFO L124 PetriNetUnfolderBase]: 3506/5348 cut-off events. [2023-08-04 00:15:35,992 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-08-04 00:15:35,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10571 conditions, 5348 events. 3506/5348 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 31066 event pairs, 2378 based on Foata normal form. 0/5047 useless extension candidates. Maximal degree in co-relation 10536. Up to 4853 conditions per place. [2023-08-04 00:15:36,019 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 31 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-08-04 00:15:36,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 170 flow [2023-08-04 00:15:36,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:15:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:15:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-04 00:15:36,021 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462555066079295 [2023-08-04 00:15:36,021 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-04 00:15:36,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-04 00:15:36,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:36,021 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-04 00:15:36,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:36,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:36,023 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:36,023 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 86 flow. Second operand 3 states and 372 transitions. [2023-08-04 00:15:36,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 170 flow [2023-08-04 00:15:36,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 168 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:15:36,027 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 96 flow [2023-08-04 00:15:36,027 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=43, PETRI_TRANSITIONS=31} [2023-08-04 00:15:36,028 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2023-08-04 00:15:36,028 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 96 flow [2023-08-04 00:15:36,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:36,028 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:36,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:36,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 00:15:36,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:36,234 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:15:36,234 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1973616849, now seen corresponding path program 1 times [2023-08-04 00:15:36,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:36,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282388260] [2023-08-04 00:15:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:36,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:15:36,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:36,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282388260] [2023-08-04 00:15:36,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282388260] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:36,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614428643] [2023-08-04 00:15:36,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:36,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:36,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:36,290 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:36,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 00:15:36,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:36,393 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:15:36,394 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:36,404 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:15:36,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:15:36,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 00:15:36,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614428643] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:15:36,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:15:36,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 00:15:36,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584554239] [2023-08-04 00:15:36,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:15:36,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:15:36,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:36,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:15:36,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:15:36,428 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 227 [2023-08-04 00:15:36,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 31 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:36,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:36,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 227 [2023-08-04 00:15:36,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:36,948 INFO L124 PetriNetUnfolderBase]: 2821/4211 cut-off events. [2023-08-04 00:15:36,949 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2023-08-04 00:15:36,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8741 conditions, 4211 events. 2821/4211 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22627 event pairs, 1329 based on Foata normal form. 3/4168 useless extension candidates. Maximal degree in co-relation 3144. Up to 3907 conditions per place. [2023-08-04 00:15:36,964 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 29 selfloop transitions, 3 changer transitions 1/39 dead transitions. [2023-08-04 00:15:36,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 178 flow [2023-08-04 00:15:36,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:15:36,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:15:36,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-04 00:15:36,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297356828193832 [2023-08-04 00:15:36,966 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-04 00:15:36,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-04 00:15:36,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:36,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-04 00:15:36,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:36,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:36,969 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:36,969 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 96 flow. Second operand 4 states and 481 transitions. [2023-08-04 00:15:36,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 178 flow [2023-08-04 00:15:36,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:15:36,971 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 108 flow [2023-08-04 00:15:36,971 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-08-04 00:15:36,972 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2023-08-04 00:15:36,972 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 108 flow [2023-08-04 00:15:36,972 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:36,972 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:36,972 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:36,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 00:15:37,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:37,178 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:15:37,178 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:37,178 INFO L85 PathProgramCache]: Analyzing trace with hash -578148123, now seen corresponding path program 1 times [2023-08-04 00:15:37,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:37,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978520565] [2023-08-04 00:15:37,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:37,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:37,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:37,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:15:37,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978520565] [2023-08-04 00:15:37,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978520565] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:37,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420579843] [2023-08-04 00:15:37,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:37,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:37,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:37,233 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:37,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 00:15:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:37,348 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 00:15:37,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:37,361 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:15:37,361 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:15:37,372 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 00:15:37,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420579843] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:15:37,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:15:37,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 00:15:37,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176480500] [2023-08-04 00:15:37,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:15:37,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 00:15:37,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:37,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 00:15:37,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 00:15:37,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 227 [2023-08-04 00:15:37,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:37,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:37,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 227 [2023-08-04 00:15:37,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:37,813 INFO L124 PetriNetUnfolderBase]: 2584/3742 cut-off events. [2023-08-04 00:15:37,813 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-08-04 00:15:37,819 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7883 conditions, 3742 events. 2584/3742 cut-off events. For 333/333 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 19012 event pairs, 898 based on Foata normal form. 36/3768 useless extension candidates. Maximal degree in co-relation 2828. Up to 2260 conditions per place. [2023-08-04 00:15:37,829 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 40 selfloop transitions, 3 changer transitions 1/50 dead transitions. [2023-08-04 00:15:37,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 234 flow [2023-08-04 00:15:37,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:15:37,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:15:37,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-04 00:15:37,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5418502202643172 [2023-08-04 00:15:37,831 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-04 00:15:37,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-04 00:15:37,831 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:37,831 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-04 00:15:37,832 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:37,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:37,834 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:37,834 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 108 flow. Second operand 4 states and 492 transitions. [2023-08-04 00:15:37,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 234 flow [2023-08-04 00:15:37,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 227 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 00:15:37,835 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 115 flow [2023-08-04 00:15:37,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=115, PETRI_PLACES=49, PETRI_TRANSITIONS=31} [2023-08-04 00:15:37,836 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2023-08-04 00:15:37,836 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 115 flow [2023-08-04 00:15:37,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.2) internal successors, (576), 5 states have internal predecessors, (576), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:37,836 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:37,837 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:37,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 00:15:38,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:38,044 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:15:38,045 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:38,045 INFO L85 PathProgramCache]: Analyzing trace with hash -625946970, now seen corresponding path program 1 times [2023-08-04 00:15:38,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:38,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932944613] [2023-08-04 00:15:38,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:38,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:38,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:15:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932944613] [2023-08-04 00:15:38,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932944613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:38,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:15:38,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 00:15:38,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007297267] [2023-08-04 00:15:38,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:38,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 00:15:38,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:38,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 00:15:38,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 00:15:38,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 227 [2023-08-04 00:15:38,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 31 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:38,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:38,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 227 [2023-08-04 00:15:38,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:38,570 INFO L124 PetriNetUnfolderBase]: 2146/3250 cut-off events. [2023-08-04 00:15:38,570 INFO L125 PetriNetUnfolderBase]: For 1711/1711 co-relation queries the response was YES. [2023-08-04 00:15:38,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7312 conditions, 3250 events. 2146/3250 cut-off events. For 1711/1711 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17276 event pairs, 517 based on Foata normal form. 9/3258 useless extension candidates. Maximal degree in co-relation 2604. Up to 2773 conditions per place. [2023-08-04 00:15:38,581 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 34 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-08-04 00:15:38,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 235 flow [2023-08-04 00:15:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 00:15:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 00:15:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-04 00:15:38,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55359765051395 [2023-08-04 00:15:38,583 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-04 00:15:38,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-04 00:15:38,584 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:38,584 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-04 00:15:38,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.66666666666667) internal successors, (377), 3 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:38,586 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:38,586 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 227.0) internal successors, (908), 4 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:38,586 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 115 flow. Second operand 3 states and 377 transitions. [2023-08-04 00:15:38,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 235 flow [2023-08-04 00:15:38,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 43 transitions, 223 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 00:15:38,588 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 127 flow [2023-08-04 00:15:38,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=49, PETRI_TRANSITIONS=33} [2023-08-04 00:15:38,589 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2023-08-04 00:15:38,589 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 127 flow [2023-08-04 00:15:38,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:38,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:38,589 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:38,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 00:15:38,589 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:15:38,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:38,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2070478677, now seen corresponding path program 1 times [2023-08-04 00:15:38,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:38,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597912828] [2023-08-04 00:15:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:38,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:38,746 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:15:38,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:38,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597912828] [2023-08-04 00:15:38,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597912828] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:38,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 00:15:38,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 00:15:38,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799735996] [2023-08-04 00:15:38,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:38,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:15:38,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:38,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:15:38,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 00:15:38,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 227 [2023-08-04 00:15:38,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 33 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:38,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:38,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 227 [2023-08-04 00:15:38,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:39,566 INFO L124 PetriNetUnfolderBase]: 5910/8551 cut-off events. [2023-08-04 00:15:39,567 INFO L125 PetriNetUnfolderBase]: For 4292/4292 co-relation queries the response was YES. [2023-08-04 00:15:39,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20115 conditions, 8551 events. 5910/8551 cut-off events. For 4292/4292 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 49471 event pairs, 912 based on Foata normal form. 240/8771 useless extension candidates. Maximal degree in co-relation 15513. Up to 3985 conditions per place. [2023-08-04 00:15:39,595 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 62 selfloop transitions, 7 changer transitions 2/75 dead transitions. [2023-08-04 00:15:39,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 424 flow [2023-08-04 00:15:39,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 00:15:39,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 00:15:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-04 00:15:39,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5594713656387665 [2023-08-04 00:15:39,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-04 00:15:39,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-04 00:15:39,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:39,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-04 00:15:39,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:39,601 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:39,601 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 227.0) internal successors, (1135), 5 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:39,601 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 127 flow. Second operand 4 states and 508 transitions. [2023-08-04 00:15:39,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 424 flow [2023-08-04 00:15:39,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 75 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:15:39,605 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 183 flow [2023-08-04 00:15:39,605 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=183, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2023-08-04 00:15:39,605 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2023-08-04 00:15:39,605 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 183 flow [2023-08-04 00:15:39,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:39,606 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:39,606 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:39,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 00:15:39,606 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:15:39,606 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:39,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2033852799, now seen corresponding path program 1 times [2023-08-04 00:15:39,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:39,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766900994] [2023-08-04 00:15:39,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:39,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:40,671 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 00:15:40,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:40,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766900994] [2023-08-04 00:15:40,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766900994] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:40,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262243484] [2023-08-04 00:15:40,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:40,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:40,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:40,677 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:40,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 00:15:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:40,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-04 00:15:40,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:40,873 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 00:15:40,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 00:15:40,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1262243484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 00:15:40,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 00:15:40,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-08-04 00:15:40,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760627395] [2023-08-04 00:15:40,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 00:15:40,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 00:15:40,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:40,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 00:15:40,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-04 00:15:40,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 227 [2023-08-04 00:15:40,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 183 flow. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:40,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:40,886 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 227 [2023-08-04 00:15:40,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:41,595 INFO L124 PetriNetUnfolderBase]: 3975/5943 cut-off events. [2023-08-04 00:15:41,595 INFO L125 PetriNetUnfolderBase]: For 5074/5109 co-relation queries the response was YES. [2023-08-04 00:15:41,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15735 conditions, 5943 events. 3975/5943 cut-off events. For 5074/5109 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 35231 event pairs, 755 based on Foata normal form. 331/6150 useless extension candidates. Maximal degree in co-relation 11632. Up to 4207 conditions per place. [2023-08-04 00:15:41,617 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 75 selfloop transitions, 9 changer transitions 2/94 dead transitions. [2023-08-04 00:15:41,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 597 flow [2023-08-04 00:15:41,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 00:15:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 00:15:41,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-04 00:15:41,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321585903083701 [2023-08-04 00:15:41,620 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-04 00:15:41,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-04 00:15:41,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:41,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-04 00:15:41,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:41,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:41,624 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 227.0) internal successors, (1362), 6 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:41,624 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 183 flow. Second operand 5 states and 604 transitions. [2023-08-04 00:15:41,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 597 flow [2023-08-04 00:15:41,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 94 transitions, 580 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:15:41,629 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 251 flow [2023-08-04 00:15:41,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=59, PETRI_TRANSITIONS=47} [2023-08-04 00:15:41,630 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2023-08-04 00:15:41,630 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 251 flow [2023-08-04 00:15:41,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:41,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:41,631 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:41,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 00:15:41,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:41,836 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:15:41,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:41,837 INFO L85 PathProgramCache]: Analyzing trace with hash -264939645, now seen corresponding path program 1 times [2023-08-04 00:15:41,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:41,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630618399] [2023-08-04 00:15:41,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:41,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 00:15:43,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:43,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630618399] [2023-08-04 00:15:43,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630618399] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:43,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168079998] [2023-08-04 00:15:43,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:43,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:43,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:43,038 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:43,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 00:15:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:43,174 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 00:15:43,176 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:43,233 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 00:15:43,233 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:15:43,319 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 00:15:43,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168079998] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:15:43,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:15:43,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 11 [2023-08-04 00:15:43,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272783074] [2023-08-04 00:15:43,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:15:43,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 00:15:43,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:43,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 00:15:43,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-08-04 00:15:43,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 227 [2023-08-04 00:15:43,621 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 251 flow. Second operand has 12 states, 12 states have (on average 97.16666666666667) internal successors, (1166), 12 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:43,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:43,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 227 [2023-08-04 00:15:43,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:45,337 INFO L124 PetriNetUnfolderBase]: 6054/9063 cut-off events. [2023-08-04 00:15:45,337 INFO L125 PetriNetUnfolderBase]: For 11513/11566 co-relation queries the response was YES. [2023-08-04 00:15:45,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29358 conditions, 9063 events. 6054/9063 cut-off events. For 11513/11566 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 53910 event pairs, 779 based on Foata normal form. 450/9362 useless extension candidates. Maximal degree in co-relation 29265. Up to 2919 conditions per place. [2023-08-04 00:15:45,381 INFO L140 encePairwiseOnDemand]: 213/227 looper letters, 175 selfloop transitions, 47 changer transitions 16/244 dead transitions. [2023-08-04 00:15:45,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 244 transitions, 1665 flow [2023-08-04 00:15:45,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-04 00:15:45,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-04 00:15:45,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1776 transitions. [2023-08-04 00:15:45,386 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46022285566208865 [2023-08-04 00:15:45,386 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1776 transitions. [2023-08-04 00:15:45,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1776 transitions. [2023-08-04 00:15:45,387 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:15:45,387 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1776 transitions. [2023-08-04 00:15:45,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 104.47058823529412) internal successors, (1776), 17 states have internal predecessors, (1776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:45,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 227.0) internal successors, (4086), 18 states have internal predecessors, (4086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:45,396 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 227.0) internal successors, (4086), 18 states have internal predecessors, (4086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:45,396 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 251 flow. Second operand 17 states and 1776 transitions. [2023-08-04 00:15:45,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 244 transitions, 1665 flow [2023-08-04 00:15:45,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 244 transitions, 1656 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 00:15:45,424 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 664 flow [2023-08-04 00:15:45,424 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=664, PETRI_PLACES=87, PETRI_TRANSITIONS=86} [2023-08-04 00:15:45,425 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2023-08-04 00:15:45,425 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 664 flow [2023-08-04 00:15:45,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 97.16666666666667) internal successors, (1166), 12 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:45,426 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:15:45,426 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:15:45,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 00:15:45,632 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 00:15:45,632 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:15:45,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:15:45,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1968472783, now seen corresponding path program 1 times [2023-08-04 00:15:45,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:15:45,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280749152] [2023-08-04 00:15:45,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:45,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:15:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:47,192 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 00:15:47,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 00:15:47,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280749152] [2023-08-04 00:15:47,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280749152] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 00:15:47,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329772128] [2023-08-04 00:15:47,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:15:47,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 00:15:47,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 00:15:47,199 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 00:15:47,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 00:15:47,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 00:15:47,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 78 conjunts are in the unsatisfiable core [2023-08-04 00:15:47,349 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 00:15:47,398 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 00:15:47,399 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-08-04 00:15:47,453 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 00:15:47,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 00:15:47,664 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 00:15:47,665 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-08-04 00:15:47,775 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 00:15:47,866 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 00:15:48,072 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 00:15:48,193 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-04 00:15:48,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-08-04 00:15:48,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 00:15:48,397 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 00:15:51,983 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 00:15:51,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329772128] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 00:15:51,983 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 00:15:51,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 26 [2023-08-04 00:15:51,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140409466] [2023-08-04 00:15:51,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 00:15:51,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-04 00:15:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 00:15:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-04 00:15:51,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=607, Unknown=1, NotChecked=0, Total=756 [2023-08-04 00:15:52,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 227 [2023-08-04 00:15:52,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 664 flow. Second operand has 28 states, 28 states have (on average 80.35714285714286) internal successors, (2250), 28 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:15:52,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 00:15:52,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 227 [2023-08-04 00:15:52,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 00:15:56,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 00:16:01,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-04 00:16:02,769 INFO L124 PetriNetUnfolderBase]: 7980/11950 cut-off events. [2023-08-04 00:16:02,770 INFO L125 PetriNetUnfolderBase]: For 55716/55777 co-relation queries the response was YES. [2023-08-04 00:16:02,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53631 conditions, 11950 events. 7980/11950 cut-off events. For 55716/55777 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 74574 event pairs, 967 based on Foata normal form. 32/11816 useless extension candidates. Maximal degree in co-relation 46096. Up to 7525 conditions per place. [2023-08-04 00:16:02,840 INFO L140 encePairwiseOnDemand]: 212/227 looper letters, 220 selfloop transitions, 173 changer transitions 25/424 dead transitions. [2023-08-04 00:16:02,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 424 transitions, 3994 flow [2023-08-04 00:16:02,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-08-04 00:16:02,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-08-04 00:16:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 2862 transitions. [2023-08-04 00:16:02,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38205847016419703 [2023-08-04 00:16:02,850 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 2862 transitions. [2023-08-04 00:16:02,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 2862 transitions. [2023-08-04 00:16:02,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 00:16:02,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 2862 transitions. [2023-08-04 00:16:02,857 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 86.72727272727273) internal successors, (2862), 33 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:16:02,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 227.0) internal successors, (7718), 34 states have internal predecessors, (7718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:16:02,867 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 227.0) internal successors, (7718), 34 states have internal predecessors, (7718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:16:02,867 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 664 flow. Second operand 33 states and 2862 transitions. [2023-08-04 00:16:02,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 424 transitions, 3994 flow [2023-08-04 00:16:03,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 424 transitions, 3699 flow, removed 129 selfloop flow, removed 3 redundant places. [2023-08-04 00:16:03,466 INFO L231 Difference]: Finished difference. Result has 132 places, 245 transitions, 2337 flow [2023-08-04 00:16:03,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=227, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=2337, PETRI_PLACES=132, PETRI_TRANSITIONS=245} [2023-08-04 00:16:03,467 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 94 predicate places. [2023-08-04 00:16:03,467 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 245 transitions, 2337 flow [2023-08-04 00:16:03,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 80.35714285714286) internal successors, (2250), 28 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 00:16:03,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 00:16:03,468 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:03,477 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 00:16:03,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-08-04 00:16:03,674 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 00:16:03,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 00:16:03,675 INFO L85 PathProgramCache]: Analyzing trace with hash 918491406, now seen corresponding path program 1 times [2023-08-04 00:16:03,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 00:16:03,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344216922] [2023-08-04 00:16:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 00:16:03,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 00:16:03,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:16:03,747 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 00:16:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 00:16:03,821 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 00:16:03,821 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 00:16:03,822 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 00:16:03,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 00:16:03,822 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 00:16:03,822 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (2/2) [2023-08-04 00:16:03,824 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 00:16:03,824 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 00:16:03,933 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 12:16:03 BasicIcfg [2023-08-04 00:16:03,933 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 00:16:03,933 INFO L158 Benchmark]: Toolchain (without parser) took 48576.26ms. Allocated memory was 446.7MB in the beginning and 1.2GB in the end (delta: 790.6MB). Free memory was 398.6MB in the beginning and 737.1MB in the end (delta: -338.5MB). Peak memory consumption was 455.0MB. Max. memory is 16.0GB. [2023-08-04 00:16:03,934 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 335.5MB. Free memory is still 288.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 00:16:03,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 512.04ms. Allocated memory is still 446.7MB. Free memory was 398.4MB in the beginning and 375.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 00:16:03,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.42ms. Allocated memory is still 446.7MB. Free memory was 375.6MB in the beginning and 373.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 00:16:03,934 INFO L158 Benchmark]: Boogie Preprocessor took 45.64ms. Allocated memory is still 446.7MB. Free memory was 373.2MB in the beginning and 371.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 00:16:03,934 INFO L158 Benchmark]: RCFGBuilder took 773.24ms. Allocated memory is still 446.7MB. Free memory was 371.1MB in the beginning and 376.8MB in the end (delta: -5.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.0GB. [2023-08-04 00:16:03,935 INFO L158 Benchmark]: TraceAbstraction took 47200.13ms. Allocated memory was 446.7MB in the beginning and 1.2GB in the end (delta: 790.6MB). Free memory was 376.1MB in the beginning and 737.1MB in the end (delta: -361.0MB). Peak memory consumption was 430.0MB. Max. memory is 16.0GB. [2023-08-04 00:16:03,938 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 335.5MB. Free memory is still 288.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 512.04ms. Allocated memory is still 446.7MB. Free memory was 398.4MB in the beginning and 375.6MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 37.42ms. Allocated memory is still 446.7MB. Free memory was 375.6MB in the beginning and 373.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 45.64ms. Allocated memory is still 446.7MB. Free memory was 373.2MB in the beginning and 371.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 773.24ms. Allocated memory is still 446.7MB. Free memory was 371.1MB in the beginning and 376.8MB in the end (delta: -5.7MB). Peak memory consumption was 16.6MB. Max. memory is 16.0GB. * TraceAbstraction took 47200.13ms. Allocated memory was 446.7MB in the beginning and 1.2GB in the end (delta: 790.6MB). Free memory was 376.1MB in the beginning and 737.1MB in the end (delta: -361.0MB). Peak memory consumption was 430.0MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.0s, 94 PlacesBefore, 21 PlacesAfterwards, 90 TransitionsBefore, 16 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 1247 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 714, independent: 616, independent conditional: 0, independent unconditional: 616, dependent: 98, dependent conditional: 0, dependent unconditional: 98, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 285, independent: 272, independent conditional: 0, independent unconditional: 272, dependent: 13, dependent conditional: 0, dependent unconditional: 13, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 714, independent: 344, independent conditional: 0, independent unconditional: 344, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 285, unknown conditional: 0, unknown unconditional: 285] , Statistics on independence cache: Total cache size (in pairs): 34, Positive cache size: 29, Positive conditional cache size: 0, Positive unconditional cache size: 29, Negative cache size: 5, Negative conditional cache size: 0, Negative unconditional cache size: 5, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 113 PlacesBefore, 36 PlacesAfterwards, 105 TransitionsBefore, 27 TransitionsAfterwards, 1436 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 23 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 4543 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1731, independent: 1547, independent conditional: 0, independent unconditional: 1547, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 709, independent: 673, independent conditional: 0, independent unconditional: 673, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1731, independent: 874, independent conditional: 0, independent unconditional: 874, dependent: 148, dependent conditional: 0, dependent unconditional: 148, unknown: 709, unknown conditional: 0, unknown unconditional: 709] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 89, Positive conditional cache size: 0, Positive unconditional cache size: 89, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 126 PlacesBefore, 38 PlacesAfterwards, 120 TransitionsBefore, 29 TransitionsAfterwards, 2244 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 95 TotalNumberOfCompositions, 6276 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2335, independent: 2120, independent conditional: 0, independent unconditional: 2120, dependent: 215, dependent conditional: 0, dependent unconditional: 215, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1084, independent: 1044, independent conditional: 0, independent unconditional: 1044, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2335, independent: 1076, independent conditional: 0, independent unconditional: 1076, dependent: 175, dependent conditional: 0, dependent unconditional: 175, unknown: 1084, unknown conditional: 0, unknown unconditional: 1084] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 78, Positive conditional cache size: 0, Positive unconditional cache size: 78, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929[2]; [L813] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1929={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] COND TRUE 0 asdf<2 [L813] FCALL, FORK 0 pthread_create(&t1929[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1929[asdf], ((void *)0), P0, ((void *)0))=-4, t1929={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] EXPR 1 \read(y) [L758] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L758] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L759] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L760] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L761] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L762] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L763] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L764] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L772] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1929={6:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] COND TRUE 0 asdf<2 [L813] FCALL, FORK 0 pthread_create(&t1929[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1929[asdf], ((void *)0), P0, ((void *)0))=-3, t1929={6:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L813] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1929={6:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L813] COND FALSE 0 !(asdf<2) [L814] 0 pthread_t t1930[2]; [L815] 0 int asdf=0; VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] COND TRUE 0 asdf<2 [L815] FCALL, FORK 0 pthread_create(&t1930[asdf], ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1930[asdf], ((void *)0), P1, ((void *)0))=-2, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] 0 asdf++ VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] COND TRUE 0 asdf<2 [L784] 3 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] FCALL, FORK 0 pthread_create(&t1930[asdf], ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1930[asdf], ((void *)0), P1, ((void *)0))=-1, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L787] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 3 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 3 \read(y) [L790] EXPR 3 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 3 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 3 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L797] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 3 return 0; [L815] 0 asdf++ VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L815] COND FALSE 0 !(asdf<2) [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L821] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=1, main$tmp_guard1=0, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L832] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 129 locations, 3 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: 5.3s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 30 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 30 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=1, InterpolantAutomatonStates: 3, 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.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 2 thread instances CFG has 7 procedures, 144 locations, 3 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: 6.9s, OverallIterations: 4, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 264 IncrementalHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 15 mSDtfsCounter, 264 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=2, InterpolantAutomatonStates: 16, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 91 NumberOfCodeBlocks, 91 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 188 SizeOfPredicates, 0 NumberOfNonLiveVariables, 586 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 50/61 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 144 locations, 3 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: 34.7s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 151 mSolverCounterUnknown, 1050 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 938 mSDsluCounter, 1280 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1143 mSDsCounter, 304 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2804 IncrementalHoareTripleChecker+Invalid, 3259 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 304 mSolverCounterUnsat, 137 mSDtfsCounter, 2804 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 167 SyntacticMatches, 7 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 786 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2337occurred in iteration=9, InterpolantAutomatonStates: 76, 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.3s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 344 ConstructedInterpolants, 26 QuantifiedInterpolants, 6960 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1498 ConjunctsInSsa, 127 ConjunctsInUnsatCore, 19 InterpolantComputations, 5 PerfectInterpolantSequences, 88/149 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! [2023-08-04 00:16:03,982 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...