/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_mix015.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:40:34,281 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:40:34,331 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:40:34,338 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:40:34,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:40:34,339 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:40:34,340 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:40:34,368 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:40:34,369 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:40:34,373 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:40:34,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:40:34,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:40:34,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:40:34,375 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:40:34,375 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:40:34,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:40:34,376 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:40:34,376 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:40:34,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:40:34,377 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:40:34,377 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:40:34,377 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:40:34,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:40:34,378 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:40:34,378 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:40:34,378 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:40:34,378 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:40:34,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:40:34,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:40:34,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:40:34,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:40:34,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:40:34,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:40:34,381 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:40:34,381 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:40:34,381 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:40:34,381 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:40:34,381 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:40:34,381 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:40:34,382 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:40:34,382 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:40:34,382 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:40:34,581 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:40:34,599 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:40:34,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:40:34,602 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:40:34,602 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:40:34,603 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix015.oepc_bound2.i [2023-08-04 05:40:35,834 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:40:36,075 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:40:36,076 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix015.oepc_bound2.i [2023-08-04 05:40:36,091 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/096c0ff49/71286807ddd144d8870fe5ea3d7baa05/FLAG6b9533e2c [2023-08-04 05:40:36,110 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/096c0ff49/71286807ddd144d8870fe5ea3d7baa05 [2023-08-04 05:40:36,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:40:36,114 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:40:36,115 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:40:36,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:40:36,118 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:40:36,119 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,120 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d9a0b57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36, skipping insertion in model container [2023-08-04 05:40:36,120 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,168 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:40:36,308 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_mix015.oepc_bound2.i[945,958] [2023-08-04 05:40:36,461 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:40:36,476 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:40:36,490 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_mix015.oepc_bound2.i[945,958] [2023-08-04 05:40:36,504 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:40:36,506 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:40:36,539 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:40:36,568 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:40:36,568 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:40:36,573 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:40:36,573 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36 WrapperNode [2023-08-04 05:40:36,573 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:40:36,574 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:40:36,574 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:40:36,575 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:40:36,580 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:40:36" (1/1) ... [2023-08-04 05:40:36,600 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:40:36" (1/1) ... [2023-08-04 05:40:36,634 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 162 [2023-08-04 05:40:36,635 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:40:36,635 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:40:36,635 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:40:36,635 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:40:36,643 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,644 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,647 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,658 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,661 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,662 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,665 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:40:36,666 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:40:36,666 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:40:36,666 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:40:36,667 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (1/1) ... [2023-08-04 05:40:36,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:40:36,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:40:36,901 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:40:36,914 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:40:36,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:40:36,946 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:40:36,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:40:36,947 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:40:36,947 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:40:36,948 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:40:36,948 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:40:36,949 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:40:36,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:40:36,949 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:40:36,949 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:40:36,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:40:36,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:40:36,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:40:36,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:40:36,952 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:40:37,083 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:40:37,085 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:40:37,395 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:40:37,546 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:40:37,546 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:40:37,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:40:37 BoogieIcfgContainer [2023-08-04 05:40:37,550 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:40:37,551 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:40:37,552 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:40:37,554 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:40:37,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:40:36" (1/3) ... [2023-08-04 05:40:37,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7c474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:40:37, skipping insertion in model container [2023-08-04 05:40:37,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:36" (2/3) ... [2023-08-04 05:40:37,555 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b7c474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:40:37, skipping insertion in model container [2023-08-04 05:40:37,555 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:40:37" (3/3) ... [2023-08-04 05:40:37,556 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix015.oepc_bound2.i [2023-08-04 05:40:37,562 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:40:37,569 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:40:37,569 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:40:37,569 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:40:37,621 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:40:37,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:40:37,801 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-04 05:40:37,801 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:37,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 458 events. 30/458 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2018 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 275. Up to 16 conditions per place. [2023-08-04 05:40:37,807 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:40:37,815 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 136 transitions, 287 flow [2023-08-04 05:40:37,818 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:40:37,837 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 136 transitions, 287 flow [2023-08-04 05:40:37,841 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 136 transitions, 287 flow [2023-08-04 05:40:37,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:40:37,930 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-04 05:40:37,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:37,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 458 events. 30/458 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2018 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 275. Up to 16 conditions per place. [2023-08-04 05:40:37,940 INFO L119 LiptonReduction]: Number of co-enabled transitions 3172 [2023-08-04 05:40:41,370 INFO L134 LiptonReduction]: Checked pairs total: 8123 [2023-08-04 05:40:41,371 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-04 05:40:41,382 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:40:41,387 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;@69a1f6cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:40:41,388 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:40:41,390 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:40:41,391 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-04 05:40:41,391 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:41,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:41,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:40:41,392 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:40:41,396 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:41,396 INFO L85 PathProgramCache]: Analyzing trace with hash 17969329, now seen corresponding path program 1 times [2023-08-04 05:40:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:41,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556075686] [2023-08-04 05:40:41,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:41,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:41,723 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:40:41,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:41,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556075686] [2023-08-04 05:40:41,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556075686] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:40:41,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:40:41,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:40:41,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568670915] [2023-08-04 05:40:41,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:40:41,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:40:41,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:41,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:40:41,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:40:41,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 251 [2023-08-04 05:40:41,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 89 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:40:41,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:41,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 251 [2023-08-04 05:40:41,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:40:42,448 INFO L124 PetriNetUnfolderBase]: 3074/5132 cut-off events. [2023-08-04 05:40:42,449 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2023-08-04 05:40:42,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9987 conditions, 5132 events. 3074/5132 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 33054 event pairs, 650 based on Foata normal form. 180/4714 useless extension candidates. Maximal degree in co-relation 8705. Up to 3553 conditions per place. [2023-08-04 05:40:42,475 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 45 selfloop transitions, 2 changer transitions 8/58 dead transitions. [2023-08-04 05:40:42,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 58 transitions, 241 flow [2023-08-04 05:40:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:40:42,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:40:42,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-04 05:40:42,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.547144754316069 [2023-08-04 05:40:42,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-04 05:40:42,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-04 05:40:42,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:40:42,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-04 05:40:42,495 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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:40:42,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:40:42,500 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:40:42,502 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 89 flow. Second operand 3 states and 412 transitions. [2023-08-04 05:40:42,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 58 transitions, 241 flow [2023-08-04 05:40:42,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 58 transitions, 241 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:40:42,506 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 73 flow [2023-08-04 05:40:42,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2023-08-04 05:40:42,511 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-04 05:40:42,511 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 73 flow [2023-08-04 05:40:42,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:40:42,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:42,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:40:42,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:40:42,512 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:40:42,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:42,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1144723221, now seen corresponding path program 1 times [2023-08-04 05:40:42,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:42,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993215013] [2023-08-04 05:40:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:42,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:42,591 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:40:42,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:42,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993215013] [2023-08-04 05:40:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993215013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:40:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:40:42,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:40:42,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750159023] [2023-08-04 05:40:42,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:40:42,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:40:42,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:42,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:40:42,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:40:42,603 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 251 [2023-08-04 05:40:42,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:40:42,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:42,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 251 [2023-08-04 05:40:42,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:40:43,028 INFO L124 PetriNetUnfolderBase]: 2129/3402 cut-off events. [2023-08-04 05:40:43,028 INFO L125 PetriNetUnfolderBase]: For 236/236 co-relation queries the response was YES. [2023-08-04 05:40:43,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6934 conditions, 3402 events. 2129/3402 cut-off events. For 236/236 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 18546 event pairs, 1245 based on Foata normal form. 0/3187 useless extension candidates. Maximal degree in co-relation 6919. Up to 3235 conditions per place. [2023-08-04 05:40:43,048 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 29 selfloop transitions, 2 changer transitions 1/35 dead transitions. [2023-08-04 05:40:43,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 149 flow [2023-08-04 05:40:43,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:40:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:40:43,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 381 transitions. [2023-08-04 05:40:43,051 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5059760956175299 [2023-08-04 05:40:43,051 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 381 transitions. [2023-08-04 05:40:43,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 381 transitions. [2023-08-04 05:40:43,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:40:43,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 381 transitions. [2023-08-04 05:40:43,052 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.0) internal successors, (381), 3 states have internal predecessors, (381), 0 states have call successors, (0), 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:40:43,054 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:40:43,055 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:40:43,055 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 73 flow. Second operand 3 states and 381 transitions. [2023-08-04 05:40:43,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 149 flow [2023-08-04 05:40:43,056 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 35 transitions, 143 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:40:43,057 INFO L231 Difference]: Finished difference. Result has 40 places, 30 transitions, 77 flow [2023-08-04 05:40:43,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=40, PETRI_TRANSITIONS=30} [2023-08-04 05:40:43,057 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-04 05:40:43,058 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 30 transitions, 77 flow [2023-08-04 05:40:43,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:40:43,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:43,058 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:40:43,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-04 05:40:43,059 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:40:43,059 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:43,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1922926778, now seen corresponding path program 1 times [2023-08-04 05:40:43,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:43,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376013004] [2023-08-04 05:40:43,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:43,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:43,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:43,119 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:40:43,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:43,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376013004] [2023-08-04 05:40:43,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376013004] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:40:43,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891912523] [2023-08-04 05:40:43,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:43,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:40:43,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:40:43,129 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:40:43,156 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:40:43,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:43,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:40:43,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:40:43,269 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:40:43,269 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:40:43,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891912523] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:40:43,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:40:43,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:40:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586765670] [2023-08-04 05:40:43,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:40:43,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:40:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:40:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:40:43,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 251 [2023-08-04 05:40:43,280 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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:40:43,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:43,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 251 [2023-08-04 05:40:43,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:40:43,638 INFO L124 PetriNetUnfolderBase]: 1845/2880 cut-off events. [2023-08-04 05:40:43,638 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 05:40:43,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5707 conditions, 2880 events. 1845/2880 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 14837 event pairs, 1176 based on Foata normal form. 0/2720 useless extension candidates. Maximal degree in co-relation 5691. Up to 2699 conditions per place. [2023-08-04 05:40:43,654 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 32 selfloop transitions, 2 changer transitions 1/38 dead transitions. [2023-08-04 05:40:43,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 163 flow [2023-08-04 05:40:43,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:40:43,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:40:43,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-04 05:40:43,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5099601593625498 [2023-08-04 05:40:43,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-04 05:40:43,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-04 05:40:43,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:40:43,658 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-04 05:40:43,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:40:43,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:40:43,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:40:43,661 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 77 flow. Second operand 3 states and 384 transitions. [2023-08-04 05:40:43,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 163 flow [2023-08-04 05:40:43,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 38 transitions, 159 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:40:43,662 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 81 flow [2023-08-04 05:40:43,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2023-08-04 05:40:43,663 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-04 05:40:43,663 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 81 flow [2023-08-04 05:40:43,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 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:40:43,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:43,664 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:40:43,672 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:40:43,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:40:43,870 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:40:43,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:43,870 INFO L85 PathProgramCache]: Analyzing trace with hash 924093802, now seen corresponding path program 1 times [2023-08-04 05:40:43,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:43,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772980759] [2023-08-04 05:40:43,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:43,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:43,958 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:40:43,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:43,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772980759] [2023-08-04 05:40:43,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772980759] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:40:43,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [458045325] [2023-08-04 05:40:43,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:43,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:40:43,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:40:43,961 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:40:43,963 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:40:44,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:44,046 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:40:44,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:40:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:40:44,055 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:40:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [458045325] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:40:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:40:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:40:44,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159788362] [2023-08-04 05:40:44,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:40:44,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:40:44,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:44,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:40:44,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:40:44,069 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 251 [2023-08-04 05:40:44,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:40:44,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:44,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 251 [2023-08-04 05:40:44,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:40:44,384 INFO L124 PetriNetUnfolderBase]: 1721/2586 cut-off events. [2023-08-04 05:40:44,384 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-08-04 05:40:44,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5269 conditions, 2586 events. 1721/2586 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 12815 event pairs, 1024 based on Foata normal form. 0/2485 useless extension candidates. Maximal degree in co-relation 5253. Up to 2192 conditions per place. [2023-08-04 05:40:44,399 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 36 selfloop transitions, 2 changer transitions 1/42 dead transitions. [2023-08-04 05:40:44,399 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 42 transitions, 183 flow [2023-08-04 05:40:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:40:44,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:40:44,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-04 05:40:44,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5152722443559097 [2023-08-04 05:40:44,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-04 05:40:44,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-04 05:40:44,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:40:44,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-04 05:40:44,403 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:40:44,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:40:44,404 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 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:40:44,405 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 81 flow. Second operand 3 states and 388 transitions. [2023-08-04 05:40:44,405 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 42 transitions, 183 flow [2023-08-04 05:40:44,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 42 transitions, 179 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:40:44,406 INFO L231 Difference]: Finished difference. Result has 42 places, 30 transitions, 85 flow [2023-08-04 05:40:44,407 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=42, PETRI_TRANSITIONS=30} [2023-08-04 05:40:44,407 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-04 05:40:44,407 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 30 transitions, 85 flow [2023-08-04 05:40:44,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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:40:44,408 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:44,408 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:40:44,416 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:40:44,613 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,SelfDestructingSolverStorable3 [2023-08-04 05:40:44,613 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:40:44,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:44,614 INFO L85 PathProgramCache]: Analyzing trace with hash -290572291, now seen corresponding path program 1 times [2023-08-04 05:40:44,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392504989] [2023-08-04 05:40:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:44,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:44,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:40:44,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:44,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392504989] [2023-08-04 05:40:44,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392504989] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:40:44,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312910501] [2023-08-04 05:40:44,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:44,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:40:44,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:40:44,714 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:40:44,737 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:40:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:44,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:40:44,818 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:40:44,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:40:44,854 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:40:44,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 05:40:44,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312910501] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:40:44,877 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:40:44,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:40:44,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133244089] [2023-08-04 05:40:44,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:40:44,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:40:44,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:44,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:40:44,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:40:44,898 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 251 [2023-08-04 05:40:44,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 30 transitions, 85 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 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:40:44,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:44,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 251 [2023-08-04 05:40:44,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:40:44,930 INFO L124 PetriNetUnfolderBase]: 8/26 cut-off events. [2023-08-04 05:40:44,930 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:44,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 26 events. 8/26 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 39 event pairs, 0 based on Foata normal form. 5/31 useless extension candidates. Maximal degree in co-relation 58. Up to 18 conditions per place. [2023-08-04 05:40:44,930 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 0 selfloop transitions, 0 changer transitions 14/14 dead transitions. [2023-08-04 05:40:44,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 14 transitions, 59 flow [2023-08-04 05:40:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:40:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:40:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 474 transitions. [2023-08-04 05:40:44,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4721115537848606 [2023-08-04 05:40:44,932 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 474 transitions. [2023-08-04 05:40:44,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 474 transitions. [2023-08-04 05:40:44,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:40:44,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 474 transitions. [2023-08-04 05:40:44,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 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:40:44,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:40:44,937 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 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:40:44,937 INFO L175 Difference]: Start difference. First operand has 42 places, 30 transitions, 85 flow. Second operand 4 states and 474 transitions. [2023-08-04 05:40:44,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 14 transitions, 59 flow [2023-08-04 05:40:44,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 14 transitions, 57 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:40:44,939 INFO L231 Difference]: Finished difference. Result has 20 places, 0 transitions, 0 flow [2023-08-04 05:40:44,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=21, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=20, PETRI_TRANSITIONS=0} [2023-08-04 05:40:44,941 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -23 predicate places. [2023-08-04 05:40:44,941 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 0 transitions, 0 flow [2023-08-04 05:40:44,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 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:40:44,944 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:40:44,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:40:44,945 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:40:44,954 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:40:45,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:40:45,152 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 05:40:45,154 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:40:45,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:40:45,194 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-04 05:40:45,195 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:45,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 458 events. 30/458 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2018 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 275. Up to 16 conditions per place. [2023-08-04 05:40:45,196 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 136 transitions, 287 flow [2023-08-04 05:40:45,197 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 107 transitions, 229 flow [2023-08-04 05:40:45,198 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:40:45,198 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 107 transitions, 229 flow [2023-08-04 05:40:45,198 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 107 transitions, 229 flow [2023-08-04 05:40:45,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 107 transitions, 229 flow [2023-08-04 05:40:45,225 INFO L124 PetriNetUnfolderBase]: 6/226 cut-off events. [2023-08-04 05:40:45,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:45,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 226 events. 6/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 674 event pairs, 0 based on Foata normal form. 0/213 useless extension candidates. Maximal degree in co-relation 159. Up to 8 conditions per place. [2023-08-04 05:40:45,228 INFO L119 LiptonReduction]: Number of co-enabled transitions 1722 [2023-08-04 05:40:48,243 INFO L134 LiptonReduction]: Checked pairs total: 3579 [2023-08-04 05:40:48,243 INFO L136 LiptonReduction]: Total number of compositions: 86 [2023-08-04 05:40:48,245 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:40:48,246 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;@69a1f6cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:40:48,246 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:40:48,249 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:40:48,249 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-08-04 05:40:48,249 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:48,249 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:48,249 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:40:48,249 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:40:48,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:48,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1649852910, now seen corresponding path program 1 times [2023-08-04 05:40:48,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:48,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438943788] [2023-08-04 05:40:48,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:48,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:48,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:40:48,268 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:40:48,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:40:48,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:40:48,307 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:40:48,307 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:40:48,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:40:48,308 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:40:48,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 05:40:48,308 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 05:40:48,310 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:40:48,310 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:40:48,310 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:40:48,340 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:40:48,344 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 364 flow [2023-08-04 05:40:48,490 INFO L124 PetriNetUnfolderBase]: 93/1403 cut-off events. [2023-08-04 05:40:48,490 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:40:48,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 1403 events. 93/1403 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9705 event pairs, 0 based on Foata normal form. 0/1242 useless extension candidates. Maximal degree in co-relation 1017. Up to 54 conditions per place. [2023-08-04 05:40:48,500 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 164 transitions, 364 flow [2023-08-04 05:40:48,505 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 164 transitions, 364 flow [2023-08-04 05:40:48,506 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:40:48,506 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 164 transitions, 364 flow [2023-08-04 05:40:48,506 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 164 transitions, 364 flow [2023-08-04 05:40:48,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 164 transitions, 364 flow [2023-08-04 05:40:48,635 INFO L124 PetriNetUnfolderBase]: 93/1403 cut-off events. [2023-08-04 05:40:48,636 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:40:48,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1501 conditions, 1403 events. 93/1403 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9705 event pairs, 0 based on Foata normal form. 0/1242 useless extension candidates. Maximal degree in co-relation 1017. Up to 54 conditions per place. [2023-08-04 05:40:48,673 INFO L119 LiptonReduction]: Number of co-enabled transitions 7752 [2023-08-04 05:40:51,894 INFO L134 LiptonReduction]: Checked pairs total: 26188 [2023-08-04 05:40:51,895 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-04 05:40:51,896 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:40:51,897 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;@69a1f6cc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:40:51,897 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:40:51,899 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:40:51,899 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-04 05:40:51,899 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:51,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:51,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-04 05:40:51,900 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:40:51,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:51,900 INFO L85 PathProgramCache]: Analyzing trace with hash 30254739, now seen corresponding path program 1 times [2023-08-04 05:40:51,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:51,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563379253] [2023-08-04 05:40:51,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:51,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:51,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:51,984 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:40:51,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:51,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563379253] [2023-08-04 05:40:51,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563379253] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:40:51,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:40:51,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:40:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835133828] [2023-08-04 05:40:51,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:40:51,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:40:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:51,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:40:51,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:40:51,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 285 [2023-08-04 05:40:51,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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:40:51,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:51,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 285 [2023-08-04 05:40:51,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:42:09,106 INFO L124 PetriNetUnfolderBase]: 633758/884884 cut-off events. [2023-08-04 05:42:09,107 INFO L125 PetriNetUnfolderBase]: For 9470/9470 co-relation queries the response was YES. [2023-08-04 05:42:12,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688243 conditions, 884884 events. 633758/884884 cut-off events. For 9470/9470 co-relation queries the response was YES. Maximal size of possible extension queue 23001. Compared 7725400 event pairs, 105182 based on Foata normal form. 17577/788004 useless extension candidates. Maximal degree in co-relation 1418113. Up to 729279 conditions per place. [2023-08-04 05:42:15,214 INFO L140 encePairwiseOnDemand]: 279/285 looper letters, 75 selfloop transitions, 3 changer transitions 0/94 dead transitions. [2023-08-04 05:42:15,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 94 transitions, 401 flow [2023-08-04 05:42:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:42:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:42:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2023-08-04 05:42:15,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5801169590643275 [2023-08-04 05:42:15,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 496 transitions. [2023-08-04 05:42:15,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 496 transitions. [2023-08-04 05:42:15,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:42:15,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 496 transitions. [2023-08-04 05:42:15,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 0 states have call successors, (0), 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:42:15,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:42:15,223 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:42:15,223 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 156 flow. Second operand 3 states and 496 transitions. [2023-08-04 05:42:15,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 94 transitions, 401 flow [2023-08-04 05:42:15,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 94 transitions, 395 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-04 05:42:15,238 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 169 flow [2023-08-04 05:42:15,239 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2023-08-04 05:42:15,239 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 3 predicate places. [2023-08-04 05:42:15,239 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 169 flow [2023-08-04 05:42:15,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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:42:15,240 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:42:15,240 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:42:15,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:42:15,240 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:42:15,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:42:15,241 INFO L85 PathProgramCache]: Analyzing trace with hash -297391286, now seen corresponding path program 1 times [2023-08-04 05:42:15,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:42:15,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607636328] [2023-08-04 05:42:15,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:42:15,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:42:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:42:15,269 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:42:15,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:42:15,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607636328] [2023-08-04 05:42:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607636328] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:42:15,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:42:15,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:42:15,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106534284] [2023-08-04 05:42:15,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:42:15,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:42:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:42:15,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:42:15,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:42:15,279 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 285 [2023-08-04 05:42:15,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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:42:15,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:42:15,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 285 [2023-08-04 05:42:15,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:43:32,868 INFO L124 PetriNetUnfolderBase]: 618374/797459 cut-off events. [2023-08-04 05:43:32,868 INFO L125 PetriNetUnfolderBase]: For 61879/61879 co-relation queries the response was YES. [2023-08-04 05:43:35,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1685872 conditions, 797459 events. 618374/797459 cut-off events. For 61879/61879 co-relation queries the response was YES. Maximal size of possible extension queue 24603. Compared 5841608 event pairs, 518026 based on Foata normal form. 0/699967 useless extension candidates. Maximal degree in co-relation 1110175. Up to 771849 conditions per place. [2023-08-04 05:43:38,821 INFO L140 encePairwiseOnDemand]: 282/285 looper letters, 48 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-08-04 05:43:38,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 282 flow [2023-08-04 05:43:38,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:43:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:43:38,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-08-04 05:43:38,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5309941520467836 [2023-08-04 05:43:38,823 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-08-04 05:43:38,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-08-04 05:43:38,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:43:38,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-08-04 05:43:38,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 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:43:38,826 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:38,826 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 285.0) internal successors, (1140), 4 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:38,826 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 169 flow. Second operand 3 states and 454 transitions. [2023-08-04 05:43:38,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 282 flow [2023-08-04 05:43:38,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 66 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:43:38,854 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 178 flow [2023-08-04 05:43:38,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=285, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2023-08-04 05:43:38,855 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 5 predicate places. [2023-08-04 05:43:38,855 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 178 flow [2023-08-04 05:43:38,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 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:43:38,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:43:38,856 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:43:38,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:43:38,856 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:43:38,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:43:38,857 INFO L85 PathProgramCache]: Analyzing trace with hash -98342666, now seen corresponding path program 1 times [2023-08-04 05:43:38,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:43:38,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88690209] [2023-08-04 05:43:38,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:43:38,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:43:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:43:38,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:43:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:43:38,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:43:38,883 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:43:38,883 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:43:38,883 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:43:38,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:43:38,884 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:43:38,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:43:38,884 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:43:38,885 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:43:38,886 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:43:38,886 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:43:38,940 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:43:38 BasicIcfg [2023-08-04 05:43:38,940 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:43:38,941 INFO L158 Benchmark]: Toolchain (without parser) took 182826.77ms. Allocated memory was 423.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 376.3MB in the beginning and 9.7GB in the end (delta: -9.4GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2023-08-04 05:43:38,941 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 337.6MB. Free memory was 294.4MB in the beginning and 294.3MB in the end (delta: 124.8kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:43:38,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 458.31ms. Allocated memory is still 423.6MB. Free memory was 376.3MB in the beginning and 352.5MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-04 05:43:38,942 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.36ms. Allocated memory is still 423.6MB. Free memory was 352.5MB in the beginning and 349.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:43:38,942 INFO L158 Benchmark]: Boogie Preprocessor took 30.32ms. Allocated memory is still 423.6MB. Free memory was 349.5MB in the beginning and 347.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:43:38,942 INFO L158 Benchmark]: RCFGBuilder took 883.70ms. Allocated memory is still 423.6MB. Free memory was 347.5MB in the beginning and 309.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-04 05:43:38,942 INFO L158 Benchmark]: TraceAbstraction took 181389.00ms. Allocated memory was 423.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 308.4MB in the beginning and 9.7GB in the end (delta: -9.4GB). Peak memory consumption was 6.2GB. Max. memory is 16.0GB. [2023-08-04 05:43:38,944 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 337.6MB. Free memory was 294.4MB in the beginning and 294.3MB in the end (delta: 124.8kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 458.31ms. Allocated memory is still 423.6MB. Free memory was 376.3MB in the beginning and 352.5MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 60.36ms. Allocated memory is still 423.6MB. Free memory was 352.5MB in the beginning and 349.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.32ms. Allocated memory is still 423.6MB. Free memory was 349.5MB in the beginning and 347.5MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 883.70ms. Allocated memory is still 423.6MB. Free memory was 347.5MB in the beginning and 309.8MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 181389.00ms. Allocated memory was 423.6MB in the beginning and 16.0GB in the end (delta: 15.6GB). Free memory was 308.4MB in the beginning and 9.7GB in the end (delta: -9.4GB). Peak memory consumption was 6.2GB. 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.5s, 138 PlacesBefore, 43 PlacesAfterwards, 136 TransitionsBefore, 37 TransitionsAfterwards, 3172 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 115 TotalNumberOfCompositions, 8123 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4450, independent: 4262, independent conditional: 0, independent unconditional: 4262, 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: 1666, independent: 1640, independent conditional: 0, independent unconditional: 1640, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4450, independent: 2622, independent conditional: 0, independent unconditional: 2622, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1666, unknown conditional: 0, unknown unconditional: 1666] , Statistics on independence cache: Total cache size (in pairs): 203, Positive cache size: 187, Positive conditional cache size: 0, Positive unconditional cache size: 187, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 112 PlacesBefore, 34 PlacesAfterwards, 107 TransitionsBefore, 27 TransitionsAfterwards, 1722 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 86 TotalNumberOfCompositions, 3579 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1887, independent: 1770, independent conditional: 0, independent unconditional: 1770, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 894, independent: 873, independent conditional: 0, independent unconditional: 873, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1887, independent: 897, independent conditional: 0, independent unconditional: 897, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 894, unknown conditional: 0, unknown unconditional: 894] , Statistics on independence cache: Total cache size (in pairs): 81, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.4s, 172 PlacesBefore, 72 PlacesAfterwards, 164 TransitionsBefore, 60 TransitionsAfterwards, 7752 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 15 ConcurrentYvCompositions, 4 ChoiceCompositions, 121 TotalNumberOfCompositions, 26188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8197, independent: 7829, independent conditional: 0, independent unconditional: 7829, dependent: 368, dependent conditional: 0, dependent unconditional: 368, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3534, independent: 3482, independent conditional: 0, independent unconditional: 3482, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8197, independent: 4347, independent conditional: 0, independent unconditional: 4347, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 3534, unknown conditional: 0, unknown unconditional: 3534] , Statistics on independence cache: Total cache size (in pairs): 392, Positive cache size: 363, Positive conditional cache size: 0, Positive unconditional cache size: 363, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool a$flush_delayed; [L723] 0 int a$mem_tmp; [L724] 0 _Bool a$r_buff0_thd0; [L725] 0 _Bool a$r_buff0_thd1; [L726] 0 _Bool a$r_buff0_thd2; [L727] 0 _Bool a$r_buff0_thd3; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$read_delayed; [L733] 0 int *a$read_delayed_var; [L734] 0 int a$w_buff0; [L735] 0 _Bool a$w_buff0_used; [L736] 0 int a$w_buff1; [L737] 0 _Bool a$w_buff1_used; [L738] 0 _Bool main$tmp_guard0; [L739] 0 _Bool main$tmp_guard1; [L741] 0 int x = 0; [L743] 0 int y = 0; [L745] 0 int z = 0; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L850] 0 pthread_t t385[2]; [L851] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t385={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] COND TRUE 0 asdf<2 [L851] FCALL, FORK 0 pthread_create(&t385[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385[asdf], ((void *)0), P0, ((void *)0))=-1, t385={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 1 a$w_buff1 = a$w_buff0 [L752] 1 a$w_buff0 = 1 [L753] 1 a$w_buff1_used = a$w_buff0_used [L754] 1 a$w_buff0_used = (_Bool)1 [L755] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L755] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L756] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L757] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L758] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L759] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L760] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t385={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L851] COND TRUE 0 asdf<2 [L851] FCALL, FORK 0 pthread_create(&t385[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t385[asdf], ((void *)0), P0, ((void *)0))=0, t385={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L751] 2 a$w_buff1 = a$w_buff0 [L752] 2 a$w_buff0 = 1 [L753] 2 a$w_buff1_used = a$w_buff0_used [L754] 2 a$w_buff0_used = (_Bool)1 [L755] CALL 2 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND TRUE 2 !expression [L18] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=1, a$w_buff1_used=1, a=0, expression=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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, 160 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: 7.5s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 117 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 74 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 9 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=0, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 10/15 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, 188 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: 170.5s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 166.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 176 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 2 mSDtfsCounter, 176 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=2, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 17 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 160 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: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=69occurred in iteration=0, InterpolantAutomatonStates: 0, 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, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 05:43:38,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...