/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_mix011_tso.oepc_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:36:56,233 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:36:56,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:36:56,308 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:36:56,308 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:36:56,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:36:56,309 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:36:56,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:36:56,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:36:56,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:36:56,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:36:56,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:36:56,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:36:56,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:36:56,353 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:36:56,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:36:56,353 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:36:56,354 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:36:56,354 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:36:56,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:36:56,354 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:36:56,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:36:56,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:36:56,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:36:56,356 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:36:56,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:36:56,356 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:36:56,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:36:56,357 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:36:56,357 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:36:56,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:36:56,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:36:56,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:36:56,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:36:56,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:36:56,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:36:56,359 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:36:56,359 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:36:56,359 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:36:56,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:36:56,360 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:36:56,360 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:36:56,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:36:56,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:36:56,625 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:36:56,625 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:36:56,626 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:36:56,627 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix011_tso.oepc_bound2.i [2023-08-04 05:36:57,829 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:36:58,067 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:36:58,068 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix011_tso.oepc_bound2.i [2023-08-04 05:36:58,084 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a91a0b92/51356f93e9064f458d25190df2522f50/FLAG854350ff8 [2023-08-04 05:36:58,102 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a91a0b92/51356f93e9064f458d25190df2522f50 [2023-08-04 05:36:58,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:36:58,113 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:36:58,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:36:58,115 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:36:58,117 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:36:58,118 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,119 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@577eab90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58, skipping insertion in model container [2023-08-04 05:36:58,119 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,172 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:36:58,322 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_mix011_tso.oepc_bound2.i[949,962] [2023-08-04 05:36:58,475 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:36:58,492 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:36:58,507 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_mix011_tso.oepc_bound2.i[949,962] [2023-08-04 05:36:58,526 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:36:58,528 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:36:58,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:36:58,604 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:36:58,604 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:36:58,612 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:36:58,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58 WrapperNode [2023-08-04 05:36:58,613 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:36:58,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:36:58,615 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:36:58,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:36:58,622 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:36:58" (1/1) ... [2023-08-04 05:36:58,650 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:36:58" (1/1) ... [2023-08-04 05:36:58,676 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 178 [2023-08-04 05:36:58,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:36:58,677 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:36:58,677 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:36:58,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:36:58,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,689 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,697 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,700 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,704 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,707 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:36:58,708 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:36:58,708 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:36:58,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:36:58,709 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (1/1) ... [2023-08-04 05:36:58,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:36:58,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:36:58,732 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:36:58,740 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:36:58,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:36:58,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:36:58,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:36:58,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:36:58,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:36:58,766 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:36:58,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:36:58,767 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:36:58,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:36:58,767 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:36:58,767 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:36:58,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:36:58,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:36:58,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:36:58,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:36:58,769 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:36:58,901 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:36:58,902 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:36:59,206 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:36:59,343 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:36:59,343 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:36:59,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:36:59 BoogieIcfgContainer [2023-08-04 05:36:59,346 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:36:59,349 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:36:59,350 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:36:59,353 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:36:59,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:36:58" (1/3) ... [2023-08-04 05:36:59,355 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14234558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:36:59, skipping insertion in model container [2023-08-04 05:36:59,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:36:58" (2/3) ... [2023-08-04 05:36:59,356 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14234558 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:36:59, skipping insertion in model container [2023-08-04 05:36:59,356 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:36:59" (3/3) ... [2023-08-04 05:36:59,357 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix011_tso.oepc_bound2.i [2023-08-04 05:36:59,365 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:36:59,374 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:36:59,375 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:36:59,375 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:36:59,445 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:36:59,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 135 transitions, 285 flow [2023-08-04 05:36:59,654 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 05:36:59,655 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:59,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2057 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 277. Up to 16 conditions per place. [2023-08-04 05:36:59,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 135 transitions, 285 flow [2023-08-04 05:36:59,669 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 134 transitions, 281 flow [2023-08-04 05:36:59,673 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:36:59,690 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 134 transitions, 281 flow [2023-08-04 05:36:59,693 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 134 transitions, 281 flow [2023-08-04 05:36:59,694 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 281 flow [2023-08-04 05:36:59,756 INFO L124 PetriNetUnfolderBase]: 30/459 cut-off events. [2023-08-04 05:36:59,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:36:59,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 459 events. 30/459 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2047 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:36:59,782 INFO L119 LiptonReduction]: Number of co-enabled transitions 3068 [2023-08-04 05:37:03,286 INFO L134 LiptonReduction]: Checked pairs total: 8044 [2023-08-04 05:37:03,287 INFO L136 LiptonReduction]: Total number of compositions: 114 [2023-08-04 05:37:03,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:37:03,304 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;@137cd358, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:37:03,304 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:37:03,308 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:37:03,308 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-04 05:37:03,308 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:37:03,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:37:03,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:37:03,309 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:37:03,313 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:37:03,314 INFO L85 PathProgramCache]: Analyzing trace with hash 554500365, now seen corresponding path program 1 times [2023-08-04 05:37:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:37:03,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183883613] [2023-08-04 05:37:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:37:03,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:37:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:37:03,550 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:37:03,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:37:03,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183883613] [2023-08-04 05:37:03,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183883613] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:37:03,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:37:03,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:37:03,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546583623] [2023-08-04 05:37:03,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:37:03,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:37:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:37:03,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:37:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:37:03,601 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 249 [2023-08-04 05:37:03,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have 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:37:03,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:37:03,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 249 [2023-08-04 05:37:03,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:37:04,110 INFO L124 PetriNetUnfolderBase]: 2161/3424 cut-off events. [2023-08-04 05:37:04,110 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-08-04 05:37:04,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6862 conditions, 3424 events. 2161/3424 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 20119 event pairs, 1876 based on Foata normal form. 120/2868 useless extension candidates. Maximal degree in co-relation 6849. Up to 3294 conditions per place. [2023-08-04 05:37:04,134 INFO L140 encePairwiseOnDemand]: 245/249 looper letters, 29 selfloop transitions, 2 changer transitions 1/39 dead transitions. [2023-08-04 05:37:04,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 155 flow [2023-08-04 05:37:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:37:04,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:37:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2023-08-04 05:37:04,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073627844712182 [2023-08-04 05:37:04,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 379 transitions. [2023-08-04 05:37:04,155 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 379 transitions. [2023-08-04 05:37:04,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:37:04,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 379 transitions. [2023-08-04 05:37:04,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have 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:37:04,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have 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:37:04,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have 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:37:04,170 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 85 flow. Second operand 3 states and 379 transitions. [2023-08-04 05:37:04,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 155 flow [2023-08-04 05:37:04,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 39 transitions, 155 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:37:04,176 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 91 flow [2023-08-04 05:37:04,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=83, 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=91, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-04 05:37:04,183 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, 3 predicate places. [2023-08-04 05:37:04,183 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 91 flow [2023-08-04 05:37:04,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have 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:37:04,184 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:37:04,184 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:37:04,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:37:04,184 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:37:04,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:37:04,193 INFO L85 PathProgramCache]: Analyzing trace with hash -948375718, now seen corresponding path program 1 times [2023-08-04 05:37:04,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:37:04,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056138649] [2023-08-04 05:37:04,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:37:04,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:37:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:37:04,323 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:37:04,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:37:04,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056138649] [2023-08-04 05:37:04,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056138649] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:37:04,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884691435] [2023-08-04 05:37:04,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:37:04,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:37:04,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:37:04,328 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:37:04,340 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:37:04,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:37:04,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:37:04,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:37:04,458 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:37:04,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:37:04,472 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:37:04,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884691435] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:37:04,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:37:04,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:37:04,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360948041] [2023-08-04 05:37:04,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:37:04,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:37:04,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:37:04,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:37:04,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:37:04,489 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 249 [2023-08-04 05:37:04,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 91 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have 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:37:04,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:37:04,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 249 [2023-08-04 05:37:04,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:37:04,511 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 05:37:04,511 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 05:37:04,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59 conditions, 21 events. 6/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 30 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 52. Up to 14 conditions per place. [2023-08-04 05:37:04,512 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 05:37:04,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 12 transitions, 55 flow [2023-08-04 05:37:04,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:37:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:37:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-04 05:37:04,514 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46987951807228917 [2023-08-04 05:37:04,514 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-04 05:37:04,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-04 05:37:04,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:37:04,515 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-04 05:37:04,516 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have 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:37:04,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have 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:37:04,518 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 249.0) internal successors, (1245), 5 states have internal predecessors, (1245), 0 states have call successors, (0), 0 states have 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:37:04,519 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 91 flow. Second operand 4 states and 468 transitions. [2023-08-04 05:37:04,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 12 transitions, 55 flow [2023-08-04 05:37:04,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 16 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-04 05:37:04,519 INFO L231 Difference]: Finished difference. Result has 16 places, 0 transitions, 0 flow [2023-08-04 05:37:04,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=13, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=16, PETRI_TRANSITIONS=0} [2023-08-04 05:37:04,520 INFO L281 CegarLoopForPetriNet]: 42 programPoint places, -26 predicate places. [2023-08-04 05:37:04,520 INFO L495 AbstractCegarLoop]: Abstraction has has 16 places, 0 transitions, 0 flow [2023-08-04 05:37:04,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have 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:37:04,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:37:04,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:37:04,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:37:04,532 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:37:04,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:37:04,729 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:37:04,731 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:37:04,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 135 transitions, 285 flow [2023-08-04 05:37:04,772 INFO L124 PetriNetUnfolderBase]: 30/460 cut-off events. [2023-08-04 05:37:04,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:37:04,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 460 events. 30/460 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2057 event pairs, 0 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 277. Up to 16 conditions per place. [2023-08-04 05:37:04,774 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 135 transitions, 285 flow [2023-08-04 05:37:04,775 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 111 places, 106 transitions, 227 flow [2023-08-04 05:37:04,775 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:37:04,775 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 111 places, 106 transitions, 227 flow [2023-08-04 05:37:04,776 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 111 places, 106 transitions, 227 flow [2023-08-04 05:37:04,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 111 places, 106 transitions, 227 flow [2023-08-04 05:37:04,794 INFO L124 PetriNetUnfolderBase]: 6/228 cut-off events. [2023-08-04 05:37:04,794 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:37:04,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 228 events. 6/228 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 693 event pairs, 0 based on Foata normal form. 0/214 useless extension candidates. Maximal degree in co-relation 161. Up to 8 conditions per place. [2023-08-04 05:37:04,797 INFO L119 LiptonReduction]: Number of co-enabled transitions 1632 [2023-08-04 05:37:07,571 INFO L134 LiptonReduction]: Checked pairs total: 3789 [2023-08-04 05:37:07,571 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-08-04 05:37:07,573 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:37:07,574 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;@137cd358, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:37:07,574 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:37:07,577 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:37:07,577 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2023-08-04 05:37:07,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:37:07,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:37:07,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:37:07,577 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:37:07,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:37:07,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1761543771, now seen corresponding path program 1 times [2023-08-04 05:37:07,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:37:07,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804562963] [2023-08-04 05:37:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:37:07,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:37:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:37:07,644 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:37:07,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:37:07,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804562963] [2023-08-04 05:37:07,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804562963] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:37:07,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:37:07,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:37:07,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352554120] [2023-08-04 05:37:07,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:37:07,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:37:07,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:37:07,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:37:07,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:37:07,662 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 220 [2023-08-04 05:37:07,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have 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:37:07,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:37:07,663 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 220 [2023-08-04 05:37:07,663 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:37:07,795 INFO L124 PetriNetUnfolderBase]: 669/1118 cut-off events. [2023-08-04 05:37:07,795 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-04 05:37:07,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2306 conditions, 1118 events. 669/1118 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5208 event pairs, 568 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 2289. Up to 1066 conditions per place. [2023-08-04 05:37:07,803 INFO L140 encePairwiseOnDemand]: 217/220 looper letters, 25 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-04 05:37:07,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 31 transitions, 131 flow [2023-08-04 05:37:07,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:37:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:37:07,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2023-08-04 05:37:07,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5651515151515152 [2023-08-04 05:37:07,805 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 373 transitions. [2023-08-04 05:37:07,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 373 transitions. [2023-08-04 05:37:07,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:37:07,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 373 transitions. [2023-08-04 05:37:07,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have 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:37:07,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:37:07,808 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 220.0) internal successors, (880), 4 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have 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:37:07,808 INFO L175 Difference]: Start difference. First operand has 34 places, 27 transitions, 69 flow. Second operand 3 states and 373 transitions. [2023-08-04 05:37:07,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 31 transitions, 131 flow [2023-08-04 05:37:07,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 31 transitions, 131 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:37:07,810 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 77 flow [2023-08-04 05:37:07,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=220, PETRI_DIFFERENCE_MINUEND_FLOW=69, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-04 05:37:07,812 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 3 predicate places. [2023-08-04 05:37:07,813 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 77 flow [2023-08-04 05:37:07,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have 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:37:07,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:37:07,813 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:37:07,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-04 05:37:07,814 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 05:37:07,814 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:37:07,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1758770540, now seen corresponding path program 1 times [2023-08-04 05:37:07,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:37:07,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450396664] [2023-08-04 05:37:07,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:37:07,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:37:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:37:07,847 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:37:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:37:07,888 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:37:07,888 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:37:07,889 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:37:07,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:37:07,889 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:37:07,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:37:07,889 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 05:37:07,890 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:37:07,890 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:37:07,890 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:37:07,915 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:37:07,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 171 places, 163 transitions, 362 flow [2023-08-04 05:37:08,066 INFO L124 PetriNetUnfolderBase]: 93/1414 cut-off events. [2023-08-04 05:37:08,066 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:37:08,077 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1512 conditions, 1414 events. 93/1414 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9883 event pairs, 0 based on Foata normal form. 0/1249 useless extension candidates. Maximal degree in co-relation 1028. Up to 54 conditions per place. [2023-08-04 05:37:08,077 INFO L82 GeneralOperation]: Start removeDead. Operand has 171 places, 163 transitions, 362 flow [2023-08-04 05:37:08,086 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 162 transitions, 356 flow [2023-08-04 05:37:08,087 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:37:08,087 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 170 places, 162 transitions, 356 flow [2023-08-04 05:37:08,087 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 170 places, 162 transitions, 356 flow [2023-08-04 05:37:08,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 162 transitions, 356 flow [2023-08-04 05:37:08,254 INFO L124 PetriNetUnfolderBase]: 93/1413 cut-off events. [2023-08-04 05:37:08,255 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2023-08-04 05:37:08,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1413 events. 93/1413 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 9867 event pairs, 0 based on Foata normal form. 0/1248 useless extension candidates. Maximal degree in co-relation 1025. Up to 54 conditions per place. [2023-08-04 05:37:08,283 INFO L119 LiptonReduction]: Number of co-enabled transitions 7532 [2023-08-04 05:37:11,689 INFO L134 LiptonReduction]: Checked pairs total: 25572 [2023-08-04 05:37:11,690 INFO L136 LiptonReduction]: Total number of compositions: 118 [2023-08-04 05:37:11,692 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:37:11,693 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;@137cd358, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:37:11,693 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:37:11,695 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:37:11,695 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-08-04 05:37:11,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:37:11,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:37:11,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 05:37:11,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:37:11,696 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:37:11,696 INFO L85 PathProgramCache]: Analyzing trace with hash 930678913, now seen corresponding path program 1 times [2023-08-04 05:37:11,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:37:11,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511551114] [2023-08-04 05:37:11,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:37:11,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:37:11,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:37:11,737 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:37:11,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:37:11,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511551114] [2023-08-04 05:37:11,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511551114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:37:11,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:37:11,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:37:11,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721059618] [2023-08-04 05:37:11,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:37:11,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:37:11,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:37:11,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:37:11,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:37:11,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 281 [2023-08-04 05:37:11,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 59 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have 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:37:11,749 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:37:11,749 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 281 [2023-08-04 05:37:11,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:38:09,456 INFO L124 PetriNetUnfolderBase]: 468866/629702 cut-off events. [2023-08-04 05:38:09,457 INFO L125 PetriNetUnfolderBase]: For 9284/9284 co-relation queries the response was YES. [2023-08-04 05:38:11,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1228752 conditions, 629702 events. 468866/629702 cut-off events. For 9284/9284 co-relation queries the response was YES. Maximal size of possible extension queue 19716. Compared 4966549 event pairs, 380024 based on Foata normal form. 13020/547574 useless extension candidates. Maximal degree in co-relation 264683. Up to 587323 conditions per place. [2023-08-04 05:38:13,927 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 44 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-04 05:38:13,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 63 transitions, 250 flow [2023-08-04 05:38:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:38:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:38:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-08-04 05:38:13,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5373665480427047 [2023-08-04 05:38:13,929 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-08-04 05:38:13,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-08-04 05:38:13,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:38:13,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-08-04 05:38:13,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have 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:38:13,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:38:13,933 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:38:13,933 INFO L175 Difference]: Start difference. First operand has 71 places, 59 transitions, 150 flow. Second operand 3 states and 453 transitions. [2023-08-04 05:38:13,933 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 63 transitions, 250 flow [2023-08-04 05:38:13,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 63 transitions, 246 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-04 05:38:13,951 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 156 flow [2023-08-04 05:38:13,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2023-08-04 05:38:13,953 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 3 predicate places. [2023-08-04 05:38:13,953 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 156 flow [2023-08-04 05:38:13,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have 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:38:13,954 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:38:13,954 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:38:13,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:38:13,954 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:38:13,954 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:38:13,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1525073244, now seen corresponding path program 1 times [2023-08-04 05:38:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:38:13,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798758208] [2023-08-04 05:38:13,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:38:13,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:38:13,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:38:14,004 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:38:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:38:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798758208] [2023-08-04 05:38:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798758208] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:38:14,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672234396] [2023-08-04 05:38:14,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:38:14,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:38:14,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:38:14,008 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:38:14,009 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:38:14,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:38:14,093 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:38:14,094 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:38:14,105 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:38:14,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:38:14,117 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:38:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672234396] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:38:14,118 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:38:14,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 05:38:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705502289] [2023-08-04 05:38:14,118 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:38:14,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 05:38:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:38:14,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 05:38:14,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 05:38:14,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 281 [2023-08-04 05:38:14,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have 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:38:14,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:38:14,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 281 [2023-08-04 05:38:14,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:39:03,444 INFO L124 PetriNetUnfolderBase]: 389314/518238 cut-off events. [2023-08-04 05:39:03,444 INFO L125 PetriNetUnfolderBase]: For 6296/6296 co-relation queries the response was YES. [2023-08-04 05:39:05,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010687 conditions, 518238 events. 389314/518238 cut-off events. For 6296/6296 co-relation queries the response was YES. Maximal size of possible extension queue 16570. Compared 3923144 event pairs, 247180 based on Foata normal form. 4/442210 useless extension candidates. Maximal degree in co-relation 264509. Up to 484009 conditions per place. [2023-08-04 05:39:07,829 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 49 selfloop transitions, 3 changer transitions 1/70 dead transitions. [2023-08-04 05:39:07,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 284 flow [2023-08-04 05:39:07,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:39:07,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:39:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2023-08-04 05:39:07,832 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5249110320284698 [2023-08-04 05:39:07,832 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2023-08-04 05:39:07,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2023-08-04 05:39:07,833 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:39:07,833 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2023-08-04 05:39:07,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.5) internal successors, (590), 4 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have 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:39:07,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:39:07,837 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have 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:39:07,837 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 156 flow. Second operand 4 states and 590 transitions. [2023-08-04 05:39:07,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 284 flow [2023-08-04 05:39:07,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 70 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:39:07,839 INFO L231 Difference]: Finished difference. Result has 78 places, 59 transitions, 168 flow [2023-08-04 05:39:07,839 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=78, PETRI_TRANSITIONS=59} [2023-08-04 05:39:07,840 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 7 predicate places. [2023-08-04 05:39:07,840 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 59 transitions, 168 flow [2023-08-04 05:39:07,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 136.0) internal successors, (544), 4 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have 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:39:07,840 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:39:07,841 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:39:07,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-04 05:39:08,049 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,SelfDestructingSolverStorable5 [2023-08-04 05:39:08,050 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:39:08,050 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:39:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash 975429256, now seen corresponding path program 1 times [2023-08-04 05:39:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:39:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385327287] [2023-08-04 05:39:08,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:39:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:39:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:39:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:39:08,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:39:08,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385327287] [2023-08-04 05:39:08,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385327287] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:39:08,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:39:08,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:39:08,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433677203] [2023-08-04 05:39:08,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:39:08,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:39:08,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:39:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:39:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:39:08,197 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 281 [2023-08-04 05:39:08,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 59 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:39:08,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:39:08,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 281 [2023-08-04 05:39:08,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:39:46,905 INFO L124 PetriNetUnfolderBase]: 335018/466967 cut-off events. [2023-08-04 05:39:46,906 INFO L125 PetriNetUnfolderBase]: For 5808/5808 co-relation queries the response was YES. [2023-08-04 05:39:48,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 891080 conditions, 466967 events. 335018/466967 cut-off events. For 5808/5808 co-relation queries the response was YES. Maximal size of possible extension queue 14276. Compared 3864753 event pairs, 55274 based on Foata normal form. 0/405607 useless extension candidates. Maximal degree in co-relation 424861. Up to 383649 conditions per place. [2023-08-04 05:39:50,235 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 67 selfloop transitions, 3 changer transitions 0/87 dead transitions. [2023-08-04 05:39:50,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 87 transitions, 377 flow [2023-08-04 05:39:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:39:50,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:39:50,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 485 transitions. [2023-08-04 05:39:50,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.575326215895611 [2023-08-04 05:39:50,237 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 485 transitions. [2023-08-04 05:39:50,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 485 transitions. [2023-08-04 05:39:50,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:39:50,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 485 transitions. [2023-08-04 05:39:50,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:39:50,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:39:50,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:39:50,240 INFO L175 Difference]: Start difference. First operand has 78 places, 59 transitions, 168 flow. Second operand 3 states and 485 transitions. [2023-08-04 05:39:50,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 87 transitions, 377 flow [2023-08-04 05:39:50,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 87 transitions, 370 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:39:50,243 INFO L231 Difference]: Finished difference. Result has 78 places, 61 transitions, 182 flow [2023-08-04 05:39:50,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=75, 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=182, PETRI_PLACES=78, PETRI_TRANSITIONS=61} [2023-08-04 05:39:50,243 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 7 predicate places. [2023-08-04 05:39:50,243 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 61 transitions, 182 flow [2023-08-04 05:39:50,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:39:50,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:39:50,244 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:39:50,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 05:39:50,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:39:50,244 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:39:50,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1098191882, now seen corresponding path program 1 times [2023-08-04 05:39:50,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:39:50,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760839226] [2023-08-04 05:39:50,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:39:50,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:39:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:39:50,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:39:50,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:39:50,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760839226] [2023-08-04 05:39:50,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760839226] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:39:50,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:39:50,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:39:50,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987289891] [2023-08-04 05:39:50,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:39:50,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:39:50,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:39:50,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:39:50,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:39:50,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 281 [2023-08-04 05:39:50,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 61 transitions, 182 flow. Second operand has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have 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:39:50,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:39:50,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 281 [2023-08-04 05:39:50,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:40:31,213 INFO L124 PetriNetUnfolderBase]: 326858/437623 cut-off events. [2023-08-04 05:40:31,214 INFO L125 PetriNetUnfolderBase]: For 32441/32441 co-relation queries the response was YES. [2023-08-04 05:40:33,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906232 conditions, 437623 events. 326858/437623 cut-off events. For 32441/32441 co-relation queries the response was YES. Maximal size of possible extension queue 15233. Compared 3365650 event pairs, 274810 based on Foata normal form. 0/385803 useless extension candidates. Maximal degree in co-relation 433189. Up to 406153 conditions per place. [2023-08-04 05:40:34,639 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 53 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2023-08-04 05:40:34,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 72 transitions, 317 flow [2023-08-04 05:40:34,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:40:34,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:40:34,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-04 05:40:34,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5432977461447213 [2023-08-04 05:40:34,642 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-04 05:40:34,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-04 05:40:34,642 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:40:34,642 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-04 05:40:34,643 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:40:34,644 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:34,645 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have 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:34,645 INFO L175 Difference]: Start difference. First operand has 78 places, 61 transitions, 182 flow. Second operand 3 states and 458 transitions. [2023-08-04 05:40:34,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 72 transitions, 317 flow [2023-08-04 05:40:34,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 72 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:40:34,655 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 191 flow [2023-08-04 05:40:34,655 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=77, 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=191, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2023-08-04 05:40:34,656 INFO L281 CegarLoopForPetriNet]: 71 programPoint places, 9 predicate places. [2023-08-04 05:40:34,656 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 191 flow [2023-08-04 05:40:34,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have 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:34,656 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:34,657 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:40:34,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 05:40:34,657 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:40:34,657 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:34,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1188324188, now seen corresponding path program 1 times [2023-08-04 05:40:34,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:34,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28110549] [2023-08-04 05:40:34,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:34,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:40:34,672 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:40:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:40:34,691 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:40:34,691 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:40:34,691 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:40:34,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:40:34,691 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:40:34,692 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:40:34,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:40:34,692 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 05:40:34,692 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:40:34,694 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:40:34,694 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:40:34,747 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:40:34 BasicIcfg [2023-08-04 05:40:34,747 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:40:34,748 INFO L158 Benchmark]: Toolchain (without parser) took 216634.78ms. Allocated memory was 346.0MB in the beginning and 16.0GB in the end (delta: 15.7GB). Free memory was 295.2MB in the beginning and 12.1GB in the end (delta: -11.8GB). Peak memory consumption was 3.9GB. Max. memory is 16.0GB. [2023-08-04 05:40:34,748 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 346.0MB. Free memory was 300.1MB in the beginning and 299.9MB in the end (delta: 169.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:40:34,748 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.71ms. Allocated memory is still 346.0MB. Free memory was 295.2MB in the beginning and 271.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:40:34,748 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.62ms. Allocated memory is still 346.0MB. Free memory was 271.5MB in the beginning and 268.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 05:40:34,749 INFO L158 Benchmark]: Boogie Preprocessor took 30.26ms. Allocated memory is still 346.0MB. Free memory was 268.7MB in the beginning and 266.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:40:34,749 INFO L158 Benchmark]: RCFGBuilder took 638.24ms. Allocated memory was 346.0MB in the beginning and 490.7MB in the end (delta: 144.7MB). Free memory was 266.2MB in the beginning and 428.9MB in the end (delta: -162.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.0GB. [2023-08-04 05:40:34,749 INFO L158 Benchmark]: TraceAbstraction took 215397.88ms. Allocated memory was 490.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 428.1MB in the beginning and 12.1GB in the end (delta: -11.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. [2023-08-04 05:40:34,751 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 346.0MB. Free memory was 300.1MB in the beginning and 299.9MB in the end (delta: 169.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 498.71ms. Allocated memory is still 346.0MB. Free memory was 295.2MB in the beginning and 271.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 61.62ms. Allocated memory is still 346.0MB. Free memory was 271.5MB in the beginning and 268.7MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.26ms. Allocated memory is still 346.0MB. Free memory was 268.7MB in the beginning and 266.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 638.24ms. Allocated memory was 346.0MB in the beginning and 490.7MB in the end (delta: 144.7MB). Free memory was 266.2MB in the beginning and 428.9MB in the end (delta: -162.6MB). Peak memory consumption was 15.9MB. Max. memory is 16.0GB. * TraceAbstraction took 215397.88ms. Allocated memory was 490.7MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 428.1MB in the beginning and 12.1GB in the end (delta: -11.7GB). Peak memory consumption was 3.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 136 PlacesBefore, 42 PlacesAfterwards, 134 TransitionsBefore, 36 TransitionsAfterwards, 3068 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 4 ChoiceCompositions, 114 TotalNumberOfCompositions, 8044 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4454, independent: 4266, independent conditional: 0, independent unconditional: 4266, 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: 1631, independent: 1605, independent conditional: 0, independent unconditional: 1605, dependent: 26, dependent conditional: 0, dependent unconditional: 26, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4454, independent: 2661, independent conditional: 0, independent unconditional: 2661, dependent: 162, dependent conditional: 0, dependent unconditional: 162, unknown: 1631, unknown conditional: 0, unknown unconditional: 1631] , Statistics on independence cache: Total cache size (in pairs): 195, Positive cache size: 180, Positive conditional cache size: 0, Positive unconditional cache size: 180, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.8s, 111 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 27 TransitionsAfterwards, 1632 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 35 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 3789 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1871, independent: 1748, independent conditional: 0, independent unconditional: 1748, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 845, independent: 829, independent conditional: 0, independent unconditional: 829, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1871, independent: 919, independent conditional: 0, independent unconditional: 919, dependent: 107, dependent conditional: 0, dependent unconditional: 107, unknown: 845, unknown conditional: 0, unknown unconditional: 845] , Statistics on independence cache: Total cache size (in pairs): 90, Positive cache size: 81, Positive conditional cache size: 0, Positive unconditional cache size: 81, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 170 PlacesBefore, 71 PlacesAfterwards, 162 TransitionsBefore, 59 TransitionsAfterwards, 7532 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 118 TotalNumberOfCompositions, 25572 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8533, independent: 8160, independent conditional: 0, independent unconditional: 8160, dependent: 373, dependent conditional: 0, dependent unconditional: 373, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3525, independent: 3473, independent conditional: 0, independent unconditional: 3473, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8533, independent: 4687, independent conditional: 0, independent unconditional: 4687, dependent: 321, dependent conditional: 0, dependent unconditional: 321, unknown: 3525, unknown conditional: 0, unknown unconditional: 3525] , Statistics on independence cache: Total cache size (in pairs): 452, Positive cache size: 423, Positive conditional cache size: 0, Positive unconditional cache size: 423, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L724] 0 _Bool x$flush_delayed; [L725] 0 int x$mem_tmp; [L726] 0 _Bool x$r_buff0_thd0; [L727] 0 _Bool x$r_buff0_thd1; [L728] 0 _Bool x$r_buff0_thd2; [L729] 0 _Bool x$r_buff0_thd3; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$read_delayed; [L735] 0 int *x$read_delayed_var; [L736] 0 int x$w_buff0; [L737] 0 _Bool x$w_buff0_used; [L738] 0 int x$w_buff1; [L739] 0 _Bool x$w_buff1_used; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L835] 0 pthread_t t299[2]; [L836] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t299[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299[asdf], ((void *)0), P0, ((void *)0))=-4, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] COND TRUE 0 asdf<2 [L836] FCALL, FORK 0 pthread_create(&t299[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t299[asdf], ((void *)0), P0, ((void *)0))=-3, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L836] COND FALSE 0 !(asdf<2) [L837] 0 pthread_t t300[2]; [L838] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t300[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300[asdf], ((void *)0), P1, ((void *)0))=-2, t299={5:0}, t300={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L769] 3 x$w_buff1 = x$w_buff0 [L770] 3 x$w_buff0 = 2 [L771] 3 x$w_buff1_used = x$w_buff0_used [L772] 3 x$w_buff0_used = (_Bool)1 [L773] CALL 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L773] RET 3 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L774] 3 x$r_buff1_thd0 = x$r_buff0_thd0 [L775] 3 x$r_buff1_thd1 = x$r_buff0_thd1 [L776] 3 x$r_buff1_thd2 = x$r_buff0_thd2 [L777] 3 x$r_buff1_thd3 = x$r_buff0_thd3 [L778] 3 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t299={5:0}, t300={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L838] COND TRUE 0 asdf<2 [L838] FCALL, FORK 0 pthread_create(&t300[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t300[asdf], ((void *)0), P1, ((void *)0))=-1, t299={5:0}, t300={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L769] 4 x$w_buff1 = x$w_buff0 [L770] 4 x$w_buff0 = 2 [L771] 4 x$w_buff1_used = x$w_buff0_used [L772] 4 x$w_buff0_used = (_Bool)1 [L773] CALL 4 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND TRUE 4 !expression [L18] 4 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=2, x$w_buff1_used=1, 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, 159 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 24 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 99 IncrementalHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 8 mSDtfsCounter, 99 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=1, InterpolantAutomatonStates: 7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 51 SizeOfPredicates, 0 NumberOfNonLiveVariables, 159 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 4 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3 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, 187 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: 206.8s, OverallIterations: 5, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 202.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 92 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 63 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 353 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 3 mSDtfsCounter, 353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=4, InterpolantAutomatonStates: 13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 112 SizeOfPredicates, 0 NumberOfNonLiveVariables, 160 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 12/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 for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 159 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 7 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 56 IncrementalHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 7 mSDtfsCounter, 56 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 12 NumberOfCodeBlocks, 12 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 5 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 05:40:34,779 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...