/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_mix002.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:29:22,131 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:29:22,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:29:22,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:29:22,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:29:22,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:29:22,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:29:22,246 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:29:22,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:29:22,250 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:29:22,251 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:29:22,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:29:22,252 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:29:22,253 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:29:22,253 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:29:22,253 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:29:22,253 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:29:22,254 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:29:22,254 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:29:22,254 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:29:22,254 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:29:22,255 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:29:22,255 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:29:22,255 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:29:22,255 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:29:22,255 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:29:22,255 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:29:22,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:29:22,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:29:22,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:29:22,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:29:22,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:29:22,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:29:22,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:29:22,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:29:22,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:29:22,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:29:22,258 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:29:22,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:29:22,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:29:22,259 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:29:22,259 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 05:29:22,496 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:29:22,518 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:29:22,520 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:29:22,521 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:29:22,522 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:29:22,523 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix002.opt_bound2.i [2023-08-04 05:29:23,733 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:29:23,982 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:29:23,983 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix002.opt_bound2.i [2023-08-04 05:29:24,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce52b4b03/9178d44d43d74942bab287045340e41c/FLAG08c8c9af9 [2023-08-04 05:29:24,016 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce52b4b03/9178d44d43d74942bab287045340e41c [2023-08-04 05:29:24,022 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:29:24,023 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:29:24,024 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:29:24,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:29:24,031 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:29:24,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,033 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36c6b7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24, skipping insertion in model container [2023-08-04 05:29:24,033 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,093 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:29:24,218 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_mix002.opt_bound2.i[944,957] [2023-08-04 05:29:24,470 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:29:24,482 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:29:24,495 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_mix002.opt_bound2.i[944,957] [2023-08-04 05:29:24,506 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:29:24,508 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:29:24,533 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:29:24,559 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:29:24,559 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:29:24,565 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:29:24,566 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24 WrapperNode [2023-08-04 05:29:24,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:29:24,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:29:24,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:29:24,567 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:29:24,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,589 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,618 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 177 [2023-08-04 05:29:24,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:29:24,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:29:24,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:29:24,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:29:24,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,630 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,631 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,653 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:29:24,654 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:29:24,654 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:29:24,654 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:29:24,654 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (1/1) ... [2023-08-04 05:29:24,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:29:24,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:29:24,689 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 05:29:24,693 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 05:29:24,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:29:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:29:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:29:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:29:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:29:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:29:24,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:29:24,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:29:24,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:29:24,726 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:29:24,726 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:29:24,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:29:24,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:29:24,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:29:24,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:29:24,727 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 05:29:24,872 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:29:24,874 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:29:25,153 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:29:25,303 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:29:25,303 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:29:25,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:29:25 BoogieIcfgContainer [2023-08-04 05:29:25,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:29:25,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:29:25,308 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:29:25,311 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:29:25,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:29:24" (1/3) ... [2023-08-04 05:29:25,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238a3afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:29:25, skipping insertion in model container [2023-08-04 05:29:25,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:29:24" (2/3) ... [2023-08-04 05:29:25,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@238a3afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:29:25, skipping insertion in model container [2023-08-04 05:29:25,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:29:25" (3/3) ... [2023-08-04 05:29:25,315 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix002.opt_bound2.i [2023-08-04 05:29:25,322 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:29:25,331 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:29:25,331 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:29:25,331 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:29:25,394 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:29:25,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:29:25,606 INFO L124 PetriNetUnfolderBase]: 30/461 cut-off events. [2023-08-04 05:29:25,607 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:25,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 461 events. 30/461 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2047 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:29:25,614 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:29:25,622 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 134 transitions, 279 flow [2023-08-04 05:29:25,626 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:29:25,648 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 134 transitions, 279 flow [2023-08-04 05:29:25,652 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 134 transitions, 279 flow [2023-08-04 05:29:25,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 279 flow [2023-08-04 05:29:25,730 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-04 05:29:25,730 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:25,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 480 conditions, 458 events. 30/458 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2027 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 05:29:25,738 INFO L119 LiptonReduction]: Number of co-enabled transitions 2898 [2023-08-04 05:29:29,427 INFO L134 LiptonReduction]: Checked pairs total: 7377 [2023-08-04 05:29:29,428 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-04 05:29:29,439 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:29:29,444 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;@5ad9a8a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:29:29,445 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:29:29,461 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:29:29,462 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2023-08-04 05:29:29,462 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:29,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:29,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:29:29,463 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:29:29,467 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:29,468 INFO L85 PathProgramCache]: Analyzing trace with hash 603626246, now seen corresponding path program 1 times [2023-08-04 05:29:29,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:29,474 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118412657] [2023-08-04 05:29:29,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:29,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:29,731 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 05:29:29,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:29,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118412657] [2023-08-04 05:29:29,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118412657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:29,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:29:29,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:29:29,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251956705] [2023-08-04 05:29:29,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:29,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:29,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:29,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:29,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:29:29,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 252 [2023-08-04 05:29:29,796 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 05:29:29,796 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:29,796 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 252 [2023-08-04 05:29:29,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:30,326 INFO L124 PetriNetUnfolderBase]: 2546/4045 cut-off events. [2023-08-04 05:29:30,327 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-04 05:29:30,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8004 conditions, 4045 events. 2546/4045 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 23448 event pairs, 1568 based on Foata normal form. 140/3493 useless extension candidates. Maximal degree in co-relation 7991. Up to 3851 conditions per place. [2023-08-04 05:29:30,350 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 30 selfloop transitions, 2 changer transitions 1/37 dead transitions. [2023-08-04 05:29:30,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 37 transitions, 151 flow [2023-08-04 05:29:30,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:30,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:30,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-04 05:29:30,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5105820105820106 [2023-08-04 05:29:30,364 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-04 05:29:30,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-04 05:29:30,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:30,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-04 05:29:30,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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 05:29:30,376 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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 05:29:30,377 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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 05:29:30,378 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 79 flow. Second operand 3 states and 386 transitions. [2023-08-04 05:29:30,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 37 transitions, 151 flow [2023-08-04 05:29:30,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 37 transitions, 151 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:29:30,383 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 85 flow [2023-08-04 05:29:30,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-04 05:29:30,388 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 3 predicate places. [2023-08-04 05:29:30,388 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 85 flow [2023-08-04 05:29:30,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 05:29:30,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:30,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:29:30,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:29:30,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:29:30,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:30,390 INFO L85 PathProgramCache]: Analyzing trace with hash 864768895, now seen corresponding path program 1 times [2023-08-04 05:29:30,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:30,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644015789] [2023-08-04 05:29:30,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:30,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:30,467 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 05:29:30,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:30,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644015789] [2023-08-04 05:29:30,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644015789] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:29:30,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284555152] [2023-08-04 05:29:30,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:30,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:29:30,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:29:30,472 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 05:29:30,490 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 05:29:30,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:30,568 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:29:30,572 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:29:30,596 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 05:29:30,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:29:30,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284555152] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:30,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:29:30,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:29:30,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817780658] [2023-08-04 05:29:30,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:30,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:30,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:30,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:30,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:29:30,616 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 252 [2023-08-04 05:29:30,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 05:29:30,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:30,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 252 [2023-08-04 05:29:30,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:31,049 INFO L124 PetriNetUnfolderBase]: 2200/3429 cut-off events. [2023-08-04 05:29:31,050 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-04 05:29:31,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6801 conditions, 3429 events. 2200/3429 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 18854 event pairs, 1918 based on Foata normal form. 0/2901 useless extension candidates. Maximal degree in co-relation 6785. Up to 3221 conditions per place. [2023-08-04 05:29:31,067 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 33 selfloop transitions, 2 changer transitions 1/40 dead transitions. [2023-08-04 05:29:31,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 171 flow [2023-08-04 05:29:31,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:31,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-04 05:29:31,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5132275132275133 [2023-08-04 05:29:31,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-04 05:29:31,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-04 05:29:31,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:31,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-04 05:29:31,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 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 05:29:31,074 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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 05:29:31,075 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 252.0) internal successors, (1008), 4 states have internal predecessors, (1008), 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 05:29:31,075 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 85 flow. Second operand 3 states and 388 transitions. [2023-08-04 05:29:31,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 171 flow [2023-08-04 05:29:31,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:29:31,076 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 89 flow [2023-08-04 05:29:31,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=89, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-04 05:29:31,077 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2023-08-04 05:29:31,077 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 89 flow [2023-08-04 05:29:31,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 05:29:31,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:31,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:29:31,092 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 05:29:31,284 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 05:29:31,285 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:29:31,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:31,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1560447644, now seen corresponding path program 1 times [2023-08-04 05:29:31,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955455607] [2023-08-04 05:29:31,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:31,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:31,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:31,347 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 05:29:31,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955455607] [2023-08-04 05:29:31,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955455607] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:29:31,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366756972] [2023-08-04 05:29:31,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:31,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:29:31,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:29:31,354 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 05:29:31,376 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 05:29:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:31,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:29:31,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:29:31,481 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 05:29:31,482 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:29:31,496 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 05:29:31,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366756972] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:29:31,497 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:29:31,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:29:31,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957614888] [2023-08-04 05:29:31,497 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:29:31,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:29:31,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:31,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:29:31,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:29:31,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 252 [2023-08-04 05:29:31,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 89 flow. Second operand has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 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 05:29:31,514 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:31,514 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 252 [2023-08-04 05:29:31,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:31,532 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 05:29:31,532 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 05:29:31,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 21 events. 6/21 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 05:29:31,533 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 05:29:31,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 12 transitions, 51 flow [2023-08-04 05:29:31,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:29:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:29:31,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2023-08-04 05:29:31,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2023-08-04 05:29:31,534 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 476 transitions. [2023-08-04 05:29:31,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 476 transitions. [2023-08-04 05:29:31,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:31,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 476 transitions. [2023-08-04 05:29:31,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.0) internal successors, (476), 4 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:29:31,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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 05:29:31,538 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 252.0) internal successors, (1260), 5 states have internal predecessors, (1260), 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 05:29:31,539 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 89 flow. Second operand 4 states and 476 transitions. [2023-08-04 05:29:31,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 12 transitions, 51 flow [2023-08-04 05:29:31,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:29:31,539 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 05:29:31,539 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 05:29:31,540 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -22 predicate places. [2023-08-04 05:29:31,540 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 05:29:31,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 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 05:29:31,543 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:29:31,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:29:31,544 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:29:31,556 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 05:29:31,756 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 05:29:31,757 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:29:31,759 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:29:31,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:29:31,801 INFO L124 PetriNetUnfolderBase]: 30/461 cut-off events. [2023-08-04 05:29:31,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:31,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486 conditions, 461 events. 30/461 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2047 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:29:31,802 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:29:31,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 107 transitions, 229 flow [2023-08-04 05:29:31,804 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:29:31,804 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 107 transitions, 229 flow [2023-08-04 05:29:31,804 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 107 transitions, 229 flow [2023-08-04 05:29:31,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 229 flow [2023-08-04 05:29:31,822 INFO L124 PetriNetUnfolderBase]: 6/229 cut-off events. [2023-08-04 05:29:31,822 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:31,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 229 events. 6/229 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 691 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2023-08-04 05:29:31,825 INFO L119 LiptonReduction]: Number of co-enabled transitions 1552 [2023-08-04 05:29:34,680 INFO L134 LiptonReduction]: Checked pairs total: 2703 [2023-08-04 05:29:34,681 INFO L136 LiptonReduction]: Total number of compositions: 87 [2023-08-04 05:29:34,682 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:29:34,683 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;@5ad9a8a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:29:34,683 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:29:34,686 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:29:34,687 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 05:29:34,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:29:34,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:34,687 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:29:34,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:29:34,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:34,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1110741471, now seen corresponding path program 1 times [2023-08-04 05:29:34,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:34,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777943061] [2023-08-04 05:29:34,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:34,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:34,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:34,770 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 05:29:34,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:34,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777943061] [2023-08-04 05:29:34,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777943061] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:34,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:29:34,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:29:34,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33783070] [2023-08-04 05:29:34,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:34,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:34,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:34,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:34,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:29:34,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 223 [2023-08-04 05:29:34,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 26 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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 05:29:34,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:34,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 223 [2023-08-04 05:29:34,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:29:34,895 INFO L124 PetriNetUnfolderBase]: 523/909 cut-off events. [2023-08-04 05:29:34,895 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-04 05:29:34,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 909 events. 523/909 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3982 event pairs, 280 based on Foata normal form. 0/837 useless extension candidates. Maximal degree in co-relation 1828. Up to 848 conditions per place. [2023-08-04 05:29:34,900 INFO L140 encePairwiseOnDemand]: 220/223 looper letters, 24 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-08-04 05:29:34,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 30 transitions, 127 flow [2023-08-04 05:29:34,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:29:34,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:29:34,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-04 05:29:34,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5650224215246636 [2023-08-04 05:29:34,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-04 05:29:34,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-04 05:29:34,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:29:34,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-04 05:29:34,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 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 05:29:34,904 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 05:29:34,905 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 223.0) internal successors, (892), 4 states have internal predecessors, (892), 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 05:29:34,905 INFO L175 Difference]: Start difference. First operand has 33 places, 26 transitions, 67 flow. Second operand 3 states and 378 transitions. [2023-08-04 05:29:34,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 30 transitions, 127 flow [2023-08-04 05:29:34,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 127 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:29:34,907 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 75 flow [2023-08-04 05:29:34,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=223, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-08-04 05:29:34,908 INFO L281 CegarLoopForPetriNet]: 33 programPoint places, 3 predicate places. [2023-08-04 05:29:34,909 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 75 flow [2023-08-04 05:29:34,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 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 05:29:34,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:34,909 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:29:34,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:29:34,911 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:29:34,911 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:34,911 INFO L85 PathProgramCache]: Analyzing trace with hash -1118210826, now seen corresponding path program 1 times [2023-08-04 05:29:34,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:34,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992374522] [2023-08-04 05:29:34,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:34,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:34,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:29:34,933 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:29:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:29:34,967 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:29:34,967 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:29:34,967 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:29:34,967 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:29:34,968 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:29:34,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:29:34,968 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:29:34,969 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:29:34,969 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:29:34,969 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:29:34,999 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:29:35,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 362 flow [2023-08-04 05:29:35,134 INFO L124 PetriNetUnfolderBase]: 93/1418 cut-off events. [2023-08-04 05:29:35,134 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:29:35,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1516 conditions, 1418 events. 93/1418 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9840 event pairs, 0 based on Foata normal form. 0/1241 useless extension candidates. Maximal degree in co-relation 1023. Up to 54 conditions per place. [2023-08-04 05:29:35,140 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 163 transitions, 362 flow [2023-08-04 05:29:35,144 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 161 transitions, 350 flow [2023-08-04 05:29:35,144 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:29:35,144 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 161 transitions, 350 flow [2023-08-04 05:29:35,145 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 161 transitions, 350 flow [2023-08-04 05:29:35,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 350 flow [2023-08-04 05:29:35,272 INFO L124 PetriNetUnfolderBase]: 93/1414 cut-off events. [2023-08-04 05:29:35,272 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-04 05:29:35,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 1414 events. 93/1414 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9801 event pairs, 0 based on Foata normal form. 0/1237 useless extension candidates. Maximal degree in co-relation 1014. Up to 54 conditions per place. [2023-08-04 05:29:35,306 INFO L119 LiptonReduction]: Number of co-enabled transitions 7088 [2023-08-04 05:29:38,693 INFO L134 LiptonReduction]: Checked pairs total: 25804 [2023-08-04 05:29:38,693 INFO L136 LiptonReduction]: Total number of compositions: 122 [2023-08-04 05:29:38,695 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:29:38,696 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;@5ad9a8a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:29:38,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:29:38,699 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:29:38,699 INFO L124 PetriNetUnfolderBase]: 1/25 cut-off events. [2023-08-04 05:29:38,699 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 05:29:38,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:29:38,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:29:38,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:29:38,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:29:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash -476530355, now seen corresponding path program 1 times [2023-08-04 05:29:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:29:38,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841457798] [2023-08-04 05:29:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:29:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:29:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:29:38,750 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 05:29:38,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:29:38,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841457798] [2023-08-04 05:29:38,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841457798] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:29:38,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:29:38,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:29:38,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353733327] [2023-08-04 05:29:38,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:29:38,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:29:38,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:29:38,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:29:38,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:29:38,762 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 285 [2023-08-04 05:29:38,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 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 05:29:38,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:29:38,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 285 [2023-08-04 05:29:38,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:30:22,462 INFO L124 PetriNetUnfolderBase]: 378842/493673 cut-off events. [2023-08-04 05:30:22,462 INFO L125 PetriNetUnfolderBase]: For 5709/5709 co-relation queries the response was YES. [2023-08-04 05:30:23,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 977836 conditions, 493673 events. 378842/493673 cut-off events. For 5709/5709 co-relation queries the response was YES. Maximal size of possible extension queue 18659. Compared 3687072 event pairs, 313476 based on Foata normal form. 10836/439134 useless extension candidates. Maximal degree in co-relation 282361. Up to 476892 conditions per place. [2023-08-04 05:30:25,594 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 43 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-04 05:30:25,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 236 flow [2023-08-04 05:30:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:30:25,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:30:25,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-08-04 05:30:25,596 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5321637426900585 [2023-08-04 05:30:25,596 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-08-04 05:30:25,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-08-04 05:30:25,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:30:25,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-08-04 05:30:25,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 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 05:30:25,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 05:30:25,600 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 05:30:25,600 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 140 flow. Second operand 3 states and 455 transitions. [2023-08-04 05:30:25,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 236 flow [2023-08-04 05:30:25,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 59 transitions, 234 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 05:30:25,611 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 148 flow [2023-08-04 05:30:25,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2023-08-04 05:30:25,612 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-04 05:30:25,612 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 148 flow [2023-08-04 05:30:25,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 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 05:30:25,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:30:25,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:30:25,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:30:25,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:30:25,613 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:30:25,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1928292140, now seen corresponding path program 1 times [2023-08-04 05:30:25,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:30:25,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427170217] [2023-08-04 05:30:25,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:30:25,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:30:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:30:25,659 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 05:30:25,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:30:25,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427170217] [2023-08-04 05:30:25,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427170217] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:30:25,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542929389] [2023-08-04 05:30:25,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:30:25,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:30:25,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:30:25,662 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 05:30:25,664 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 05:30:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:30:25,752 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:30:25,753 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:30:25,760 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 05:30:25,760 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:30:25,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542929389] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:30:25,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:30:25,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:30:25,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541018422] [2023-08-04 05:30:25,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:30:25,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:30:25,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:30:25,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:30:25,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:30:25,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 285 [2023-08-04 05:30:25,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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 05:30:25,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:30:25,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 285 [2023-08-04 05:30:25,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:31:06,442 INFO L124 PetriNetUnfolderBase]: 366838/478024 cut-off events. [2023-08-04 05:31:06,442 INFO L125 PetriNetUnfolderBase]: For 4155/4155 co-relation queries the response was YES. [2023-08-04 05:31:07,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944501 conditions, 478024 events. 366838/478024 cut-off events. For 4155/4155 co-relation queries the response was YES. Maximal size of possible extension queue 18474. Compared 3542670 event pairs, 296770 based on Foata normal form. 0/418122 useless extension candidates. Maximal degree in co-relation 944462. Up to 460105 conditions per place. [2023-08-04 05:31:09,303 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 49 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-04 05:31:09,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 268 flow [2023-08-04 05:31:09,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:31:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:31:09,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-04 05:31:09,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5368421052631579 [2023-08-04 05:31:09,306 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-04 05:31:09,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-04 05:31:09,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:31:09,306 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-04 05:31:09,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 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 05:31:09,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 05:31:09,310 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 05:31:09,310 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 148 flow. Second operand 3 states and 459 transitions. [2023-08-04 05:31:09,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 268 flow [2023-08-04 05:31:09,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 65 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:31:09,312 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 158 flow [2023-08-04 05:31:09,312 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=73, PETRI_TRANSITIONS=57} [2023-08-04 05:31:09,313 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-04 05:31:09,313 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 158 flow [2023-08-04 05:31:09,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.0) internal successors, (417), 3 states have internal predecessors, (417), 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 05:31:09,313 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:31:09,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:31:09,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 05:31:09,520 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 05:31:09,520 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:31:09,521 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:31:09,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1031132156, now seen corresponding path program 1 times [2023-08-04 05:31:09,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:31:09,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506620287] [2023-08-04 05:31:09,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:31:09,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:31:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:31:09,568 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 05:31:09,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:31:09,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506620287] [2023-08-04 05:31:09,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506620287] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:31:09,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53368273] [2023-08-04 05:31:09,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:31:09,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:31:09,570 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:31:09,571 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 05:31:09,573 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 05:31:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:31:09,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:31:09,669 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:31:09,681 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 05:31:09,681 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:31:09,700 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 05:31:09,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53368273] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:31:09,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:31:09,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:31:09,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516007512] [2023-08-04 05:31:09,701 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:31:09,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:31:09,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:31:09,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:31:09,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:31:09,714 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 285 [2023-08-04 05:31:09,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 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 05:31:09,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:31:09,716 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 285 [2023-08-04 05:31:09,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:31:41,239 INFO L124 PetriNetUnfolderBase]: 286810/370186 cut-off events. [2023-08-04 05:31:41,239 INFO L125 PetriNetUnfolderBase]: For 3516/3516 co-relation queries the response was YES. [2023-08-04 05:31:42,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 732147 conditions, 370186 events. 286810/370186 cut-off events. For 3516/3516 co-relation queries the response was YES. Maximal size of possible extension queue 15206. Compared 2656950 event pairs, 216741 based on Foata normal form. 3/325500 useless extension candidates. Maximal degree in co-relation 259600. Up to 356836 conditions per place. [2023-08-04 05:31:43,352 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 47 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2023-08-04 05:31:43,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 65 transitions, 276 flow [2023-08-04 05:31:43,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:31:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:31:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 591 transitions. [2023-08-04 05:31:43,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5184210526315789 [2023-08-04 05:31:43,354 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 591 transitions. [2023-08-04 05:31:43,354 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 591 transitions. [2023-08-04 05:31:43,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:31:43,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 591 transitions. [2023-08-04 05:31:43,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.75) internal successors, (591), 4 states have internal predecessors, (591), 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 05:31:43,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 05:31:43,358 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 05:31:43,358 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 158 flow. Second operand 4 states and 591 transitions. [2023-08-04 05:31:43,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 65 transitions, 276 flow [2023-08-04 05:31:43,360 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 65 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:31:43,361 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 170 flow [2023-08-04 05:31:43,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=170, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-08-04 05:31:43,361 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2023-08-04 05:31:43,362 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 170 flow [2023-08-04 05:31:43,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.2) internal successors, (691), 5 states have internal predecessors, (691), 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 05:31:43,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:31:43,362 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:31:43,370 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 05:31:43,567 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 05:31:43,567 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:31:43,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:31:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash -646235670, now seen corresponding path program 1 times [2023-08-04 05:31:43,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:31:43,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433195696] [2023-08-04 05:31:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:31:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:31:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:31:43,638 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 05:31:43,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:31:43,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433195696] [2023-08-04 05:31:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433195696] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:31:43,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853068296] [2023-08-04 05:31:43,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:31:43,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:31:43,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:31:43,644 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 05:31:43,647 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 05:31:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:31:43,742 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:31:43,744 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:31:43,761 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 05:31:43,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:31:43,780 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 05:31:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853068296] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:31:43,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:31:43,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 05:31:43,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771379347] [2023-08-04 05:31:43,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:31:43,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:31:43,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:31:43,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:31:43,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:31:43,793 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 285 [2023-08-04 05:31:43,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 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 05:31:43,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:31:43,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 285 [2023-08-04 05:31:43,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:32:09,419 INFO L124 PetriNetUnfolderBase]: 238048/305032 cut-off events. [2023-08-04 05:32:09,420 INFO L125 PetriNetUnfolderBase]: For 2637/2637 co-relation queries the response was YES. [2023-08-04 05:32:10,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603391 conditions, 305032 events. 238048/305032 cut-off events. For 2637/2637 co-relation queries the response was YES. Maximal size of possible extension queue 13492. Compared 2088032 event pairs, 153634 based on Foata normal form. 36/269629 useless extension candidates. Maximal degree in co-relation 213586. Up to 292876 conditions per place. [2023-08-04 05:32:11,168 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 58 selfloop transitions, 3 changer transitions 1/76 dead transitions. [2023-08-04 05:32:11,168 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 332 flow [2023-08-04 05:32:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:32:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:32:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 602 transitions. [2023-08-04 05:32:11,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5280701754385965 [2023-08-04 05:32:11,170 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 602 transitions. [2023-08-04 05:32:11,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 602 transitions. [2023-08-04 05:32:11,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:32:11,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 602 transitions. [2023-08-04 05:32:11,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 150.5) internal successors, (602), 4 states have internal predecessors, (602), 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 05:32:11,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 05:32:11,173 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 285.0) internal successors, (1425), 5 states have internal predecessors, (1425), 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 05:32:11,173 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 170 flow. Second operand 4 states and 602 transitions. [2023-08-04 05:32:11,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 332 flow [2023-08-04 05:32:11,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 325 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:32:11,176 INFO L231 Difference]: Finished difference. Result has 79 places, 57 transitions, 177 flow [2023-08-04 05:32:11,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=79, PETRI_TRANSITIONS=57} [2023-08-04 05:32:11,177 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2023-08-04 05:32:11,177 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 57 transitions, 177 flow [2023-08-04 05:32:11,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 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 05:32:11,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:32:11,178 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:32:11,182 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 05:32:11,379 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 05:32:11,380 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:32:11,380 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:32:11,380 INFO L85 PathProgramCache]: Analyzing trace with hash -589787813, now seen corresponding path program 1 times [2023-08-04 05:32:11,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:32:11,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011124553] [2023-08-04 05:32:11,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:32:11,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:32:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:32:11,545 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 05:32:11,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:32:11,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011124553] [2023-08-04 05:32:11,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011124553] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:32:11,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:32:11,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:32:11,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971371905] [2023-08-04 05:32:11,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:32:11,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:32:11,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:32:11,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:32:11,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:32:11,550 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 285 [2023-08-04 05:32:11,551 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 57 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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 05:32:11,551 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:32:11,551 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 285 [2023-08-04 05:32:11,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:32:33,796 INFO L124 PetriNetUnfolderBase]: 214312/274825 cut-off events. [2023-08-04 05:32:33,796 INFO L125 PetriNetUnfolderBase]: For 3565/3565 co-relation queries the response was YES. [2023-08-04 05:32:34,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543624 conditions, 274825 events. 214312/274825 cut-off events. For 3565/3565 co-relation queries the response was YES. Maximal size of possible extension queue 12448. Compared 1890939 event pairs, 34888 based on Foata normal form. 0/246295 useless extension candidates. Maximal degree in co-relation 192480. Up to 249409 conditions per place. [2023-08-04 05:32:35,348 INFO L140 encePairwiseOnDemand]: 280/285 looper letters, 61 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-04 05:32:35,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 352 flow [2023-08-04 05:32:35,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:32:35,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:32:35,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 481 transitions. [2023-08-04 05:32:35,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625730994152047 [2023-08-04 05:32:35,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 481 transitions. [2023-08-04 05:32:35,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 481 transitions. [2023-08-04 05:32:35,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:32:35,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 481 transitions. [2023-08-04 05:32:35,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 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 05:32:35,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 05:32:35,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 05:32:35,353 INFO L175 Difference]: Start difference. First operand has 79 places, 57 transitions, 177 flow. Second operand 3 states and 481 transitions. [2023-08-04 05:32:35,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 352 flow [2023-08-04 05:32:35,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 345 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:32:35,357 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 191 flow [2023-08-04 05:32:35,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=79, PETRI_TRANSITIONS=59} [2023-08-04 05:32:35,358 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2023-08-04 05:32:35,359 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 191 flow [2023-08-04 05:32:35,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 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 05:32:35,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:32:35,359 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:32:35,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 05:32:35,361 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:32:35,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:32:35,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1102740391, now seen corresponding path program 1 times [2023-08-04 05:32:35,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:32:35,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785338329] [2023-08-04 05:32:35,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:32:35,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:32:35,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:32:35,405 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 05:32:35,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:32:35,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785338329] [2023-08-04 05:32:35,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785338329] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:32:35,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:32:35,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:32:35,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262231178] [2023-08-04 05:32:35,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:32:35,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:32:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:32:35,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:32:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:32:35,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 285 [2023-08-04 05:32:35,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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 05:32:35,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:32:35,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 285 [2023-08-04 05:32:35,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:33:00,443 INFO L124 PetriNetUnfolderBase]: 211864/270217 cut-off events. [2023-08-04 05:33:00,443 INFO L125 PetriNetUnfolderBase]: For 14128/14128 co-relation queries the response was YES. [2023-08-04 05:33:01,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564496 conditions, 270217 events. 211864/270217 cut-off events. For 14128/14128 co-relation queries the response was YES. Maximal size of possible extension queue 12374. Compared 1834325 event pairs, 174592 based on Foata normal form. 0/241975 useless extension candidates. Maximal degree in co-relation 199245. Up to 257980 conditions per place. [2023-08-04 05:33:02,264 INFO L140 encePairwiseOnDemand]: 281/285 looper letters, 59 selfloop transitions, 2 changer transitions 0/75 dead transitions. [2023-08-04 05:33:02,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 75 transitions, 348 flow [2023-08-04 05:33:02,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:33:02,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:33:02,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 467 transitions. [2023-08-04 05:33:02,266 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5461988304093567 [2023-08-04 05:33:02,266 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 467 transitions. [2023-08-04 05:33:02,266 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 467 transitions. [2023-08-04 05:33:02,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:33:02,266 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 467 transitions. [2023-08-04 05:33:02,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 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 05:33:02,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 05:33:02,268 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 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 05:33:02,268 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 191 flow. Second operand 3 states and 467 transitions. [2023-08-04 05:33:02,269 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 75 transitions, 348 flow [2023-08-04 05:33:02,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 75 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:33:02,273 INFO L231 Difference]: Finished difference. Result has 81 places, 60 transitions, 202 flow [2023-08-04 05:33:02,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=81, PETRI_TRANSITIONS=60} [2023-08-04 05:33:02,273 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2023-08-04 05:33:02,274 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 60 transitions, 202 flow [2023-08-04 05:33:02,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 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 05:33:02,274 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:33:02,274 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:33:02,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 05:33:02,274 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:33:02,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:33:02,275 INFO L85 PathProgramCache]: Analyzing trace with hash -823755463, now seen corresponding path program 1 times [2023-08-04 05:33:02,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:33:02,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937948823] [2023-08-04 05:33:02,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:33:02,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:33:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:33:02,308 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:33:02,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:33:02,328 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:33:02,328 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:33:02,329 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:33:02,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:33:02,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:33:02,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:33:02,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 05:33:02,329 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:33:02,330 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:33:02,331 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:33:02,331 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:33:02,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:33:02 BasicIcfg [2023-08-04 05:33:02,397 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:33:02,397 INFO L158 Benchmark]: Toolchain (without parser) took 218373.92ms. Allocated memory was 343.9MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 290.2MB in the beginning and 13.5GB in the end (delta: -13.2GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-04 05:33:02,397 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 343.9MB. Free memory was 297.5MB in the beginning and 297.4MB in the end (delta: 64.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:33:02,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 541.77ms. Allocated memory is still 343.9MB. Free memory was 289.8MB in the beginning and 265.4MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:33:02,398 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.57ms. Allocated memory is still 343.9MB. Free memory was 265.4MB in the beginning and 262.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:33:02,398 INFO L158 Benchmark]: Boogie Preprocessor took 34.25ms. Allocated memory is still 343.9MB. Free memory was 262.5MB in the beginning and 260.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:33:02,398 INFO L158 Benchmark]: RCFGBuilder took 652.39ms. Allocated memory was 343.9MB in the beginning and 480.2MB in the end (delta: 136.3MB). Free memory was 260.4MB in the beginning and 413.1MB in the end (delta: -152.6MB). Peak memory consumption was 13.9MB. Max. memory is 16.0GB. [2023-08-04 05:33:02,398 INFO L158 Benchmark]: TraceAbstraction took 217088.48ms. Allocated memory was 480.2MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 412.5MB in the beginning and 13.5GB in the end (delta: -13.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. [2023-08-04 05:33:02,399 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.12ms. Allocated memory is still 343.9MB. Free memory was 297.5MB in the beginning and 297.4MB in the end (delta: 64.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 541.77ms. Allocated memory is still 343.9MB. Free memory was 289.8MB in the beginning and 265.4MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 51.57ms. Allocated memory is still 343.9MB. Free memory was 265.4MB in the beginning and 262.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.25ms. Allocated memory is still 343.9MB. Free memory was 262.5MB in the beginning and 260.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 652.39ms. Allocated memory was 343.9MB in the beginning and 480.2MB in the end (delta: 136.3MB). Free memory was 260.4MB in the beginning and 413.1MB in the end (delta: -152.6MB). Peak memory consumption was 13.9MB. Max. memory is 16.0GB. * TraceAbstraction took 217088.48ms. Allocated memory was 480.2MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 412.5MB in the beginning and 13.5GB in the end (delta: -13.0GB). Peak memory consumption was 2.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 136 PlacesBefore, 40 PlacesAfterwards, 134 TransitionsBefore, 34 TransitionsAfterwards, 2898 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 116 TotalNumberOfCompositions, 7377 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2897, independent: 2695, independent conditional: 0, independent unconditional: 2695, dependent: 202, dependent conditional: 0, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1463, independent: 1427, independent conditional: 0, independent unconditional: 1427, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2897, independent: 1268, independent conditional: 0, independent unconditional: 1268, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 1463, unknown conditional: 0, unknown unconditional: 1463] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 112 PlacesBefore, 33 PlacesAfterwards, 107 TransitionsBefore, 26 TransitionsAfterwards, 1552 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 87 TotalNumberOfCompositions, 2703 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1859, independent: 1757, independent conditional: 0, independent unconditional: 1757, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 838, independent: 823, independent conditional: 0, independent unconditional: 823, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1859, independent: 934, independent conditional: 0, independent unconditional: 934, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 838, unknown conditional: 0, unknown unconditional: 838] , Statistics on independence cache: Total cache size (in pairs): 95, Positive cache size: 88, Positive conditional cache size: 0, Positive unconditional cache size: 88, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 169 PlacesBefore, 68 PlacesAfterwards, 161 TransitionsBefore, 56 TransitionsAfterwards, 7088 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 122 TotalNumberOfCompositions, 25804 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9198, independent: 8793, independent conditional: 0, independent unconditional: 8793, dependent: 405, dependent conditional: 0, dependent unconditional: 405, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3504, independent: 3449, independent conditional: 0, independent unconditional: 3449, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9198, independent: 5344, independent conditional: 0, independent unconditional: 5344, dependent: 350, dependent conditional: 0, dependent unconditional: 350, unknown: 3504, unknown conditional: 0, unknown unconditional: 3504] , Statistics on independence cache: Total cache size (in pairs): 450, Positive cache size: 423, Positive conditional cache size: 0, Positive unconditional cache size: 423, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: 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; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool main$tmp_guard0; [L725] 0 _Bool main$tmp_guard1; [L727] 0 int x = 0; [L729] 0 int y = 0; [L731] 0 int z = 0; [L732] 0 _Bool z$flush_delayed; [L733] 0 int z$mem_tmp; [L734] 0 _Bool z$r_buff0_thd0; [L735] 0 _Bool z$r_buff0_thd1; [L736] 0 _Bool z$r_buff0_thd2; [L737] 0 _Bool z$r_buff0_thd3; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$read_delayed; [L743] 0 int *z$read_delayed_var; [L744] 0 int z$w_buff0; [L745] 0 _Bool z$w_buff0_used; [L746] 0 int z$w_buff1; [L747] 0 _Bool z$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L858] 0 pthread_t t41[2]; [L859] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t41={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L859] COND TRUE 0 asdf<2 [L859] FCALL, FORK 0 pthread_create(&t41[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41[asdf], ((void *)0), P0, ((void *)0))=-1, t41={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L859] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t41={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L859] COND TRUE 0 asdf<2 [L859] FCALL, FORK 0 pthread_create(&t41[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t41[asdf], ((void *)0), P0, ((void *)0))=0, t41={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L859] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t41={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L859] COND FALSE 0 !(asdf<2) [L860] 0 pthread_t t42[2]; [L861] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t41={6:0}, t42={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L861] COND TRUE 0 asdf<2 [L861] FCALL, FORK 0 pthread_create(&t42[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42[asdf], ((void *)0), P1, ((void *)0))=1, t41={6:0}, t42={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L861] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t41={6:0}, t42={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L861] COND TRUE 0 asdf<2 [L861] FCALL, FORK 0 pthread_create(&t42[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t42[asdf], ((void *)0), P1, ((void *)0))=2, t41={6:0}, t42={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L861] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t41={6:0}, t42={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L861] COND FALSE 0 !(asdf<2) [L862] 0 pthread_t t43[2]; [L863] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t41={6:0}, t42={7:0}, t43={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L863] COND TRUE 0 asdf<2 [L863] FCALL, FORK 0 pthread_create(&t43[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43[asdf], ((void *)0), P2, ((void *)0))=3, t41={6:0}, t42={7:0}, t43={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 5 z$w_buff1 = z$w_buff0 [L806] 5 z$w_buff0 = 1 [L807] 5 z$w_buff1_used = z$w_buff0_used [L808] 5 z$w_buff0_used = (_Bool)1 [L809] CALL 5 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L809] RET 5 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L810] 5 z$r_buff1_thd0 = z$r_buff0_thd0 [L811] 5 z$r_buff1_thd1 = z$r_buff0_thd1 [L812] 5 z$r_buff1_thd2 = z$r_buff0_thd2 [L813] 5 z$r_buff1_thd3 = z$r_buff0_thd3 [L814] 5 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L863] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t41={6:0}, t42={7:0}, t43={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L863] COND TRUE 0 asdf<2 [L863] FCALL, FORK 0 pthread_create(&t43[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t43[asdf], ((void *)0), P2, ((void *)0))=4, t41={6:0}, t42={7:0}, t43={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L805] 6 z$w_buff1 = z$w_buff0 [L806] 6 z$w_buff0 = 1 [L807] 6 z$w_buff1_used = z$w_buff0_used [L808] 6 z$w_buff0_used = (_Bool)1 [L809] CALL 6 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=1, z$w_buff1_used=1, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 159 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 67 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 35 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 7 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred 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, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 0 NumberOfNonLiveVariables, 373 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 10 procedures, 186 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 207.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 202.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 155 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 107 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 610 IncrementalHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 4 mSDtfsCounter, 610 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=202occurred in iteration=6, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 591 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 46/53 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 7 procedures, 159 locations, 6 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.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 53 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=75occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 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 05:33:02,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...