/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 PROGRAM_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 06:39:48,679 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 06:39:49,048 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 06:39:49,051 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 06:39:49,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 06:39:49,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 06:39:49,051 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 06:39:49,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 06:39:49,067 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 06:39:49,067 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 06:39:49,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 06:39:49,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 06:39:49,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 06:39:49,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 06:39:49,068 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 06:39:49,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 06:39:49,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 06:39:49,069 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 06:39:49,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 06:39:49,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 06:39:49,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 06:39:49,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 06:39:49,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 06:39:49,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 06:39:49,073 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 06:39:49,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 06:39:49,073 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 06:39:49,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 06:39:49,074 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 06:39:49,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 06:39:49,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:39:49,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 06:39:49,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 06:39:49,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 06:39:49,075 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 06:39:49,075 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 06:39:49,075 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 06:39:49,075 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 06:39:49,076 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 06:39:49,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 06:39:49,076 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 06:39:49,076 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 -> PROGRAM_FIRST [2023-08-04 06:39:49,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 06:39:49,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 06:39:49,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 06:39:49,300 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 06:39:49,300 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 06:39:49,301 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 06:39:50,231 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 06:39:50,436 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 06:39:50,436 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 06:39:50,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/737671023/b00f8817129249be8d55e94a5b801d9b/FLAG010f28726 [2023-08-04 06:39:50,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/737671023/b00f8817129249be8d55e94a5b801d9b [2023-08-04 06:39:50,459 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 06:39:50,460 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 06:39:50,462 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 06:39:50,462 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 06:39:50,464 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 06:39:50,465 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,465 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c91f979 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50, skipping insertion in model container [2023-08-04 06:39:50,465 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,515 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 06:39:50,610 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 06:39:50,762 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:39:50,768 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 06:39:50,777 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 06:39:50,793 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 06:39:50,795 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-04 06:39:50,823 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 06:39:50,843 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:39:50,844 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 06:39:50,848 INFO L206 MainTranslator]: Completed translation [2023-08-04 06:39:50,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50 WrapperNode [2023-08-04 06:39:50,848 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 06:39:50,849 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 06:39:50,849 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 06:39:50,849 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 06:39:50,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,865 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,888 INFO L138 Inliner]: procedures = 175, calls = 54, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2023-08-04 06:39:50,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 06:39:50,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 06:39:50,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 06:39:50,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 06:39:50,900 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,917 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,936 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,940 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 06:39:50,941 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 06:39:50,941 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 06:39:50,941 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 06:39:50,941 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (1/1) ... [2023-08-04 06:39:50,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 06:39:50,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:39:50,986 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 06:39:50,993 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 06:39:51,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 06:39:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 06:39:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 06:39:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 06:39:51,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 06:39:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 06:39:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 06:39:51,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 06:39:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 06:39:51,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 06:39:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 06:39:51,014 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 06:39:51,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 06:39:51,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 06:39:51,016 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 06:39:51,148 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 06:39:51,149 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 06:39:51,467 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 06:39:51,580 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 06:39:51,580 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-04 06:39:51,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:39:51 BoogieIcfgContainer [2023-08-04 06:39:51,582 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 06:39:51,583 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 06:39:51,583 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 06:39:51,585 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 06:39:51,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 06:39:50" (1/3) ... [2023-08-04 06:39:51,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0eb063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:39:51, skipping insertion in model container [2023-08-04 06:39:51,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 06:39:50" (2/3) ... [2023-08-04 06:39:51,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b0eb063 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 06:39:51, skipping insertion in model container [2023-08-04 06:39:51,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 06:39:51" (3/3) ... [2023-08-04 06:39:51,587 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt_bound2.i [2023-08-04 06:39:51,592 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 06:39:51,598 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 06:39:51,598 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 06:39:51,598 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 06:39:51,646 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:39:51,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 117 transitions, 244 flow [2023-08-04 06:39:51,754 INFO L124 PetriNetUnfolderBase]: 14/232 cut-off events. [2023-08-04 06:39:51,754 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:39:51,758 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 06:39:51,758 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 117 transitions, 244 flow [2023-08-04 06:39:51,762 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 105 transitions, 216 flow [2023-08-04 06:39:51,764 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:39:51,779 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 107 places, 105 transitions, 216 flow [2023-08-04 06:39:51,782 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 107 places, 105 transitions, 216 flow [2023-08-04 06:39:51,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 105 transitions, 216 flow [2023-08-04 06:39:51,824 INFO L124 PetriNetUnfolderBase]: 10/189 cut-off events. [2023-08-04 06:39:51,825 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:39:51,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 189 events. 10/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 403 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 123. Up to 8 conditions per place. [2023-08-04 06:39:51,827 INFO L119 LiptonReduction]: Number of co-enabled transitions 928 [2023-08-04 06:39:56,233 INFO L134 LiptonReduction]: Checked pairs total: 2036 [2023-08-04 06:39:56,233 INFO L136 LiptonReduction]: Total number of compositions: 91 [2023-08-04 06:39:56,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:39:56,249 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;@65fe8cf6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:39:56,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 06:39:56,253 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:39:56,253 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 06:39:56,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:39:56,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:39:56,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:39:56,254 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:39:56,257 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:39:56,257 INFO L85 PathProgramCache]: Analyzing trace with hash 570900900, now seen corresponding path program 1 times [2023-08-04 06:39:56,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:39:56,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740516703] [2023-08-04 06:39:56,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:39:56,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:39:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:39:56,476 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 06:39:56,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:39:56,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740516703] [2023-08-04 06:39:56,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740516703] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:39:56,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:39:56,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:39:56,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609622956] [2023-08-04 06:39:56,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:39:56,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:39:56,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:39:56,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:39:56,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:39:56,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 208 [2023-08-04 06:39:56,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 18 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 06:39:56,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:39:56,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 208 [2023-08-04 06:39:56,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:39:56,600 INFO L124 PetriNetUnfolderBase]: 107/209 cut-off events. [2023-08-04 06:39:56,601 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:39:56,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 209 events. 107/209 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 817 event pairs, 45 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 414. Up to 201 conditions per place. [2023-08-04 06:39:56,605 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 16 selfloop transitions, 2 changer transitions 1/21 dead transitions. [2023-08-04 06:39:56,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 21 transitions, 86 flow [2023-08-04 06:39:56,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:39:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:39:56,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 326 transitions. [2023-08-04 06:39:56,620 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5224358974358975 [2023-08-04 06:39:56,620 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 326 transitions. [2023-08-04 06:39:56,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 326 transitions. [2023-08-04 06:39:56,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:39:56,625 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 326 transitions. [2023-08-04 06:39:56,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 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 06:39:56,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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 06:39:56,634 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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 06:39:56,635 INFO L175 Difference]: Start difference. First operand has 23 places, 18 transitions, 42 flow. Second operand 3 states and 326 transitions. [2023-08-04 06:39:56,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 21 transitions, 86 flow [2023-08-04 06:39:56,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 06:39:56,637 INFO L231 Difference]: Finished difference. Result has 26 places, 18 transitions, 50 flow [2023-08-04 06:39:56,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=26, PETRI_TRANSITIONS=18} [2023-08-04 06:39:56,641 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 3 predicate places. [2023-08-04 06:39:56,641 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 18 transitions, 50 flow [2023-08-04 06:39:56,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 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 06:39:56,641 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:39:56,641 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:39:56,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 06:39:56,642 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:39:56,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:39:56,642 INFO L85 PathProgramCache]: Analyzing trace with hash -135741150, now seen corresponding path program 1 times [2023-08-04 06:39:56,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:39:56,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606516561] [2023-08-04 06:39:56,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:39:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:39:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:39:56,760 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 06:39:56,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:39:56,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606516561] [2023-08-04 06:39:56,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606516561] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:39:56,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291421559] [2023-08-04 06:39:56,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:39:56,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:39:56,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:39:56,763 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 06:39:56,793 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 06:39:56,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:39:56,862 INFO L262 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:39:56,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:39:56,873 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 06:39:56,873 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:39:56,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291421559] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:39:56,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:39:56,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:39:56,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402457294] [2023-08-04 06:39:56,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:39:56,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:39:56,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:39:56,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:39:56,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:39:56,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 208 [2023-08-04 06:39:56,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 18 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 06:39:56,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:39:56,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 208 [2023-08-04 06:39:56,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:39:56,942 INFO L124 PetriNetUnfolderBase]: 101/196 cut-off events. [2023-08-04 06:39:56,942 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 06:39:56,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 196 events. 101/196 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 729 event pairs, 44 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 395. Up to 161 conditions per place. [2023-08-04 06:39:56,945 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 19 selfloop transitions, 2 changer transitions 1/24 dead transitions. [2023-08-04 06:39:56,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 106 flow [2023-08-04 06:39:56,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:39:56,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:39:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-04 06:39:56,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5272435897435898 [2023-08-04 06:39:56,952 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-04 06:39:56,952 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-04 06:39:56,953 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:39:56,953 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-04 06:39:56,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 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 06:39:56,955 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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 06:39:56,956 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 208.0) internal successors, (832), 4 states have internal predecessors, (832), 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 06:39:56,956 INFO L175 Difference]: Start difference. First operand has 26 places, 18 transitions, 50 flow. Second operand 3 states and 329 transitions. [2023-08-04 06:39:56,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 106 flow [2023-08-04 06:39:56,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 102 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 06:39:56,957 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 54 flow [2023-08-04 06:39:56,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-04 06:39:56,958 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, 4 predicate places. [2023-08-04 06:39:56,958 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 54 flow [2023-08-04 06:39:56,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 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 06:39:56,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:39:56,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:39:56,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 06:39:57,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:39:57,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:39:57,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:39:57,165 INFO L85 PathProgramCache]: Analyzing trace with hash 1433316918, now seen corresponding path program 1 times [2023-08-04 06:39:57,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:39:57,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918910679] [2023-08-04 06:39:57,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:39:57,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:39:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:39:57,247 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 06:39:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:39:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918910679] [2023-08-04 06:39:57,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918910679] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:39:57,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43969368] [2023-08-04 06:39:57,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:39:57,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:39:57,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:39:57,251 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 06:39:57,267 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 06:39:57,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:39:57,332 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:39:57,333 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:39:57,356 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 06:39:57,356 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:39:57,368 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 06:39:57,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43969368] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:39:57,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:39:57,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:39:57,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224882501] [2023-08-04 06:39:57,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:39:57,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:39:57,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:39:57,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:39:57,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:39:57,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 208 [2023-08-04 06:39:57,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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 06:39:57,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:39:57,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 208 [2023-08-04 06:39:57,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:39:57,398 INFO L124 PetriNetUnfolderBase]: 4/16 cut-off events. [2023-08-04 06:39:57,398 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 06:39:57,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 16 events. 4/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2023-08-04 06:39:57,399 INFO L140 encePairwiseOnDemand]: 205/208 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 06:39:57,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 17 places, 10 transitions, 43 flow [2023-08-04 06:39:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:39:57,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:39:57,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 414 transitions. [2023-08-04 06:39:57,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49759615384615385 [2023-08-04 06:39:57,401 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 414 transitions. [2023-08-04 06:39:57,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 414 transitions. [2023-08-04 06:39:57,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:39:57,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 414 transitions. [2023-08-04 06:39:57,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 103.5) internal successors, (414), 4 states have internal predecessors, (414), 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 06:39:57,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 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 06:39:57,404 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 208.0) internal successors, (1040), 5 states have internal predecessors, (1040), 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 06:39:57,404 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 54 flow. Second operand 4 states and 414 transitions. [2023-08-04 06:39:57,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 17 places, 10 transitions, 43 flow [2023-08-04 06:39:57,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 10 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:39:57,404 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2023-08-04 06:39:57,404 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=208, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=16, PETRI_TRANSITIONS=0} [2023-08-04 06:39:57,405 INFO L281 CegarLoopForPetriNet]: 23 programPoint places, -7 predicate places. [2023-08-04 06:39:57,405 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 0 transitions, 0 flow [2023-08-04 06:39:57,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.0) internal successors, (520), 5 states have internal predecessors, (520), 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 06:39:57,407 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 06:39:57,419 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 06:39:57,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 06:39:57,612 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 06:39:57,614 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 06:39:57,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 117 transitions, 244 flow [2023-08-04 06:39:57,628 INFO L124 PetriNetUnfolderBase]: 14/232 cut-off events. [2023-08-04 06:39:57,628 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:39:57,629 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 06:39:57,629 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 117 transitions, 244 flow [2023-08-04 06:39:57,629 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 90 transitions, 190 flow [2023-08-04 06:39:57,629 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:39:57,629 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 94 places, 90 transitions, 190 flow [2023-08-04 06:39:57,630 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 94 places, 90 transitions, 190 flow [2023-08-04 06:39:57,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 90 transitions, 190 flow [2023-08-04 06:39:57,635 INFO L124 PetriNetUnfolderBase]: 2/124 cut-off events. [2023-08-04 06:39:57,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:39:57,636 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 06:39:57,636 INFO L119 LiptonReduction]: Number of co-enabled transitions 524 [2023-08-04 06:40:00,898 INFO L134 LiptonReduction]: Checked pairs total: 1235 [2023-08-04 06:40:00,898 INFO L136 LiptonReduction]: Total number of compositions: 78 [2023-08-04 06:40:00,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 06:40:00,899 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;@65fe8cf6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:40:00,900 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 06:40:00,902 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:40:00,902 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2023-08-04 06:40:00,902 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:40:00,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:00,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:40:00,902 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:40:00,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:00,902 INFO L85 PathProgramCache]: Analyzing trace with hash 645603718, now seen corresponding path program 1 times [2023-08-04 06:40:00,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:00,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231649546] [2023-08-04 06:40:00,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:00,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:00,924 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 06:40:00,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:00,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231649546] [2023-08-04 06:40:00,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231649546] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:40:00,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:40:00,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:40:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858660737] [2023-08-04 06:40:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:40:00,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:40:00,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:00,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:40:00,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:40:00,958 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 195 [2023-08-04 06:40:00,959 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 06:40:00,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:00,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 195 [2023-08-04 06:40:00,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:00,996 INFO L124 PetriNetUnfolderBase]: 31/85 cut-off events. [2023-08-04 06:40:00,996 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:40:00,997 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 06:40:00,997 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 13 selfloop transitions, 2 changer transitions 0/19 dead transitions. [2023-08-04 06:40:00,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 19 transitions, 78 flow [2023-08-04 06:40:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:40:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:40:00,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-08-04 06:40:00,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5504273504273505 [2023-08-04 06:40:00,999 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-08-04 06:40:00,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-08-04 06:40:00,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:00,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-08-04 06:40:01,000 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 06:40:01,001 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 06:40:01,002 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 06:40:01,002 INFO L175 Difference]: Start difference. First operand has 21 places, 16 transitions, 42 flow. Second operand 3 states and 322 transitions. [2023-08-04 06:40:01,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 23 places, 19 transitions, 78 flow [2023-08-04 06:40:01,002 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 06:40:01,003 INFO L231 Difference]: Finished difference. Result has 24 places, 16 transitions, 50 flow [2023-08-04 06:40:01,003 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 06:40:01,003 INFO L281 CegarLoopForPetriNet]: 21 programPoint places, 3 predicate places. [2023-08-04 06:40:01,004 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 16 transitions, 50 flow [2023-08-04 06:40:01,004 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 06:40:01,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:01,004 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 06:40:01,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 06:40:01,004 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 06:40:01,005 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:01,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1475041142, now seen corresponding path program 1 times [2023-08-04 06:40:01,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:01,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721002918] [2023-08-04 06:40:01,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:01,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:01,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:40:01,017 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:40:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:40:01,041 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:40:01,041 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:40:01,041 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 06:40:01,042 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 06:40:01,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 06:40:01,042 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 06:40:01,043 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 06:40:01,043 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 06:40:01,043 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 06:40:01,076 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 06:40:01,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 132 transitions, 288 flow [2023-08-04 06:40:01,135 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 06:40:01,135 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 06:40:01,138 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 06:40:01,138 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 132 transitions, 288 flow [2023-08-04 06:40:01,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 120 transitions, 256 flow [2023-08-04 06:40:01,140 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 06:40:01,140 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 120 transitions, 256 flow [2023-08-04 06:40:01,140 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 120 transitions, 256 flow [2023-08-04 06:40:01,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 120 transitions, 256 flow [2023-08-04 06:40:01,173 INFO L124 PetriNetUnfolderBase]: 21/366 cut-off events. [2023-08-04 06:40:01,174 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 06:40:01,175 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 06:40:01,178 INFO L119 LiptonReduction]: Number of co-enabled transitions 2244 [2023-08-04 06:40:06,109 INFO L134 LiptonReduction]: Checked pairs total: 6209 [2023-08-04 06:40:06,110 INFO L136 LiptonReduction]: Total number of compositions: 95 [2023-08-04 06:40:06,111 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 06:40:06,111 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;@65fe8cf6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 06:40:06,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 06:40:06,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 06:40:06,114 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2023-08-04 06:40:06,114 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 06:40:06,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:06,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 06:40:06,114 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:06,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:06,114 INFO L85 PathProgramCache]: Analyzing trace with hash 876337121, now seen corresponding path program 1 times [2023-08-04 06:40:06,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:06,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481975585] [2023-08-04 06:40:06,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:06,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:06,188 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 06:40:06,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:06,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481975585] [2023-08-04 06:40:06,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481975585] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:40:06,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:40:06,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:40:06,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034090294] [2023-08-04 06:40:06,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:40:06,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:40:06,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:06,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:40:06,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:40:06,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 227 [2023-08-04 06:40:06,197 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 06:40:06,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:06,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 227 [2023-08-04 06:40:06,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:06,800 INFO L124 PetriNetUnfolderBase]: 3548/5517 cut-off events. [2023-08-04 06:40:06,801 INFO L125 PetriNetUnfolderBase]: For 141/141 co-relation queries the response was YES. [2023-08-04 06:40:06,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10788 conditions, 5517 events. 3548/5517 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 252. Compared 32628 event pairs, 2526 based on Foata normal form. 0/5210 useless extension candidates. Maximal degree in co-relation 3077. Up to 5082 conditions per place. [2023-08-04 06:40:06,828 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 25 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-04 06:40:06,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 136 flow [2023-08-04 06:40:06,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:40:06,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:40:06,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2023-08-04 06:40:06,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5389133627019089 [2023-08-04 06:40:06,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2023-08-04 06:40:06,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2023-08-04 06:40:06,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:06,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2023-08-04 06:40:06,831 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 06:40:06,832 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 06:40:06,833 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 06:40:06,833 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 74 flow. Second operand 3 states and 367 transitions. [2023-08-04 06:40:06,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 136 flow [2023-08-04 06:40:06,835 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 06:40:06,836 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 86 flow [2023-08-04 06:40:06,838 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 06:40:06,840 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 3 predicate places. [2023-08-04 06:40:06,840 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 86 flow [2023-08-04 06:40:06,840 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 06:40:06,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:06,840 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:40:06,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 06:40:06,840 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:06,841 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:06,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1827805735, now seen corresponding path program 1 times [2023-08-04 06:40:06,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:06,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001689690] [2023-08-04 06:40:06,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:06,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:06,910 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 06:40:06,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:06,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001689690] [2023-08-04 06:40:06,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001689690] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:40:06,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739469433] [2023-08-04 06:40:06,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:06,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:40:06,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:40:06,913 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 06:40:06,915 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 06:40:07,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:07,030 INFO L262 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 06:40:07,031 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:40:07,036 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 06:40:07,037 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:40:07,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739469433] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:40:07,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:40:07,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 06:40:07,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983641618] [2023-08-04 06:40:07,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:40:07,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:40:07,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:07,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:40:07,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:40:07,063 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 227 [2023-08-04 06:40:07,064 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 06:40:07,064 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:07,064 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 227 [2023-08-04 06:40:07,064 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:07,769 INFO L124 PetriNetUnfolderBase]: 3506/5348 cut-off events. [2023-08-04 06:40:07,769 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-08-04 06:40:07,776 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 31079 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 06:40:07,790 INFO L140 encePairwiseOnDemand]: 224/227 looper letters, 31 selfloop transitions, 2 changer transitions 0/39 dead transitions. [2023-08-04 06:40:07,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 39 transitions, 170 flow [2023-08-04 06:40:07,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:40:07,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:40:07,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-04 06:40:07,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5462555066079295 [2023-08-04 06:40:07,792 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-04 06:40:07,792 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-04 06:40:07,792 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:07,792 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-04 06:40:07,792 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 06:40:07,794 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 06:40:07,795 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 06:40:07,795 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 86 flow. Second operand 3 states and 372 transitions. [2023-08-04 06:40:07,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 39 transitions, 170 flow [2023-08-04 06:40:07,797 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 06:40:07,797 INFO L231 Difference]: Finished difference. Result has 43 places, 31 transitions, 96 flow [2023-08-04 06:40:07,798 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 06:40:07,799 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2023-08-04 06:40:07,799 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 31 transitions, 96 flow [2023-08-04 06:40:07,799 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 06:40:07,799 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:07,799 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:40:07,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-08-04 06:40:08,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:40:08,004 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:08,004 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:08,004 INFO L85 PathProgramCache]: Analyzing trace with hash 203677790, now seen corresponding path program 1 times [2023-08-04 06:40:08,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:08,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077311508] [2023-08-04 06:40:08,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:08,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:08,040 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 06:40:08,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:08,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077311508] [2023-08-04 06:40:08,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077311508] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:40:08,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680966068] [2023-08-04 06:40:08,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:08,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:40:08,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:40:08,041 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 06:40:08,043 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 06:40:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:08,127 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:40:08,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:40:08,137 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 06:40:08,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:40:08,149 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 06:40:08,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680966068] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:40:08,149 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:40:08,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 06:40:08,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492174027] [2023-08-04 06:40:08,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:40:08,149 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:40:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:08,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:40:08,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:40:08,159 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 227 [2023-08-04 06:40:08,159 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 06:40:08,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:08,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 227 [2023-08-04 06:40:08,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:08,622 INFO L124 PetriNetUnfolderBase]: 2821/4211 cut-off events. [2023-08-04 06:40:08,622 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2023-08-04 06:40:08,629 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 22669 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 06:40:08,642 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 29 selfloop transitions, 3 changer transitions 1/39 dead transitions. [2023-08-04 06:40:08,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 178 flow [2023-08-04 06:40:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:40:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:40:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 481 transitions. [2023-08-04 06:40:08,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5297356828193832 [2023-08-04 06:40:08,643 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 481 transitions. [2023-08-04 06:40:08,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 481 transitions. [2023-08-04 06:40:08,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:08,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 481 transitions. [2023-08-04 06:40:08,645 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 06:40:08,645 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 06:40:08,646 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 06:40:08,646 INFO L175 Difference]: Start difference. First operand has 43 places, 31 transitions, 96 flow. Second operand 4 states and 481 transitions. [2023-08-04 06:40:08,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 178 flow [2023-08-04 06:40:08,647 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 06:40:08,648 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 108 flow [2023-08-04 06:40:08,648 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 06:40:08,649 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 9 predicate places. [2023-08-04 06:40:08,650 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 108 flow [2023-08-04 06:40:08,650 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 06:40:08,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:08,652 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:40:08,657 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 06:40:08,857 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 06:40:08,857 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:08,858 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:08,858 INFO L85 PathProgramCache]: Analyzing trace with hash 701049111, now seen corresponding path program 1 times [2023-08-04 06:40:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075100034] [2023-08-04 06:40:08,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:08,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:08,910 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 06:40:08,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:08,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075100034] [2023-08-04 06:40:08,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075100034] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:40:08,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516589793] [2023-08-04 06:40:08,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:08,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:40:08,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:40:08,913 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 06:40:08,917 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 06:40:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:09,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:40:09,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:40:09,011 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 06:40:09,012 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:40:09,023 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 06:40:09,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516589793] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:40:09,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:40:09,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 06:40:09,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010455530] [2023-08-04 06:40:09,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:40:09,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:40:09,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:09,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:40:09,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:40:09,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 227 [2023-08-04 06:40:09,034 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 06:40:09,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:09,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 227 [2023-08-04 06:40:09,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:09,419 INFO L124 PetriNetUnfolderBase]: 2584/3742 cut-off events. [2023-08-04 06:40:09,419 INFO L125 PetriNetUnfolderBase]: For 333/333 co-relation queries the response was YES. [2023-08-04 06:40:09,425 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 18978 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 06:40:09,440 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 40 selfloop transitions, 3 changer transitions 1/50 dead transitions. [2023-08-04 06:40:09,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 234 flow [2023-08-04 06:40:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:40:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:40:09,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2023-08-04 06:40:09,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5418502202643172 [2023-08-04 06:40:09,442 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2023-08-04 06:40:09,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2023-08-04 06:40:09,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:09,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2023-08-04 06:40:09,443 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 06:40:09,444 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 06:40:09,444 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 06:40:09,444 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 108 flow. Second operand 4 states and 492 transitions. [2023-08-04 06:40:09,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 234 flow [2023-08-04 06:40:09,447 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 06:40:09,448 INFO L231 Difference]: Finished difference. Result has 49 places, 31 transitions, 115 flow [2023-08-04 06:40:09,448 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 06:40:09,449 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2023-08-04 06:40:09,449 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 31 transitions, 115 flow [2023-08-04 06:40:09,450 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 06:40:09,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:09,450 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:40:09,457 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 06:40:09,657 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 06:40:09,657 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:09,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:09,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2103169733, now seen corresponding path program 1 times [2023-08-04 06:40:09,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:09,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935605326] [2023-08-04 06:40:09,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:09,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:09,778 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 06:40:09,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:09,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935605326] [2023-08-04 06:40:09,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935605326] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:40:09,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:40:09,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:40:09,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009890258] [2023-08-04 06:40:09,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:40:09,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:40:09,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:09,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:40:09,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:40:09,782 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 227 [2023-08-04 06:40:09,783 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 06:40:09,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:09,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 227 [2023-08-04 06:40:09,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:10,121 INFO L124 PetriNetUnfolderBase]: 2146/3250 cut-off events. [2023-08-04 06:40:10,121 INFO L125 PetriNetUnfolderBase]: For 1711/1711 co-relation queries the response was YES. [2023-08-04 06:40:10,128 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 17252 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 06:40:10,136 INFO L140 encePairwiseOnDemand]: 223/227 looper letters, 34 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2023-08-04 06:40:10,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 43 transitions, 235 flow [2023-08-04 06:40:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:40:10,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:40:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2023-08-04 06:40:10,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.55359765051395 [2023-08-04 06:40:10,138 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 377 transitions. [2023-08-04 06:40:10,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 377 transitions. [2023-08-04 06:40:10,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:10,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 377 transitions. [2023-08-04 06:40:10,138 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 06:40:10,139 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 06:40:10,139 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 06:40:10,139 INFO L175 Difference]: Start difference. First operand has 49 places, 31 transitions, 115 flow. Second operand 3 states and 377 transitions. [2023-08-04 06:40:10,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 43 transitions, 235 flow [2023-08-04 06:40:10,141 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 06:40:10,141 INFO L231 Difference]: Finished difference. Result has 49 places, 33 transitions, 127 flow [2023-08-04 06:40:10,141 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 06:40:10,142 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 11 predicate places. [2023-08-04 06:40:10,142 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 33 transitions, 127 flow [2023-08-04 06:40:10,142 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 06:40:10,142 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:10,142 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:40:10,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 06:40:10,142 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:10,143 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:10,143 INFO L85 PathProgramCache]: Analyzing trace with hash -773754007, now seen corresponding path program 1 times [2023-08-04 06:40:10,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:10,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991709802] [2023-08-04 06:40:10,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:10,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:10,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:10,248 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 06:40:10,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:10,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991709802] [2023-08-04 06:40:10,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991709802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:40:10,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:40:10,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 06:40:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032152020] [2023-08-04 06:40:10,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:40:10,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 06:40:10,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:10,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 06:40:10,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-04 06:40:10,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 227 [2023-08-04 06:40:10,257 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 06:40:10,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:10,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 227 [2023-08-04 06:40:10,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:11,059 INFO L124 PetriNetUnfolderBase]: 5910/8551 cut-off events. [2023-08-04 06:40:11,059 INFO L125 PetriNetUnfolderBase]: For 4292/4292 co-relation queries the response was YES. [2023-08-04 06:40:11,075 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 49447 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 06:40:11,091 INFO L140 encePairwiseOnDemand]: 221/227 looper letters, 62 selfloop transitions, 7 changer transitions 2/75 dead transitions. [2023-08-04 06:40:11,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 75 transitions, 424 flow [2023-08-04 06:40:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:40:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:40:11,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-04 06:40:11,093 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5594713656387665 [2023-08-04 06:40:11,093 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-04 06:40:11,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-04 06:40:11,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:11,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-04 06:40:11,094 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 06:40:11,095 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 06:40:11,095 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 06:40:11,095 INFO L175 Difference]: Start difference. First operand has 49 places, 33 transitions, 127 flow. Second operand 4 states and 508 transitions. [2023-08-04 06:40:11,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 75 transitions, 424 flow [2023-08-04 06:40:11,097 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 06:40:11,098 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 183 flow [2023-08-04 06:40:11,098 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 06:40:11,098 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 15 predicate places. [2023-08-04 06:40:11,098 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 183 flow [2023-08-04 06:40:11,099 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 06:40:11,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:11,099 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 06:40:11,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 06:40:11,099 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:11,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:11,099 INFO L85 PathProgramCache]: Analyzing trace with hash 12903415, now seen corresponding path program 1 times [2023-08-04 06:40:11,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:11,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583028336] [2023-08-04 06:40:11,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:11,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:12,056 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 06:40:12,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:12,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583028336] [2023-08-04 06:40:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583028336] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:40:12,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222577366] [2023-08-04 06:40:12,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:12,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:40:12,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:40:12,057 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 06:40:12,059 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 06:40:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:12,159 INFO L262 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-04 06:40:12,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:40:12,201 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 06:40:12,201 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 06:40:12,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222577366] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:40:12,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 06:40:12,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2023-08-04 06:40:12,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971578125] [2023-08-04 06:40:12,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:40:12,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 06:40:12,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:12,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 06:40:12,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-08-04 06:40:12,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 227 [2023-08-04 06:40:12,215 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 06:40:12,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:12,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 227 [2023-08-04 06:40:12,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:12,843 INFO L124 PetriNetUnfolderBase]: 3975/5943 cut-off events. [2023-08-04 06:40:12,843 INFO L125 PetriNetUnfolderBase]: For 5074/5109 co-relation queries the response was YES. [2023-08-04 06:40:12,851 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 35270 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 06:40:12,877 INFO L140 encePairwiseOnDemand]: 220/227 looper letters, 75 selfloop transitions, 9 changer transitions 2/94 dead transitions. [2023-08-04 06:40:12,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 94 transitions, 597 flow [2023-08-04 06:40:12,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 06:40:12,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 06:40:12,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-04 06:40:12,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321585903083701 [2023-08-04 06:40:12,879 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-04 06:40:12,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-04 06:40:12,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:12,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-04 06:40:12,880 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 06:40:12,881 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 06:40:12,881 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 06:40:12,881 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 183 flow. Second operand 5 states and 604 transitions. [2023-08-04 06:40:12,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 94 transitions, 597 flow [2023-08-04 06:40:12,884 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 06:40:12,885 INFO L231 Difference]: Finished difference. Result has 59 places, 47 transitions, 251 flow [2023-08-04 06:40:12,885 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 06:40:12,885 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 21 predicate places. [2023-08-04 06:40:12,885 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 47 transitions, 251 flow [2023-08-04 06:40:12,885 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 06:40:12,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:12,885 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 06:40:12,890 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 06:40:13,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:40:13,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:13,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:13,091 INFO L85 PathProgramCache]: Analyzing trace with hash -242436908, now seen corresponding path program 1 times [2023-08-04 06:40:13,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:13,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753036430] [2023-08-04 06:40:13,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:13,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:13,849 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 06:40:13,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753036430] [2023-08-04 06:40:13,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753036430] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:40:13,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251645853] [2023-08-04 06:40:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:13,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:40:13,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:40:13,851 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 06:40:13,853 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 06:40:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:13,965 INFO L262 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 21 conjunts are in the unsatisfiable core [2023-08-04 06:40:13,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:40:14,009 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 06:40:14,010 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:40:14,083 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 06:40:14,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251645853] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:40:14,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:40:14,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 11 [2023-08-04 06:40:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596860206] [2023-08-04 06:40:14,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:40:14,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-04 06:40:14,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:14,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-04 06:40:14,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2023-08-04 06:40:14,270 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 227 [2023-08-04 06:40:14,271 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 47 transitions, 251 flow. Second operand has 12 states, 12 states have (on average 95.16666666666667) internal successors, (1142), 12 states have internal predecessors, (1142), 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 06:40:14,271 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:14,271 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 227 [2023-08-04 06:40:14,271 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:15,844 INFO L124 PetriNetUnfolderBase]: 6054/9063 cut-off events. [2023-08-04 06:40:15,844 INFO L125 PetriNetUnfolderBase]: For 11513/11566 co-relation queries the response was YES. [2023-08-04 06:40:15,877 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 53906 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 06:40:15,899 INFO L140 encePairwiseOnDemand]: 213/227 looper letters, 175 selfloop transitions, 47 changer transitions 16/244 dead transitions. [2023-08-04 06:40:15,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 244 transitions, 1665 flow [2023-08-04 06:40:15,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-04 06:40:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-04 06:40:15,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1742 transitions. [2023-08-04 06:40:15,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45141228297486397 [2023-08-04 06:40:15,903 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1742 transitions. [2023-08-04 06:40:15,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1742 transitions. [2023-08-04 06:40:15,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:15,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1742 transitions. [2023-08-04 06:40:15,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 102.47058823529412) internal successors, (1742), 17 states have internal predecessors, (1742), 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 06:40:15,910 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 06:40:15,910 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 06:40:15,910 INFO L175 Difference]: Start difference. First operand has 59 places, 47 transitions, 251 flow. Second operand 17 states and 1742 transitions. [2023-08-04 06:40:15,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 244 transitions, 1665 flow [2023-08-04 06:40:15,927 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 06:40:15,930 INFO L231 Difference]: Finished difference. Result has 87 places, 86 transitions, 664 flow [2023-08-04 06:40:15,930 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 06:40:15,931 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 49 predicate places. [2023-08-04 06:40:15,931 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 86 transitions, 664 flow [2023-08-04 06:40:15,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 95.16666666666667) internal successors, (1142), 12 states have internal predecessors, (1142), 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 06:40:15,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:15,931 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 06:40:15,938 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 06:40:16,138 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 06:40:16,139 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:16,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:16,139 INFO L85 PathProgramCache]: Analyzing trace with hash -498811545, now seen corresponding path program 1 times [2023-08-04 06:40:16,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:16,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869546554] [2023-08-04 06:40:16,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:16,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:17,363 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 06:40:17,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:40:17,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869546554] [2023-08-04 06:40:17,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869546554] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:40:17,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756343433] [2023-08-04 06:40:17,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:17,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:40:17,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:40:17,385 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 06:40:17,387 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 06:40:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:40:17,486 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 76 conjunts are in the unsatisfiable core [2023-08-04 06:40:17,495 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:40:17,534 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-08-04 06:40:17,534 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 06:40:17,571 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 06:40:17,642 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 06:40:17,720 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 06:40:17,721 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 06:40:17,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 06:40:17,850 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 06:40:18,015 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 06:40:18,109 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 06:40:18,237 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 06:40:18,258 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 06:40:18,258 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:40:25,593 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 06:40:25,856 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 06:40:25,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756343433] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:40:25,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:40:25,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 26 [2023-08-04 06:40:25,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546158753] [2023-08-04 06:40:25,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:40:25,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-04 06:40:25,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:40:25,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-04 06:40:25,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=625, Unknown=3, NotChecked=0, Total=756 [2023-08-04 06:40:26,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 227 [2023-08-04 06:40:26,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 86 transitions, 664 flow. Second operand has 28 states, 28 states have (on average 81.35714285714286) internal successors, (2278), 28 states have internal predecessors, (2278), 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 06:40:26,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:40:26,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 227 [2023-08-04 06:40:26,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:40:36,760 WARN L233 SmtUtils]: Spent 6.58s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 06:40:43,239 INFO L124 PetriNetUnfolderBase]: 8016/12018 cut-off events. [2023-08-04 06:40:43,239 INFO L125 PetriNetUnfolderBase]: For 56048/56109 co-relation queries the response was YES. [2023-08-04 06:40:43,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53918 conditions, 12018 events. 8016/12018 cut-off events. For 56048/56109 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 75300 event pairs, 963 based on Foata normal form. 32/11884 useless extension candidates. Maximal degree in co-relation 46383. Up to 7570 conditions per place. [2023-08-04 06:40:43,309 INFO L140 encePairwiseOnDemand]: 212/227 looper letters, 243 selfloop transitions, 179 changer transitions 29/457 dead transitions. [2023-08-04 06:40:43,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 457 transitions, 4273 flow [2023-08-04 06:40:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2023-08-04 06:40:43,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2023-08-04 06:40:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 3316 transitions. [2023-08-04 06:40:43,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3844191977741711 [2023-08-04 06:40:43,318 INFO L72 ComplementDD]: Start complementDD. Operand 38 states and 3316 transitions. [2023-08-04 06:40:43,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 3316 transitions. [2023-08-04 06:40:43,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:40:43,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 38 states and 3316 transitions. [2023-08-04 06:40:43,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 39 states, 38 states have (on average 87.26315789473684) internal successors, (3316), 38 states have internal predecessors, (3316), 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 06:40:43,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 39 states, 39 states have (on average 227.0) internal successors, (8853), 39 states have internal predecessors, (8853), 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 06:40:43,334 INFO L81 ComplementDD]: Finished complementDD. Result has 39 states, 39 states have (on average 227.0) internal successors, (8853), 39 states have internal predecessors, (8853), 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 06:40:43,334 INFO L175 Difference]: Start difference. First operand has 87 places, 86 transitions, 664 flow. Second operand 38 states and 3316 transitions. [2023-08-04 06:40:43,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 457 transitions, 4273 flow [2023-08-04 06:40:43,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 457 transitions, 3972 flow, removed 132 selfloop flow, removed 3 redundant places. [2023-08-04 06:40:43,847 INFO L231 Difference]: Finished difference. Result has 138 places, 249 transitions, 2356 flow [2023-08-04 06:40:43,847 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=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=38, PETRI_FLOW=2356, PETRI_PLACES=138, PETRI_TRANSITIONS=249} [2023-08-04 06:40:43,847 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 100 predicate places. [2023-08-04 06:40:43,847 INFO L495 AbstractCegarLoop]: Abstraction has has 138 places, 249 transitions, 2356 flow [2023-08-04 06:40:43,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 81.35714285714286) internal successors, (2278), 28 states have internal predecessors, (2278), 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 06:40:43,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:40:43,848 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 06:40:43,855 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 06:40:44,053 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 06:40:44,054 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 06:40:44,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:40:44,054 INFO L85 PathProgramCache]: Analyzing trace with hash -433449730, now seen corresponding path program 1 times [2023-08-04 06:40:44,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:40:44,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847749226] [2023-08-04 06:40:44,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:40:44,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:40:44,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:40:44,090 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:40:44,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:40:44,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:40:44,153 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:40:44,153 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 06:40:44,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 06:40:44,153 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:40:44,154 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE (1/2) [2023-08-04 06:40:44,155 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:40:44,155 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:40:44,239 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:40:44 BasicIcfg [2023-08-04 06:40:44,239 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:40:44,240 INFO L158 Benchmark]: Toolchain (without parser) took 53779.86ms. Allocated memory was 350.2MB in the beginning and 1.1GB in the end (delta: 763.4MB). Free memory was 301.1MB in the beginning and 627.7MB in the end (delta: -326.7MB). Peak memory consumption was 438.1MB. Max. memory is 16.0GB. [2023-08-04 06:40:44,240 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 350.2MB. Free memory is still 303.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:40:44,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 386.58ms. Allocated memory is still 350.2MB. Free memory was 300.7MB in the beginning and 278.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 06:40:44,240 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.53ms. Allocated memory is still 350.2MB. Free memory was 278.1MB in the beginning and 275.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:40:44,241 INFO L158 Benchmark]: Boogie Preprocessor took 51.12ms. Allocated memory is still 350.2MB. Free memory was 275.6MB in the beginning and 273.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:40:44,241 INFO L158 Benchmark]: RCFGBuilder took 641.16ms. Allocated memory was 350.2MB in the beginning and 534.8MB in the end (delta: 184.5MB). Free memory was 273.8MB in the beginning and 470.5MB in the end (delta: -196.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.0GB. [2023-08-04 06:40:44,241 INFO L158 Benchmark]: TraceAbstraction took 52656.19ms. Allocated memory was 534.8MB in the beginning and 1.1GB in the end (delta: 578.8MB). Free memory was 470.5MB in the beginning and 627.7MB in the end (delta: -157.2MB). Peak memory consumption was 420.5MB. Max. memory is 16.0GB. [2023-08-04 06:40:44,244 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.08ms. Allocated memory is still 350.2MB. Free memory is still 303.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 386.58ms. Allocated memory is still 350.2MB. Free memory was 300.7MB in the beginning and 278.1MB in the end (delta: 22.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 39.53ms. Allocated memory is still 350.2MB. Free memory was 278.1MB in the beginning and 275.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 51.12ms. Allocated memory is still 350.2MB. Free memory was 275.6MB in the beginning and 273.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 641.16ms. Allocated memory was 350.2MB in the beginning and 534.8MB in the end (delta: 184.5MB). Free memory was 273.8MB in the beginning and 470.5MB in the end (delta: -196.7MB). Peak memory consumption was 21.8MB. Max. memory is 16.0GB. * TraceAbstraction took 52656.19ms. Allocated memory was 534.8MB in the beginning and 1.1GB in the end (delta: 578.8MB). Free memory was 470.5MB in the beginning and 627.7MB in the end (delta: -157.2MB). Peak memory consumption was 420.5MB. 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.5s, 107 PlacesBefore, 23 PlacesAfterwards, 105 TransitionsBefore, 18 TransitionsAfterwards, 928 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 31 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 3 ChoiceCompositions, 91 TotalNumberOfCompositions, 2036 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 998, independent: 878, independent conditional: 0, independent unconditional: 878, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 485, independent: 459, independent conditional: 0, independent unconditional: 459, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 998, independent: 419, independent conditional: 0, independent unconditional: 419, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 485, unknown conditional: 0, unknown unconditional: 485] , Statistics on independence cache: Total cache size (in pairs): 35, Positive cache size: 26, Positive conditional cache size: 0, Positive unconditional cache size: 26, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 94 PlacesBefore, 21 PlacesAfterwards, 90 TransitionsBefore, 16 TransitionsAfterwards, 524 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 19 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 78 TotalNumberOfCompositions, 1235 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 645, independent: 549, independent conditional: 0, independent unconditional: 549, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 285, independent: 269, independent conditional: 0, independent unconditional: 269, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 645, independent: 280, independent conditional: 0, independent unconditional: 280, dependent: 80, dependent conditional: 0, dependent unconditional: 80, 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: 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, 6209 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2190, independent: 1978, independent conditional: 0, independent unconditional: 1978, dependent: 212, dependent conditional: 0, dependent unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1057, independent: 1019, independent conditional: 0, independent unconditional: 1019, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2190, independent: 959, independent conditional: 0, independent unconditional: 959, dependent: 174, dependent conditional: 0, dependent unconditional: 174, unknown: 1057, unknown conditional: 0, unknown unconditional: 1057] , Statistics on independence cache: Total cache size (in pairs): 75, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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))=-3, 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] EXPR 1 \read(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=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}] [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=0, 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=0, 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))=-2, t1929={6:0}, weak$$choice1=0, weak$$choice2=0, 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=0, 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=0, 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))=-1, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=0, 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=0, 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=0, 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))=0, t1929={6:0}, t1930={5:0}, weak$$choice1=0, weak$$choice2=0, 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=0, 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=0, 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=0, 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=0, 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=0, 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 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.9s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 2 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=2, InterpolantAutomatonStates: 10, 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.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 43 NumberOfCodeBlocks, 43 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 48 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 SizeOfPredicates, 0 NumberOfNonLiveVariables, 385 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4/8 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 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: 43.1s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 150 mSolverCounterUnknown, 1114 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1006 mSDsluCounter, 828 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 705 mSDsCounter, 308 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2773 IncrementalHoareTripleChecker+Invalid, 3231 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 308 mSolverCounterUnsat, 123 mSDtfsCounter, 2773 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 167 SyntacticMatches, 7 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 879 ImplicationChecksByTransitivity, 20.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2356occurred in iteration=9, InterpolantAutomatonStates: 81, 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, 11.8s InterpolantComputationTime, 308 NumberOfCodeBlocks, 308 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 344 ConstructedInterpolants, 26 QuantifiedInterpolants, 6123 SizeOfPredicates, 46 NumberOfNonLiveVariables, 1498 ConjunctsInSsa, 125 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 - 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: 3.4s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, 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.0s 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 RESULT: Ultimate proved your program to be incorrect! [2023-08-04 06:40:44,304 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...