/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_mix032.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:58:37,887 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:58:37,966 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:58:37,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:58:37,972 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:58:37,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:58:37,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:58:37,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:58:37,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:58:37,994 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:58:37,995 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:58:37,995 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:58:37,995 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:58:38,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:58:38,009 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:58:38,009 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:58:38,009 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:58:38,010 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:58:38,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:58:38,010 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:58:38,010 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:58:38,011 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:58:38,011 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:58:38,011 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:58:38,011 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:58:38,011 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:58:38,011 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:58:38,012 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:58:38,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:58:38,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:58:38,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:58:38,012 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:58:38,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:58:38,013 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:58:38,013 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:58:38,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:58:38,013 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:58:38,013 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:58:38,013 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:58:38,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:58:38,014 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:58:38,017 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:58:38,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:58:38,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:58:38,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:58:38,240 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:58:38,241 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:58:38,242 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix032.opt_bound2.i [2023-08-04 05:58:39,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:58:39,483 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:58:39,484 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix032.opt_bound2.i [2023-08-04 05:58:39,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfdd4589/2b42dc41a5ce4b2b80aeb2fa768dbaba/FLAG887621b44 [2023-08-04 05:58:39,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dfdd4589/2b42dc41a5ce4b2b80aeb2fa768dbaba [2023-08-04 05:58:39,521 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:58:39,522 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:58:39,523 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:58:39,523 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:58:39,534 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:58:39,534 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,535 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bbedac9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39, skipping insertion in model container [2023-08-04 05:58:39,535 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,589 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:58:39,707 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_mix032.opt_bound2.i[944,957] [2023-08-04 05:58:39,804 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:58:39,810 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:58:39,818 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_mix032.opt_bound2.i[944,957] [2023-08-04 05:58:39,824 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:58:39,825 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:58:39,848 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:58:39,868 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:58:39,868 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:58:39,873 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:58:39,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39 WrapperNode [2023-08-04 05:58:39,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:58:39,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:58:39,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:58:39,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:58:39,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,890 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:58:39" (1/1) ... [2023-08-04 05:58:39,908 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 163 [2023-08-04 05:58:39,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:58:39,909 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:58:39,909 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:58:39,909 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:58:39,915 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,915 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,918 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,918 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,924 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,928 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,929 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,932 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:58:39,932 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:58:39,932 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:58:39,932 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:58:39,933 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (1/1) ... [2023-08-04 05:58:39,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:58:39,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:58:39,994 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:58:40,000 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:58:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:58:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:58:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:58:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:58:40,021 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:58:40,022 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:58:40,022 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:58:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:58:40,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:58:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:58:40,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:58:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:58:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:58:40,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:58:40,023 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:58:40,024 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:58:40,142 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:58:40,144 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:58:40,415 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:58:40,523 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:58:40,523 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:58:40,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:58:40 BoogieIcfgContainer [2023-08-04 05:58:40,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:58:40,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:58:40,528 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:58:40,531 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:58:40,531 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:58:39" (1/3) ... [2023-08-04 05:58:40,533 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c47acc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:58:40, skipping insertion in model container [2023-08-04 05:58:40,533 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:58:39" (2/3) ... [2023-08-04 05:58:40,534 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c47acc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:58:40, skipping insertion in model container [2023-08-04 05:58:40,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:58:40" (3/3) ... [2023-08-04 05:58:40,535 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix032.opt_bound2.i [2023-08-04 05:58:40,542 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:58:40,550 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:58:40,550 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:58:40,550 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:58:40,601 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:58:40,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:58:40,784 INFO L124 PetriNetUnfolderBase]: 30/465 cut-off events. [2023-08-04 05:58:40,784 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:40,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 465 events. 30/465 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2079 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:58:40,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:58:40,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 134 transitions, 279 flow [2023-08-04 05:58:40,814 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:58:40,830 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 134 transitions, 279 flow [2023-08-04 05:58:40,834 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 134 transitions, 279 flow [2023-08-04 05:58:40,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 279 flow [2023-08-04 05:58:40,900 INFO L124 PetriNetUnfolderBase]: 30/462 cut-off events. [2023-08-04 05:58:40,900 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:40,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 462 events. 30/462 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2049 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 268. Up to 16 conditions per place. [2023-08-04 05:58:40,908 INFO L119 LiptonReduction]: Number of co-enabled transitions 2808 [2023-08-04 05:58:44,042 INFO L134 LiptonReduction]: Checked pairs total: 6738 [2023-08-04 05:58:44,042 INFO L136 LiptonReduction]: Total number of compositions: 116 [2023-08-04 05:58:44,053 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:58:44,058 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;@89b1b8c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:58:44,058 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:58:44,062 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:58:44,062 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2023-08-04 05:58:44,062 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:44,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:44,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:58:44,063 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:58:44,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:44,071 INFO L85 PathProgramCache]: Analyzing trace with hash -404116022, now seen corresponding path program 1 times [2023-08-04 05:58:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:44,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621652175] [2023-08-04 05:58:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:44,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:44,276 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:58:44,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:44,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621652175] [2023-08-04 05:58:44,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621652175] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:44,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:44,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:58:44,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546019759] [2023-08-04 05:58:44,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:44,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:44,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:44,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:44,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 252 [2023-08-04 05:58:44,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 77 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:58:44,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:44,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 252 [2023-08-04 05:58:44,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:44,555 INFO L124 PetriNetUnfolderBase]: 1828/2953 cut-off events. [2023-08-04 05:58:44,555 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 05:58:44,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5843 conditions, 2953 events. 1828/2953 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 16755 event pairs, 1176 based on Foata normal form. 105/2539 useless extension candidates. Maximal degree in co-relation 5830. Up to 2807 conditions per place. [2023-08-04 05:58:44,570 INFO L140 encePairwiseOnDemand]: 248/252 looper letters, 28 selfloop transitions, 2 changer transitions 1/35 dead transitions. [2023-08-04 05:58:44,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 143 flow [2023-08-04 05:58:44,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:44,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:44,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-04 05:58:44,588 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5119047619047619 [2023-08-04 05:58:44,588 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-04 05:58:44,589 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-04 05:58:44,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:44,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-04 05:58:44,597 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 states have internal predecessors, (387), 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:58:44,601 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:58:44,601 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:58:44,603 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 77 flow. Second operand 3 states and 387 transitions. [2023-08-04 05:58:44,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 143 flow [2023-08-04 05:58:44,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:58:44,608 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 83 flow [2023-08-04 05:58:44,609 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-04 05:58:44,612 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-04 05:58:44,612 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 83 flow [2023-08-04 05:58:44,612 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:58:44,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:44,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:58:44,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:58:44,613 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:58:44,617 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:44,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1523210602, now seen corresponding path program 1 times [2023-08-04 05:58:44,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:44,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403566576] [2023-08-04 05:58:44,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:44,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:44,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:44,717 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:58:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:44,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403566576] [2023-08-04 05:58:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403566576] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:58:44,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484695404] [2023-08-04 05:58:44,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:44,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:58:44,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:58:44,740 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:58:44,741 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:58:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:44,813 INFO L262 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:58:44,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:58:44,825 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:58:44,825 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:58:44,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484695404] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:44,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:58:44,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:58:44,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637251626] [2023-08-04 05:58:44,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:44,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:44,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:44,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:44,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:58:44,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 252 [2023-08-04 05:58:44,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:58:44,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:44,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 252 [2023-08-04 05:58:44,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:45,075 INFO L124 PetriNetUnfolderBase]: 1584/2505 cut-off events. [2023-08-04 05:58:45,075 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 05:58:45,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4971 conditions, 2505 events. 1584/2505 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 13487 event pairs, 1374 based on Foata normal form. 0/2108 useless extension candidates. Maximal degree in co-relation 4955. Up to 2352 conditions per place. [2023-08-04 05:58:45,084 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 31 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2023-08-04 05:58:45,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 163 flow [2023-08-04 05:58:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-08-04 05:58:45,085 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145502645502645 [2023-08-04 05:58:45,086 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-08-04 05:58:45,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-08-04 05:58:45,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:45,086 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-08-04 05:58:45,087 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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:58:45,088 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:58:45,088 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:58:45,088 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 83 flow. Second operand 3 states and 389 transitions. [2023-08-04 05:58:45,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 163 flow [2023-08-04 05:58:45,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:58:45,089 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 87 flow [2023-08-04 05:58:45,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-04 05:58:45,090 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-04 05:58:45,090 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 87 flow [2023-08-04 05:58:45,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:58:45,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:45,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:58:45,111 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 05:58:45,295 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:58:45,295 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:58:45,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:45,296 INFO L85 PathProgramCache]: Analyzing trace with hash -982951942, now seen corresponding path program 1 times [2023-08-04 05:58:45,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:45,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135715826] [2023-08-04 05:58:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:58:45,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:45,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135715826] [2023-08-04 05:58:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135715826] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:58:45,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013436648] [2023-08-04 05:58:45,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:45,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:58:45,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:58:45,388 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:58:45,391 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:58:45,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:45,469 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:58:45,470 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:58:45,490 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:58:45,490 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:58:45,502 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:58:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013436648] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:58:45,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:58:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:58:45,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137322932] [2023-08-04 05:58:45,503 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:58:45,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:58:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:58:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:58:45,515 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 252 [2023-08-04 05:58:45,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 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:58:45,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:45,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 252 [2023-08-04 05:58:45,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:45,528 INFO L124 PetriNetUnfolderBase]: 4/16 cut-off events. [2023-08-04 05:58:45,529 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:58:45,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44 conditions, 16 events. 4/16 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 19 event pairs, 0 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 36. Up to 10 conditions per place. [2023-08-04 05:58:45,529 INFO L140 encePairwiseOnDemand]: 249/252 looper letters, 0 selfloop transitions, 0 changer transitions 10/10 dead transitions. [2023-08-04 05:58:45,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 18 places, 10 transitions, 43 flow [2023-08-04 05:58:45,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:58:45,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:58:45,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2023-08-04 05:58:45,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742063492063492 [2023-08-04 05:58:45,530 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2023-08-04 05:58:45,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2023-08-04 05:58:45,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:45,531 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2023-08-04 05:58:45,532 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 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:58:45,533 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:58:45,533 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:58:45,533 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 87 flow. Second operand 4 states and 478 transitions. [2023-08-04 05:58:45,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 18 places, 10 transitions, 43 flow [2023-08-04 05:58:45,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 17 places, 10 transitions, 41 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:58:45,534 INFO L231 Difference]: Finished difference. Result has 17 places, 0 transitions, 0 flow [2023-08-04 05:58:45,534 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=252, PETRI_DIFFERENCE_MINUEND_FLOW=17, PETRI_DIFFERENCE_MINUEND_PLACES=14, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=7, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=7, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=17, PETRI_TRANSITIONS=0} [2023-08-04 05:58:45,535 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -22 predicate places. [2023-08-04 05:58:45,535 INFO L495 AbstractCegarLoop]: Abstraction has has 17 places, 0 transitions, 0 flow [2023-08-04 05:58:45,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.2) internal successors, (601), 5 states have internal predecessors, (601), 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:58:45,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:58:45,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:58:45,537 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:58:45,547 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:58:45,743 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:58:45,743 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:58:45,746 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:58:45,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:58:45,773 INFO L124 PetriNetUnfolderBase]: 30/465 cut-off events. [2023-08-04 05:58:45,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:45,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490 conditions, 465 events. 30/465 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2079 event pairs, 0 based on Foata normal form. 0/409 useless extension candidates. Maximal degree in co-relation 274. Up to 16 conditions per place. [2023-08-04 05:58:45,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:58:45,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 107 transitions, 229 flow [2023-08-04 05:58:45,775 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:58:45,775 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 107 transitions, 229 flow [2023-08-04 05:58:45,775 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 107 transitions, 229 flow [2023-08-04 05:58:45,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 229 flow [2023-08-04 05:58:45,786 INFO L124 PetriNetUnfolderBase]: 6/233 cut-off events. [2023-08-04 05:58:45,787 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:45,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 233 events. 6/233 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 700 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 158. Up to 8 conditions per place. [2023-08-04 05:58:45,788 INFO L119 LiptonReduction]: Number of co-enabled transitions 1456 [2023-08-04 05:58:48,629 INFO L134 LiptonReduction]: Checked pairs total: 2852 [2023-08-04 05:58:48,629 INFO L136 LiptonReduction]: Total number of compositions: 88 [2023-08-04 05:58:48,631 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:58:48,631 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;@89b1b8c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:58:48,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:58:48,634 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:58:48,634 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 05:58:48,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:48,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:48,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:58:48,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:58:48,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:48,635 INFO L85 PathProgramCache]: Analyzing trace with hash -2086968583, now seen corresponding path program 1 times [2023-08-04 05:58:48,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:48,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083805464] [2023-08-04 05:58:48,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:48,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:48,673 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:58:48,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:48,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083805464] [2023-08-04 05:58:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083805464] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:48,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:58:48,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522131432] [2023-08-04 05:58:48,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:48,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:48,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:48,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:48,688 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 224 [2023-08-04 05:58:48,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 65 flow. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:58:48,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:48,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 224 [2023-08-04 05:58:48,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:58:48,752 INFO L124 PetriNetUnfolderBase]: 319/574 cut-off events. [2023-08-04 05:58:48,752 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 05:58:48,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1184 conditions, 574 events. 319/574 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2585 event pairs, 177 based on Foata normal form. 0/517 useless extension candidates. Maximal degree in co-relation 1165. Up to 533 conditions per place. [2023-08-04 05:58:48,755 INFO L140 encePairwiseOnDemand]: 221/224 looper letters, 21 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2023-08-04 05:58:48,755 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 28 transitions, 117 flow [2023-08-04 05:58:48,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:58:48,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:58:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-04 05:58:48,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5625 [2023-08-04 05:58:48,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-04 05:58:48,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-04 05:58:48,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:58:48,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-04 05:58:48,758 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:58:48,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 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:58:48,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 224.0) internal successors, (896), 4 states have internal predecessors, (896), 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:58:48,760 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 65 flow. Second operand 3 states and 378 transitions. [2023-08-04 05:58:48,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 28 transitions, 117 flow [2023-08-04 05:58:48,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 28 transitions, 117 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:58:48,762 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 73 flow [2023-08-04 05:58:48,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=224, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-08-04 05:58:48,763 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-04 05:58:48,764 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 73 flow [2023-08-04 05:58:48,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 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:58:48,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:48,764 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:58:48,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:58:48,764 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:58:48,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:48,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2082548074, now seen corresponding path program 1 times [2023-08-04 05:58:48,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:48,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565041523] [2023-08-04 05:58:48,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:48,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:48,784 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:58:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:58:48,812 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:58:48,812 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:58:48,812 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:58:48,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:58:48,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:58:48,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:58:48,813 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:58:48,814 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:58:48,814 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:58:48,814 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:58:48,840 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:58:48,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 362 flow [2023-08-04 05:58:48,973 INFO L124 PetriNetUnfolderBase]: 93/1438 cut-off events. [2023-08-04 05:58:48,974 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:58:48,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1536 conditions, 1438 events. 93/1438 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10070 event pairs, 0 based on Foata normal form. 0/1261 useless extension candidates. Maximal degree in co-relation 1034. Up to 54 conditions per place. [2023-08-04 05:58:48,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 163 transitions, 362 flow [2023-08-04 05:58:48,982 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 161 transitions, 350 flow [2023-08-04 05:58:48,982 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:58:48,983 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 161 transitions, 350 flow [2023-08-04 05:58:48,983 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 161 transitions, 350 flow [2023-08-04 05:58:48,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 161 transitions, 350 flow [2023-08-04 05:58:49,082 INFO L124 PetriNetUnfolderBase]: 93/1434 cut-off events. [2023-08-04 05:58:49,083 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-04 05:58:49,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1524 conditions, 1434 events. 93/1434 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 10028 event pairs, 0 based on Foata normal form. 0/1257 useless extension candidates. Maximal degree in co-relation 1025. Up to 54 conditions per place. [2023-08-04 05:58:49,134 INFO L119 LiptonReduction]: Number of co-enabled transitions 6896 [2023-08-04 05:58:52,072 INFO L134 LiptonReduction]: Checked pairs total: 22648 [2023-08-04 05:58:52,072 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-04 05:58:52,079 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:58:52,081 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;@89b1b8c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:58:52,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:58:52,083 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:58:52,083 INFO L124 PetriNetUnfolderBase]: 1/22 cut-off events. [2023-08-04 05:58:52,084 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:58:52,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:58:52,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:58:52,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:58:52,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:58:52,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1512893153, now seen corresponding path program 1 times [2023-08-04 05:58:52,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:58:52,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596264702] [2023-08-04 05:58:52,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:58:52,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:58:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:58:52,120 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:58:52,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:58:52,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596264702] [2023-08-04 05:58:52,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596264702] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:58:52,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:58:52,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:58:52,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608295446] [2023-08-04 05:58:52,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:58:52,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:58:52,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:58:52,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:58:52,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:58:52,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 283 [2023-08-04 05:58:52,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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:58:52,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:58:52,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 283 [2023-08-04 05:58:52,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:59:24,076 INFO L124 PetriNetUnfolderBase]: 267242/367215 cut-off events. [2023-08-04 05:59:24,076 INFO L125 PetriNetUnfolderBase]: For 4749/4749 co-relation queries the response was YES. [2023-08-04 05:59:25,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 711398 conditions, 367215 events. 267242/367215 cut-off events. For 4749/4749 co-relation queries the response was YES. Maximal size of possible extension queue 12179. Compared 2918053 event pairs, 220020 based on Foata normal form. 7812/319575 useless extension candidates. Maximal degree in co-relation 205645. Up to 338076 conditions per place. [2023-08-04 05:59:26,535 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 41 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-04 05:59:26,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 59 transitions, 232 flow [2023-08-04 05:59:26,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:59:26,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:59:26,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 459 transitions. [2023-08-04 05:59:26,538 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5406360424028268 [2023-08-04 05:59:26,538 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 459 transitions. [2023-08-04 05:59:26,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 459 transitions. [2023-08-04 05:59:26,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:59:26,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 459 transitions. [2023-08-04 05:59:26,539 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:59:26,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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:59:26,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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:59:26,541 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 140 flow. Second operand 3 states and 459 transitions. [2023-08-04 05:59:26,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 59 transitions, 232 flow [2023-08-04 05:59:26,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 59 transitions, 230 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 05:59:26,551 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 148 flow [2023-08-04 05:59:26,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, 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:59:26,552 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2023-08-04 05:59:26,552 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 148 flow [2023-08-04 05:59:26,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 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:59:26,552 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:59:26,552 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:59:26,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:59:26,553 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:59:26,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:59:26,553 INFO L85 PathProgramCache]: Analyzing trace with hash 907526259, now seen corresponding path program 1 times [2023-08-04 05:59:26,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:59:26,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947692071] [2023-08-04 05:59:26,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:59:26,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:59:26,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:59:26,584 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:59:26,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:59:26,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947692071] [2023-08-04 05:59:26,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947692071] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:59:26,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777367453] [2023-08-04 05:59:26,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:59:26,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:59:26,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:59:26,586 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:59:26,588 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:59:26,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:59:26,663 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:59:26,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:59:26,669 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:59:26,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:59:26,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777367453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:59:26,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:59:26,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:59:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095765970] [2023-08-04 05:59:26,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:59:26,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:59:26,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:59:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:59:26,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:59:26,678 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 283 [2023-08-04 05:59:26,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 56 transitions, 148 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:59:26,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:59:26,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 283 [2023-08-04 05:59:26,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:59:56,047 INFO L124 PetriNetUnfolderBase]: 258886/359236 cut-off events. [2023-08-04 05:59:56,047 INFO L125 PetriNetUnfolderBase]: For 3435/3435 co-relation queries the response was YES. [2023-08-04 05:59:56,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 690881 conditions, 359236 events. 258886/359236 cut-off events. For 3435/3435 co-relation queries the response was YES. Maximal size of possible extension queue 12282. Compared 2923996 event pairs, 208258 based on Foata normal form. 0/308884 useless extension candidates. Maximal degree in co-relation 690844. Up to 326233 conditions per place. [2023-08-04 05:59:58,202 INFO L140 encePairwiseOnDemand]: 280/283 looper letters, 47 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-04 05:59:58,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 65 transitions, 264 flow [2023-08-04 05:59:58,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:59:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:59:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 463 transitions. [2023-08-04 05:59:58,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5453474676089517 [2023-08-04 05:59:58,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 463 transitions. [2023-08-04 05:59:58,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 463 transitions. [2023-08-04 05:59:58,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:59:58,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 463 transitions. [2023-08-04 05:59:58,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.33333333333334) internal successors, (463), 3 states have internal predecessors, (463), 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:59:58,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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:59:58,210 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 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:59:58,210 INFO L175 Difference]: Start difference. First operand has 71 places, 56 transitions, 148 flow. Second operand 3 states and 463 transitions. [2023-08-04 05:59:58,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 65 transitions, 264 flow [2023-08-04 05:59:58,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 65 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:59:58,214 INFO L231 Difference]: Finished difference. Result has 73 places, 57 transitions, 158 flow [2023-08-04 05:59:58,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, 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:59:58,215 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 5 predicate places. [2023-08-04 05:59:58,215 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 57 transitions, 158 flow [2023-08-04 05:59:58,215 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:59:58,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:59:58,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:59:58,231 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:59:58,421 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:59:58,421 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:59:58,422 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:59:58,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1779606364, now seen corresponding path program 1 times [2023-08-04 05:59:58,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:59:58,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822674487] [2023-08-04 05:59:58,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:59:58,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:59:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:59:58,470 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:59:58,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:59:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822674487] [2023-08-04 05:59:58,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822674487] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:59:58,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [767216631] [2023-08-04 05:59:58,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:59:58,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:59:58,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:59:58,481 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:59:58,482 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:59:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:59:58,564 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:59:58,564 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:59:58,575 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:59:58,575 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:59:58,586 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:59:58,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [767216631] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:59:58,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:59:58,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:59:58,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533235001] [2023-08-04 05:59:58,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:59:58,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:59:58,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:59:58,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:59:58,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:59:58,598 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 283 [2023-08-04 05:59:58,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 57 transitions, 158 flow. Second operand has 5 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 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:59:58,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:59:58,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 283 [2023-08-04 05:59:58,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:23,138 INFO L124 PetriNetUnfolderBase]: 202606/277733 cut-off events. [2023-08-04 06:00:23,139 INFO L125 PetriNetUnfolderBase]: For 3051/3051 co-relation queries the response was YES. [2023-08-04 06:00:24,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535330 conditions, 277733 events. 202606/277733 cut-off events. For 3051/3051 co-relation queries the response was YES. Maximal size of possible extension queue 9710. Compared 2139751 event pairs, 135114 based on Foata normal form. 3/240062 useless extension candidates. Maximal degree in co-relation 189673. Up to 253192 conditions per place. [2023-08-04 06:00:24,999 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 45 selfloop transitions, 3 changer transitions 1/65 dead transitions. [2023-08-04 06:00:24,999 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 65 transitions, 272 flow [2023-08-04 06:00:25,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:00:25,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:00:25,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 597 transitions. [2023-08-04 06:00:25,001 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5273851590106007 [2023-08-04 06:00:25,001 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 597 transitions. [2023-08-04 06:00:25,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 597 transitions. [2023-08-04 06:00:25,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:25,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 597 transitions. [2023-08-04 06:00:25,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.25) internal successors, (597), 4 states have internal predecessors, (597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:25,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:25,004 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:25,004 INFO L175 Difference]: Start difference. First operand has 73 places, 57 transitions, 158 flow. Second operand 4 states and 597 transitions. [2023-08-04 06:00:25,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 65 transitions, 272 flow [2023-08-04 06:00:25,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 65 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:00:25,009 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 170 flow [2023-08-04 06:00:25,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, 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 06:00:25,010 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 9 predicate places. [2023-08-04 06:00:25,010 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 170 flow [2023-08-04 06:00:25,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.2) internal successors, (701), 5 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:25,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:25,011 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:00:25,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 06:00:25,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:00:25,212 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:00:25,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:25,213 INFO L85 PathProgramCache]: Analyzing trace with hash -626892785, now seen corresponding path program 1 times [2023-08-04 06:00:25,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:25,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881234617] [2023-08-04 06:00:25,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:25,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:25,253 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:00:25,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:25,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881234617] [2023-08-04 06:00:25,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881234617] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 06:00:25,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317612611] [2023-08-04 06:00:25,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:25,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:00:25,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 06:00:25,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 06:00:25,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 06:00:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:25,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 06:00:25,355 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 06:00:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:00:25,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 06:00:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 06:00:25,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317612611] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 06:00:25,385 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 06:00:25,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 06:00:25,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293492827] [2023-08-04 06:00:25,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 06:00:25,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 06:00:25,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:25,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 06:00:25,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 06:00:25,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 283 [2023-08-04 06:00:25,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 170 flow. Second operand has 5 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:25,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:25,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 283 [2023-08-04 06:00:25,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:00:44,523 INFO L124 PetriNetUnfolderBase]: 168352/228226 cut-off events. [2023-08-04 06:00:44,523 INFO L125 PetriNetUnfolderBase]: For 2430/2430 co-relation queries the response was YES. [2023-08-04 06:00:45,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 440761 conditions, 228226 events. 168352/228226 cut-off events. For 2430/2430 co-relation queries the response was YES. Maximal size of possible extension queue 8596. Compared 1698843 event pairs, 127372 based on Foata normal form. 36/198220 useless extension candidates. Maximal degree in co-relation 155920. Up to 207628 conditions per place. [2023-08-04 06:00:46,057 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 56 selfloop transitions, 3 changer transitions 1/76 dead transitions. [2023-08-04 06:00:46,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 328 flow [2023-08-04 06:00:46,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 06:00:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 06:00:46,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 608 transitions. [2023-08-04 06:00:46,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5371024734982333 [2023-08-04 06:00:46,060 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 608 transitions. [2023-08-04 06:00:46,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 608 transitions. [2023-08-04 06:00:46,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:00:46,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 608 transitions. [2023-08-04 06:00:46,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 152.0) internal successors, (608), 4 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:46,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:46,077 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 283.0) internal successors, (1415), 5 states have internal predecessors, (1415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:46,077 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 170 flow. Second operand 4 states and 608 transitions. [2023-08-04 06:00:46,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 328 flow [2023-08-04 06:00:46,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 76 transitions, 321 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:00:46,079 INFO L231 Difference]: Finished difference. Result has 79 places, 57 transitions, 177 flow [2023-08-04 06:00:46,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, 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 06:00:46,083 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2023-08-04 06:00:46,083 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 57 transitions, 177 flow [2023-08-04 06:00:46,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:46,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:00:46,084 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:00:46,089 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 06:00:46,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 06:00:46,290 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:00:46,290 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:00:46,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1213050823, now seen corresponding path program 1 times [2023-08-04 06:00:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:00:46,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022815670] [2023-08-04 06:00:46,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:00:46,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:00:46,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:00:46,445 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 06:00:46,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:00:46,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022815670] [2023-08-04 06:00:46,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022815670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:00:46,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:00:46,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 06:00:46,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935180238] [2023-08-04 06:00:46,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:00:46,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:00:46,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:00:46,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:00:46,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:00:46,451 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 283 [2023-08-04 06:00:46,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 57 transitions, 177 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:00:46,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:00:46,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 283 [2023-08-04 06:00:46,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:01:02,321 INFO L124 PetriNetUnfolderBase]: 144616/199954 cut-off events. [2023-08-04 06:01:02,321 INFO L125 PetriNetUnfolderBase]: For 3205/3205 co-relation queries the response was YES. [2023-08-04 06:01:03,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 383073 conditions, 199954 events. 144616/199954 cut-off events. For 3205/3205 co-relation queries the response was YES. Maximal size of possible extension queue 7430. Compared 1520554 event pairs, 24520 based on Foata normal form. 0/175231 useless extension candidates. Maximal degree in co-relation 135507. Up to 164161 conditions per place. [2023-08-04 06:01:03,924 INFO L140 encePairwiseOnDemand]: 278/283 looper letters, 59 selfloop transitions, 3 changer transitions 0/78 dead transitions. [2023-08-04 06:01:03,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 78 transitions, 348 flow [2023-08-04 06:01:03,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:01:03,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:01:03,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-08-04 06:01:03,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5712603062426383 [2023-08-04 06:01:03,926 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-08-04 06:01:03,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-08-04 06:01:03,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:01:03,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-08-04 06:01:03,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:03,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:03,928 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:03,929 INFO L175 Difference]: Start difference. First operand has 79 places, 57 transitions, 177 flow. Second operand 3 states and 485 transitions. [2023-08-04 06:01:03,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 78 transitions, 348 flow [2023-08-04 06:01:03,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 78 transitions, 341 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 06:01:03,932 INFO L231 Difference]: Finished difference. Result has 79 places, 59 transitions, 191 flow [2023-08-04 06:01:03,933 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, 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 06:01:03,933 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 11 predicate places. [2023-08-04 06:01:03,933 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 59 transitions, 191 flow [2023-08-04 06:01:03,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:03,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:01:03,933 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 06:01:03,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 06:01:03,934 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:01:03,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:01:03,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1050557595, now seen corresponding path program 1 times [2023-08-04 06:01:03,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:01:03,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985006190] [2023-08-04 06:01:03,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:03,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:01:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 06:01:03,966 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 06:01:03,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 06:01:03,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985006190] [2023-08-04 06:01:03,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985006190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 06:01:03,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 06:01:03,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 06:01:03,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242283995] [2023-08-04 06:01:03,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 06:01:03,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 06:01:03,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 06:01:03,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 06:01:03,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 06:01:03,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 283 [2023-08-04 06:01:03,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 59 transitions, 191 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:03,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 06:01:03,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 283 [2023-08-04 06:01:03,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 06:01:21,769 INFO L124 PetriNetUnfolderBase]: 142168/187318 cut-off events. [2023-08-04 06:01:21,769 INFO L125 PetriNetUnfolderBase]: For 11968/11968 co-relation queries the response was YES. [2023-08-04 06:01:22,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390445 conditions, 187318 events. 142168/187318 cut-off events. For 11968/11968 co-relation queries the response was YES. Maximal size of possible extension queue 7398. Compared 1286261 event pairs, 133096 based on Foata normal form. 0/164314 useless extension candidates. Maximal degree in co-relation 137772. Up to 173284 conditions per place. [2023-08-04 06:01:23,000 INFO L140 encePairwiseOnDemand]: 279/283 looper letters, 56 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-08-04 06:01:23,001 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 74 transitions, 340 flow [2023-08-04 06:01:23,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 06:01:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 06:01:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-08-04 06:01:23,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5535924617196702 [2023-08-04 06:01:23,002 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-08-04 06:01:23,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-08-04 06:01:23,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 06:01:23,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-08-04 06:01:23,017 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:23,019 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:23,019 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 283.0) internal successors, (1132), 4 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:23,019 INFO L175 Difference]: Start difference. First operand has 79 places, 59 transitions, 191 flow. Second operand 3 states and 470 transitions. [2023-08-04 06:01:23,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 74 transitions, 340 flow [2023-08-04 06:01:23,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 74 transitions, 336 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 06:01:23,022 INFO L231 Difference]: Finished difference. Result has 81 places, 60 transitions, 202 flow [2023-08-04 06:01:23,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=283, 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 06:01:23,023 INFO L281 CegarLoopForPetriNet]: 68 programPoint places, 13 predicate places. [2023-08-04 06:01:23,023 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 60 transitions, 202 flow [2023-08-04 06:01:23,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 06:01:23,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 06:01:23,023 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 06:01:23,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 06:01:23,023 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 06:01:23,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 06:01:23,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1449349371, now seen corresponding path program 1 times [2023-08-04 06:01:23,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 06:01:23,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282230359] [2023-08-04 06:01:23,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 06:01:23,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 06:01:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:01:23,087 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 06:01:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 06:01:23,113 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 06:01:23,113 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 06:01:23,113 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 06:01:23,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 06:01:23,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 06:01:23,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 06:01:23,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-04 06:01:23,114 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 06:01:23,114 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 06:01:23,115 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 06:01:23,115 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 06:01:23,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 06:01:23 BasicIcfg [2023-08-04 06:01:23,165 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 06:01:23,165 INFO L158 Benchmark]: Toolchain (without parser) took 163643.60ms. Allocated memory was 480.2MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 444.7MB in the beginning and 11.1GB in the end (delta: -10.7GB). Peak memory consumption was 4.9GB. Max. memory is 16.0GB. [2023-08-04 06:01:23,166 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 325.1MB. Free memory is still 281.5MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 06:01:23,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.34ms. Allocated memory is still 480.2MB. Free memory was 444.7MB in the beginning and 421.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 06:01:23,166 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.66ms. Allocated memory is still 480.2MB. Free memory was 421.6MB in the beginning and 419.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:01:23,166 INFO L158 Benchmark]: Boogie Preprocessor took 23.00ms. Allocated memory is still 480.2MB. Free memory was 419.6MB in the beginning and 417.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 06:01:23,166 INFO L158 Benchmark]: RCFGBuilder took 593.41ms. Allocated memory is still 480.2MB. Free memory was 417.5MB in the beginning and 383.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-04 06:01:23,166 INFO L158 Benchmark]: TraceAbstraction took 162637.13ms. Allocated memory was 480.2MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 383.9MB in the beginning and 11.1GB in the end (delta: -10.7GB). Peak memory consumption was 4.8GB. Max. memory is 16.0GB. [2023-08-04 06:01:23,167 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 325.1MB. Free memory is still 281.5MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 351.34ms. Allocated memory is still 480.2MB. Free memory was 444.7MB in the beginning and 421.6MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.66ms. Allocated memory is still 480.2MB. Free memory was 421.6MB in the beginning and 419.6MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 23.00ms. Allocated memory is still 480.2MB. Free memory was 419.6MB in the beginning and 417.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 593.41ms. Allocated memory is still 480.2MB. Free memory was 417.5MB in the beginning and 383.9MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 162637.13ms. Allocated memory was 480.2MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 383.9MB in the beginning and 11.1GB in the end (delta: -10.7GB). Peak memory consumption was 4.8GB. 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.2s, 136 PlacesBefore, 39 PlacesAfterwards, 134 TransitionsBefore, 33 TransitionsAfterwards, 2808 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 116 TotalNumberOfCompositions, 6738 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3376, independent: 3188, independent conditional: 0, independent unconditional: 3188, dependent: 188, dependent conditional: 0, dependent unconditional: 188, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1491, independent: 1464, independent conditional: 0, independent unconditional: 1464, dependent: 27, dependent conditional: 0, dependent unconditional: 27, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3376, independent: 1724, independent conditional: 0, independent unconditional: 1724, dependent: 161, dependent conditional: 0, dependent unconditional: 161, unknown: 1491, unknown conditional: 0, unknown unconditional: 1491] , Statistics on independence cache: Total cache size (in pairs): 155, Positive cache size: 141, Positive conditional cache size: 0, Positive unconditional cache size: 141, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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, 32 PlacesAfterwards, 107 TransitionsBefore, 25 TransitionsAfterwards, 1456 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 2852 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1776, independent: 1670, independent conditional: 0, independent unconditional: 1670, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 742, independent: 727, independent conditional: 0, independent unconditional: 727, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1776, independent: 943, independent conditional: 0, independent unconditional: 943, dependent: 91, dependent conditional: 0, dependent unconditional: 91, unknown: 742, unknown conditional: 0, unknown unconditional: 742] , Statistics on independence cache: Total cache size (in pairs): 70, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 6, Negative conditional cache size: 0, Negative unconditional cache size: 6, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 169 PlacesBefore, 68 PlacesAfterwards, 161 TransitionsBefore, 56 TransitionsAfterwards, 6896 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 120 TotalNumberOfCompositions, 22648 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7281, independent: 6926, independent conditional: 0, independent unconditional: 6926, dependent: 355, dependent conditional: 0, dependent unconditional: 355, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3212, independent: 3158, independent conditional: 0, independent unconditional: 3158, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7281, independent: 3768, independent conditional: 0, independent unconditional: 3768, dependent: 301, dependent conditional: 0, dependent unconditional: 301, unknown: 3212, unknown conditional: 0, unknown unconditional: 3212] , Statistics on independence cache: Total cache size (in pairs): 357, Positive cache size: 330, Positive conditional cache size: 0, Positive unconditional cache size: 330, 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_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L723] 0 int b = 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; [L845] 0 pthread_t t852[2]; [L846] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={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] [L846] COND TRUE 0 asdf<2 [L846] FCALL, FORK 0 pthread_create(&t852[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t852[asdf], ((void *)0), P0, ((void *)0))=-6, t852={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] [L846] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={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] [L846] COND TRUE 0 asdf<2 [L846] FCALL, FORK 0 pthread_create(&t852[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t852[asdf], ((void *)0), P0, ((void *)0))=-5, t852={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] [L846] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={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] [L846] COND FALSE 0 !(asdf<2) [L847] 0 pthread_t t853[2]; [L848] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={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] [L848] COND TRUE 0 asdf<2 [L848] FCALL, FORK 0 pthread_create(&t853[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t853[asdf], ((void *)0), P1, ((void *)0))=-4, t852={5:0}, t853={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] [L848] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={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] [L848] COND TRUE 0 asdf<2 [L848] FCALL, FORK 0 pthread_create(&t853[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t853[asdf], ((void *)0), P1, ((void *)0))=-3, t852={5:0}, t853={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] [L848] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={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] [L848] COND FALSE 0 !(asdf<2) [L849] 0 pthread_t t854[2]; [L850] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3: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] [L850] COND TRUE 0 asdf<2 [L850] FCALL, FORK 0 pthread_create(&t854[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t854[asdf], ((void *)0), P2, ((void *)0))=-2, t852={5:0}, t853={6:0}, t854={3: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] [L802] 5 z$w_buff1 = z$w_buff0 [L803] 5 z$w_buff0 = 1 [L804] 5 z$w_buff1_used = z$w_buff0_used [L805] 5 z$w_buff0_used = (_Bool)1 [L806] CALL 5 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L806] RET 5 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L807] 5 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 5 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 5 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 5 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 5 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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}, b=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] [L850] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t852={5:0}, t853={6:0}, t854={3: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] [L850] COND TRUE 0 asdf<2 [L850] FCALL, FORK 0 pthread_create(&t854[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t854[asdf], ((void *)0), P2, ((void *)0))=-1, t852={5:0}, t853={6:0}, t854={3: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] [L802] 6 z$w_buff1 = z$w_buff0 [L803] 6 z$w_buff0 = 1 [L804] 6 z$w_buff1_used = z$w_buff0_used [L805] 6 z$w_buff0_used = (_Bool)1 [L806] 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_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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: 5.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 63 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 7 mSDtfsCounter, 168 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=87occurred 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: 154.3s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 149.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 105 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 585 IncrementalHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 4 mSDtfsCounter, 585 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 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.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 49 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=73occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 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 06:01:23,195 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...