/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix015.opt_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 05:40:39,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 05:40:39,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 05:40:39,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 05:40:39,813 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 05:40:39,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 05:40:39,814 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 05:40:39,854 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 05:40:39,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 05:40:39,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 05:40:39,859 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 05:40:39,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 05:40:39,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 05:40:39,862 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 05:40:39,862 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 05:40:39,862 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 05:40:39,862 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 05:40:39,863 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 05:40:39,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 05:40:39,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 05:40:39,863 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 05:40:39,864 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 05:40:39,864 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 05:40:39,864 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 05:40:39,864 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 05:40:39,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 05:40:39,865 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 05:40:39,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 05:40:39,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 05:40:39,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 05:40:39,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:40:39,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 05:40:39,867 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 05:40:39,867 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 05:40:39,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 05:40:39,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 05:40:39,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 05:40:39,868 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 05:40:39,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 05:40:39,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 05:40:39,869 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 05:40:39,869 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-04 05:40:40,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 05:40:40,133 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 05:40:40,136 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 05:40:40,137 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 05:40:40,137 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 05:40:40,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix015.opt_bound2.i [2023-08-04 05:40:41,332 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 05:40:41,533 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 05:40:41,534 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix015.opt_bound2.i [2023-08-04 05:40:41,556 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9623af0b4/2b57cca3a96b4befbee8fe40aa7bf963/FLAGf25c2f56c [2023-08-04 05:40:41,573 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9623af0b4/2b57cca3a96b4befbee8fe40aa7bf963 [2023-08-04 05:40:41,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 05:40:41,580 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 05:40:41,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 05:40:41,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 05:40:41,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 05:40:41,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:40:41" (1/1) ... [2023-08-04 05:40:41,587 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76d877dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:41, skipping insertion in model container [2023-08-04 05:40:41,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 05:40:41" (1/1) ... [2023-08-04 05:40:41,645 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 05:40:41,797 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix015.opt_bound2.i[944,957] [2023-08-04 05:40:41,980 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:40:41,991 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 05:40:42,002 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_mix015.opt_bound2.i[944,957] [2023-08-04 05:40:42,010 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:40:42,013 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-04 05:40:42,046 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 05:40:42,080 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:40:42,080 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 05:40:42,086 INFO L206 MainTranslator]: Completed translation [2023-08-04 05:40:42,086 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42 WrapperNode [2023-08-04 05:40:42,086 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 05:40:42,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 05:40:42,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 05:40:42,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 05:40:42,094 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,118 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,153 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2023-08-04 05:40:42,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 05:40:42,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 05:40:42,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 05:40:42,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 05:40:42,163 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,163 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,179 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,182 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,197 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 05:40:42,198 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 05:40:42,198 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 05:40:42,198 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 05:40:42,199 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (1/1) ... [2023-08-04 05:40:42,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 05:40:42,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:40:42,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-04 05:40:42,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-04 05:40:42,282 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 05:40:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 05:40:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 05:40:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 05:40:42,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 05:40:42,285 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-04 05:40:42,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-04 05:40:42,285 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-04 05:40:42,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-04 05:40:42,285 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-04 05:40:42,286 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-04 05:40:42,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 05:40:42,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 05:40:42,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 05:40:42,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 05:40:42,287 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 05:40:42,459 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 05:40:42,461 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 05:40:42,790 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 05:40:42,924 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 05:40:42,924 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-04 05:40:42,927 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:40:42 BoogieIcfgContainer [2023-08-04 05:40:42,927 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 05:40:42,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 05:40:42,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 05:40:42,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 05:40:42,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 05:40:41" (1/3) ... [2023-08-04 05:40:42,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8a419c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:40:42, skipping insertion in model container [2023-08-04 05:40:42,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 05:40:42" (2/3) ... [2023-08-04 05:40:42,936 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d8a419c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 05:40:42, skipping insertion in model container [2023-08-04 05:40:42,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 05:40:42" (3/3) ... [2023-08-04 05:40:42,937 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_mix015.opt_bound2.i [2023-08-04 05:40:42,944 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 05:40:42,951 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 05:40:42,951 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-04 05:40:42,951 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 05:40:42,991 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:40:43,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:40:43,154 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-04 05:40:43,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:43,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 458 events. 30/458 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2014 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 271. Up to 16 conditions per place. [2023-08-04 05:40:43,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:40:43,171 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 134 places, 132 transitions, 275 flow [2023-08-04 05:40:43,174 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:40:43,186 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 132 transitions, 275 flow [2023-08-04 05:40:43,188 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 132 transitions, 275 flow [2023-08-04 05:40:43,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 132 transitions, 275 flow [2023-08-04 05:40:43,243 INFO L124 PetriNetUnfolderBase]: 30/455 cut-off events. [2023-08-04 05:40:43,243 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:43,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 477 conditions, 455 events. 30/455 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1974 event pairs, 0 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 265. Up to 16 conditions per place. [2023-08-04 05:40:43,250 INFO L119 LiptonReduction]: Number of co-enabled transitions 2758 [2023-08-04 05:40:46,760 INFO L134 LiptonReduction]: Checked pairs total: 6826 [2023-08-04 05:40:46,760 INFO L136 LiptonReduction]: Total number of compositions: 113 [2023-08-04 05:40:46,772 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:40:46,778 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;@5e295088, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:40:46,778 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:40:46,782 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:40:46,783 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2023-08-04 05:40:46,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:46,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:46,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:40:46,784 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:40:46,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:46,789 INFO L85 PathProgramCache]: Analyzing trace with hash 367908104, now seen corresponding path program 1 times [2023-08-04 05:40:46,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:46,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914574657] [2023-08-04 05:40:46,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:46,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:47,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:40:47,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:47,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914574657] [2023-08-04 05:40:47,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914574657] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:40:47,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:40:47,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:40:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35798144] [2023-08-04 05:40:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:40:47,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:40:47,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:47,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:40:47,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:40:47,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247 [2023-08-04 05:40:47,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 77 flow. Second operand has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:47,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:47,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247 [2023-08-04 05:40:47,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:40:47,640 INFO L124 PetriNetUnfolderBase]: 2546/3981 cut-off events. [2023-08-04 05:40:47,641 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 05:40:47,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7904 conditions, 3981 events. 2546/3981 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 21534 event pairs, 1893 based on Foata normal form. 140/3437 useless extension candidates. Maximal degree in co-relation 7891. Up to 3851 conditions per place. [2023-08-04 05:40:47,668 INFO L140 encePairwiseOnDemand]: 243/247 looper letters, 30 selfloop transitions, 2 changer transitions 1/36 dead transitions. [2023-08-04 05:40:47,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 149 flow [2023-08-04 05:40:47,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:40:47,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:40:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-04 05:40:47,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-08-04 05:40:47,686 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-04 05:40:47,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-04 05:40:47,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:40:47,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-04 05:40:47,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 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:47,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:47,698 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:47,700 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 77 flow. Second operand 3 states and 380 transitions. [2023-08-04 05:40:47,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 149 flow [2023-08-04 05:40:47,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 36 transitions, 149 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 05:40:47,704 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 83 flow [2023-08-04 05:40:47,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2023-08-04 05:40:47,709 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 3 predicate places. [2023-08-04 05:40:47,709 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 83 flow [2023-08-04 05:40:47,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.0) internal successors, (351), 3 states have internal predecessors, (351), 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:47,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:47,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:40:47,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 05:40:47,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:40:47,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:47,711 INFO L85 PathProgramCache]: Analyzing trace with hash -523120528, now seen corresponding path program 1 times [2023-08-04 05:40:47,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:47,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796296712] [2023-08-04 05:40:47,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:47,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:40:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796296712] [2023-08-04 05:40:47,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796296712] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:40:47,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610167904] [2023-08-04 05:40:47,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:47,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:40:47,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:40:47,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:40:47,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 05:40:47,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:47,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:40:47,903 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:40:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:40:47,935 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:40:47,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610167904] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:40:47,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:40:47,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:40:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210308860] [2023-08-04 05:40:47,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:40:47,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:40:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:40:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:40:47,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 247 [2023-08-04 05:40:47,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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:47,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:47,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 247 [2023-08-04 05:40:47,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:40:48,329 INFO L124 PetriNetUnfolderBase]: 2200/3393 cut-off events. [2023-08-04 05:40:48,330 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-08-04 05:40:48,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6733 conditions, 3393 events. 2200/3393 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17297 event pairs, 1414 based on Foata normal form. 0/2865 useless extension candidates. Maximal degree in co-relation 6717. Up to 3221 conditions per place. [2023-08-04 05:40:48,346 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 33 selfloop transitions, 2 changer transitions 1/39 dead transitions. [2023-08-04 05:40:48,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 39 transitions, 169 flow [2023-08-04 05:40:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:40:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:40:48,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-04 05:40:48,357 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5155195681511471 [2023-08-04 05:40:48,357 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-04 05:40:48,357 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-04 05:40:48,357 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:40:48,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-04 05:40:48,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 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:48,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:48,362 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 247.0) internal successors, (988), 4 states have internal predecessors, (988), 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:48,362 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 83 flow. Second operand 3 states and 382 transitions. [2023-08-04 05:40:48,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 39 transitions, 169 flow [2023-08-04 05:40:48,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 165 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 05:40:48,364 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 87 flow [2023-08-04 05:40:48,365 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2023-08-04 05:40:48,365 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, 4 predicate places. [2023-08-04 05:40:48,365 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 87 flow [2023-08-04 05:40:48,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 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:48,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:48,366 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:40:48,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 05:40:48,571 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:40:48,571 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 05:40:48,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:48,572 INFO L85 PathProgramCache]: Analyzing trace with hash 359921435, now seen corresponding path program 1 times [2023-08-04 05:40:48,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:48,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512438447] [2023-08-04 05:40:48,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:48,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:40:48,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512438447] [2023-08-04 05:40:48,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512438447] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:40:48,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422847990] [2023-08-04 05:40:48,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:48,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:40:48,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:40:48,688 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:40:48,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 05:40:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:48,776 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:40:48,777 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:40:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:40:48,805 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:40:48,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:40:48,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422847990] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:40:48,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:40:48,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 05:40:48,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067259973] [2023-08-04 05:40:48,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:40:48,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:40:48,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:48,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:40:48,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:40:48,845 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 247 [2023-08-04 05:40:48,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 87 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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:48,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:48,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 247 [2023-08-04 05:40:48,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:40:48,864 INFO L124 PetriNetUnfolderBase]: 6/21 cut-off events. [2023-08-04 05:40:48,864 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-04 05:40:48,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55 conditions, 21 events. 6/21 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 29 event pairs, 0 based on Foata normal form. 4/25 useless extension candidates. Maximal degree in co-relation 47. Up to 14 conditions per place. [2023-08-04 05:40:48,864 INFO L140 encePairwiseOnDemand]: 244/247 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 05:40:48,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 19 places, 12 transitions, 51 flow [2023-08-04 05:40:48,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:40:48,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:40:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 468 transitions. [2023-08-04 05:40:48,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47368421052631576 [2023-08-04 05:40:48,866 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 468 transitions. [2023-08-04 05:40:48,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 468 transitions. [2023-08-04 05:40:48,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:40:48,867 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 468 transitions. [2023-08-04 05:40:48,868 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:40:48,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:48,870 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 247.0) internal successors, (1235), 5 states have internal predecessors, (1235), 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:48,870 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 87 flow. Second operand 4 states and 468 transitions. [2023-08-04 05:40:48,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 19 places, 12 transitions, 51 flow [2023-08-04 05:40:48,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 18 places, 12 transitions, 49 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:40:48,871 INFO L231 Difference]: Finished difference. Result has 18 places, 0 transitions, 0 flow [2023-08-04 05:40:48,871 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=247, PETRI_DIFFERENCE_MINUEND_FLOW=19, PETRI_DIFFERENCE_MINUEND_PLACES=15, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=8, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=8, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=18, PETRI_TRANSITIONS=0} [2023-08-04 05:40:48,872 INFO L281 CegarLoopForPetriNet]: 39 programPoint places, -21 predicate places. [2023-08-04 05:40:48,872 INFO L495 AbstractCegarLoop]: Abstraction has has 18 places, 0 transitions, 0 flow [2023-08-04 05:40:48,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 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:48,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-08-04 05:40:48,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-08-04 05:40:48,875 INFO L805 garLoopResultBuilder]: Registering result SAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-08-04 05:40:48,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 05:40:49,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 05:40:49,081 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2023-08-04 05:40:49,083 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE,SAFE,SAFE (1/2) [2023-08-04 05:40:49,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:40:49,125 INFO L124 PetriNetUnfolderBase]: 30/458 cut-off events. [2023-08-04 05:40:49,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:49,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 458 events. 30/458 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2014 event pairs, 0 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 271. Up to 16 conditions per place. [2023-08-04 05:40:49,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 136 places, 134 transitions, 283 flow [2023-08-04 05:40:49,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 110 places, 105 transitions, 225 flow [2023-08-04 05:40:49,129 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:40:49,129 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 105 transitions, 225 flow [2023-08-04 05:40:49,129 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 105 transitions, 225 flow [2023-08-04 05:40:49,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 105 transitions, 225 flow [2023-08-04 05:40:49,147 INFO L124 PetriNetUnfolderBase]: 6/226 cut-off events. [2023-08-04 05:40:49,147 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:49,147 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 226 events. 6/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 657 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 155. Up to 8 conditions per place. [2023-08-04 05:40:49,149 INFO L119 LiptonReduction]: Number of co-enabled transitions 1468 [2023-08-04 05:40:52,019 INFO L134 LiptonReduction]: Checked pairs total: 3203 [2023-08-04 05:40:52,019 INFO L136 LiptonReduction]: Total number of compositions: 85 [2023-08-04 05:40:52,021 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 05:40:52,021 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;@5e295088, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:40:52,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 05:40:52,024 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:40:52,024 INFO L124 PetriNetUnfolderBase]: 0/19 cut-off events. [2023-08-04 05:40:52,024 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 05:40:52,024 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:52,024 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 05:40:52,024 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:40:52,025 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:52,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1416725705, now seen corresponding path program 1 times [2023-08-04 05:40:52,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:52,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524325545] [2023-08-04 05:40:52,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:52,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:40:52,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:40:52,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:40:52,094 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:40:52,097 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:40:52,098 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 05:40:52,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 05:40:52,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 05:40:52,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-04 05:40:52,099 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 05:40:52,100 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 05:40:52,100 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 05:40:52,100 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 05:40:52,126 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-04 05:40:52,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 160 transitions, 356 flow [2023-08-04 05:40:52,268 INFO L124 PetriNetUnfolderBase]: 93/1411 cut-off events. [2023-08-04 05:40:52,268 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-04 05:40:52,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1509 conditions, 1411 events. 93/1411 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9769 event pairs, 0 based on Foata normal form. 0/1234 useless extension candidates. Maximal degree in co-relation 1016. Up to 54 conditions per place. [2023-08-04 05:40:52,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 160 transitions, 356 flow [2023-08-04 05:40:52,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 166 places, 158 transitions, 344 flow [2023-08-04 05:40:52,280 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 05:40:52,281 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 166 places, 158 transitions, 344 flow [2023-08-04 05:40:52,281 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 166 places, 158 transitions, 344 flow [2023-08-04 05:40:52,281 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 158 transitions, 344 flow [2023-08-04 05:40:52,411 INFO L124 PetriNetUnfolderBase]: 93/1407 cut-off events. [2023-08-04 05:40:52,412 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-08-04 05:40:52,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 1407 events. 93/1407 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 9734 event pairs, 0 based on Foata normal form. 0/1230 useless extension candidates. Maximal degree in co-relation 1010. Up to 54 conditions per place. [2023-08-04 05:40:52,447 INFO L119 LiptonReduction]: Number of co-enabled transitions 6708 [2023-08-04 05:40:55,741 INFO L134 LiptonReduction]: Checked pairs total: 22640 [2023-08-04 05:40:55,741 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-04 05:40:55,743 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 05:40:55,744 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;@5e295088, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 05:40:55,744 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-08-04 05:40:55,763 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 05:40:55,764 INFO L124 PetriNetUnfolderBase]: 1/24 cut-off events. [2023-08-04 05:40:55,764 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 05:40:55,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:40:55,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-04 05:40:55,764 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:40:55,765 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:40:55,765 INFO L85 PathProgramCache]: Analyzing trace with hash -976646856, now seen corresponding path program 1 times [2023-08-04 05:40:55,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:40:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455585087] [2023-08-04 05:40:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:40:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:40:55,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:40:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 05:40:55,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:40:55,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455585087] [2023-08-04 05:40:55,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455585087] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:40:55,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:40:55,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 05:40:55,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074967816] [2023-08-04 05:40:55,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:40:55,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:40:55,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:40:55,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:40:55,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:40:55,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-04 05:40:55,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:55,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:40:55,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-04 05:40:55,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:41:40,317 INFO L124 PetriNetUnfolderBase]: 378842/490049 cut-off events. [2023-08-04 05:41:40,317 INFO L125 PetriNetUnfolderBase]: For 5241/5241 co-relation queries the response was YES. [2023-08-04 05:41:41,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 973252 conditions, 490049 events. 378842/490049 cut-off events. For 5241/5241 co-relation queries the response was YES. Maximal size of possible extension queue 18489. Compared 3504948 event pairs, 346158 based on Foata normal form. 10836/435723 useless extension candidates. Maximal degree in co-relation 280833. Up to 476892 conditions per place. [2023-08-04 05:41:43,671 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 43 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 05:41:43,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 57 transitions, 232 flow [2023-08-04 05:41:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:41:43,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:41:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2023-08-04 05:41:43,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5328554360812425 [2023-08-04 05:41:43,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2023-08-04 05:41:43,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2023-08-04 05:41:43,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:41:43,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2023-08-04 05:41:43,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 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:41:43,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:41:43,678 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:41:43,678 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 136 flow. Second operand 3 states and 446 transitions. [2023-08-04 05:41:43,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 57 transitions, 232 flow [2023-08-04 05:41:43,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 57 transitions, 230 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-08-04 05:41:43,690 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 144 flow [2023-08-04 05:41:43,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2023-08-04 05:41:43,691 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 3 predicate places. [2023-08-04 05:41:43,691 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 144 flow [2023-08-04 05:41:43,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 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:41:43,692 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:41:43,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:41:43,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-04 05:41:43,692 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:41:43,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:41:43,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1661646330, now seen corresponding path program 1 times [2023-08-04 05:41:43,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:41:43,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940107480] [2023-08-04 05:41:43,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:41:43,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:41:43,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:41:43,731 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:41:43,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:41:43,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940107480] [2023-08-04 05:41:43,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940107480] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:41:43,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648751841] [2023-08-04 05:41:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:41:43,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:41:43,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:41:43,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:41:43,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 05:41:43,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:41:43,824 INFO L262 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 05:41:43,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:41:43,830 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:41:43,831 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 05:41:43,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648751841] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:41:43,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 05:41:43,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 05:41:43,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494492418] [2023-08-04 05:41:43,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:41:43,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:41:43,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:41:43,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:41:43,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:41:43,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-04 05:41:43,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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:41:43,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:41:43,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-04 05:41:43,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:42:24,517 INFO L124 PetriNetUnfolderBase]: 366838/477196 cut-off events. [2023-08-04 05:42:24,517 INFO L125 PetriNetUnfolderBase]: For 4347/4347 co-relation queries the response was YES. [2023-08-04 05:42:26,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 943673 conditions, 477196 events. 366838/477196 cut-off events. For 4347/4347 co-relation queries the response was YES. Maximal size of possible extension queue 18377. Compared 3448663 event pairs, 296770 based on Foata normal form. 0/416862 useless extension candidates. Maximal degree in co-relation 943634. Up to 460105 conditions per place. [2023-08-04 05:42:27,705 INFO L140 encePairwiseOnDemand]: 276/279 looper letters, 49 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-04 05:42:27,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 264 flow [2023-08-04 05:42:27,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:42:27,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:42:27,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 450 transitions. [2023-08-04 05:42:27,711 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5376344086021505 [2023-08-04 05:42:27,711 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 450 transitions. [2023-08-04 05:42:27,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 450 transitions. [2023-08-04 05:42:27,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:42:27,712 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 450 transitions. [2023-08-04 05:42:27,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.0) internal successors, (450), 3 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:42:27,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:42:27,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:42:27,718 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 144 flow. Second operand 3 states and 450 transitions. [2023-08-04 05:42:27,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 264 flow [2023-08-04 05:42:27,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 63 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:42:27,723 INFO L231 Difference]: Finished difference. Result has 71 places, 55 transitions, 154 flow [2023-08-04 05:42:27,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=154, PETRI_PLACES=71, PETRI_TRANSITIONS=55} [2023-08-04 05:42:27,725 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 5 predicate places. [2023-08-04 05:42:27,725 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 55 transitions, 154 flow [2023-08-04 05:42:27,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:42:27,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:42:27,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:42:27,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 05:42:27,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:42:27,931 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:42:27,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:42:27,932 INFO L85 PathProgramCache]: Analyzing trace with hash 220299750, now seen corresponding path program 1 times [2023-08-04 05:42:27,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:42:27,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002893963] [2023-08-04 05:42:27,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:42:27,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:42:27,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:42:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:42:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:42:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002893963] [2023-08-04 05:42:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002893963] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:42:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646100273] [2023-08-04 05:42:27,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:42:27,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:42:27,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:42:27,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:42:27,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 05:42:28,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:42:28,073 INFO L262 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:42:28,074 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:42:28,084 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:42:28,084 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:42:28,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 05:42:28,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646100273] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:42:28,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:42:28,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-08-04 05:42:28,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121155681] [2023-08-04 05:42:28,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:42:28,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 05:42:28,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:42:28,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 05:42:28,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 05:42:28,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 279 [2023-08-04 05:42:28,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 55 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:42:28,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:42:28,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 279 [2023-08-04 05:42:28,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:42:59,340 INFO L124 PetriNetUnfolderBase]: 286810/369844 cut-off events. [2023-08-04 05:42:59,340 INFO L125 PetriNetUnfolderBase]: For 3584/3584 co-relation queries the response was YES. [2023-08-04 05:43:00,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731805 conditions, 369844 events. 286810/369844 cut-off events. For 3584/3584 co-relation queries the response was YES. Maximal size of possible extension queue 15527. Compared 2579569 event pairs, 216748 based on Foata normal form. 3/324942 useless extension candidates. Maximal degree in co-relation 259486. Up to 356836 conditions per place. [2023-08-04 05:43:02,285 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 47 selfloop transitions, 3 changer transitions 1/63 dead transitions. [2023-08-04 05:43:02,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 63 transitions, 272 flow [2023-08-04 05:43:02,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:43:02,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:43:02,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 579 transitions. [2023-08-04 05:43:02,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5188172043010753 [2023-08-04 05:43:02,287 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 579 transitions. [2023-08-04 05:43:02,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 579 transitions. [2023-08-04 05:43:02,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:43:02,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 579 transitions. [2023-08-04 05:43:02,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.75) internal successors, (579), 4 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:02,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:02,292 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:02,292 INFO L175 Difference]: Start difference. First operand has 71 places, 55 transitions, 154 flow. Second operand 4 states and 579 transitions. [2023-08-04 05:43:02,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 63 transitions, 272 flow [2023-08-04 05:43:02,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 63 transitions, 270 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:43:02,297 INFO L231 Difference]: Finished difference. Result has 75 places, 55 transitions, 166 flow [2023-08-04 05:43:02,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=75, PETRI_TRANSITIONS=55} [2023-08-04 05:43:02,300 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 9 predicate places. [2023-08-04 05:43:02,300 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 55 transitions, 166 flow [2023-08-04 05:43:02,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:02,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:43:02,300 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:43:02,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 05:43:02,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:43:02,509 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:43:02,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:43:02,510 INFO L85 PathProgramCache]: Analyzing trace with hash 563361299, now seen corresponding path program 1 times [2023-08-04 05:43:02,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:43:02,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161963172] [2023-08-04 05:43:02,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:43:02,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:43:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:43:02,600 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:43:02,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:43:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161963172] [2023-08-04 05:43:02,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161963172] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 05:43:02,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166048591] [2023-08-04 05:43:02,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:43:02,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:43:02,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 05:43:02,603 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 05:43:02,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 05:43:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:43:02,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 05:43:02,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 05:43:02,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:43:02,713 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 05:43:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-04 05:43:02,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166048591] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 05:43:02,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 05:43:02,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 05:43:02,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530047415] [2023-08-04 05:43:02,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 05:43:02,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 05:43:02,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:43:02,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 05:43:02,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 05:43:02,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 279 [2023-08-04 05:43:02,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 55 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:02,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:43:02,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 279 [2023-08-04 05:43:02,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:43:28,314 INFO L124 PetriNetUnfolderBase]: 238048/304663 cut-off events. [2023-08-04 05:43:28,315 INFO L125 PetriNetUnfolderBase]: For 2637/2637 co-relation queries the response was YES. [2023-08-04 05:43:29,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603022 conditions, 304663 events. 238048/304663 cut-off events. For 2637/2637 co-relation queries the response was YES. Maximal size of possible extension queue 13620. Compared 2047088 event pairs, 153634 based on Foata normal form. 36/268684 useless extension candidates. Maximal degree in co-relation 213463. Up to 292876 conditions per place. [2023-08-04 05:43:30,549 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 58 selfloop transitions, 3 changer transitions 1/74 dead transitions. [2023-08-04 05:43:30,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 74 transitions, 328 flow [2023-08-04 05:43:30,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 05:43:30,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 05:43:30,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 590 transitions. [2023-08-04 05:43:30,551 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5286738351254481 [2023-08-04 05:43:30,551 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 590 transitions. [2023-08-04 05:43:30,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 590 transitions. [2023-08-04 05:43:30,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:43:30,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 590 transitions. [2023-08-04 05:43:30,552 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:43:30,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:30,554 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 279.0) internal successors, (1395), 5 states have internal predecessors, (1395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:30,554 INFO L175 Difference]: Start difference. First operand has 75 places, 55 transitions, 166 flow. Second operand 4 states and 590 transitions. [2023-08-04 05:43:30,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 74 transitions, 328 flow [2023-08-04 05:43:30,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 74 transitions, 321 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:43:30,557 INFO L231 Difference]: Finished difference. Result has 77 places, 55 transitions, 173 flow [2023-08-04 05:43:30,557 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=77, PETRI_TRANSITIONS=55} [2023-08-04 05:43:30,557 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-04 05:43:30,558 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 55 transitions, 173 flow [2023-08-04 05:43:30,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.4) internal successors, (677), 5 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:30,558 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:43:30,558 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:43:30,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 05:43:30,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 05:43:30,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:43:30,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:43:30,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1174919860, now seen corresponding path program 1 times [2023-08-04 05:43:30,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:43:30,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297370034] [2023-08-04 05:43:30,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:43:30,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:43:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:43:30,914 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 05:43:30,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:43:30,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297370034] [2023-08-04 05:43:30,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297370034] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:43:30,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:43:30,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 05:43:30,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410623539] [2023-08-04 05:43:30,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:43:30,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:43:30,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:43:30,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:43:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:43:30,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 279 [2023-08-04 05:43:30,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 55 transitions, 173 flow. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:30,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:43:30,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 279 [2023-08-04 05:43:30,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:43:53,323 INFO L124 PetriNetUnfolderBase]: 214312/276031 cut-off events. [2023-08-04 05:43:53,323 INFO L125 PetriNetUnfolderBase]: For 3502/3502 co-relation queries the response was YES. [2023-08-04 05:43:54,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 544830 conditions, 276031 events. 214312/276031 cut-off events. For 3502/3502 co-relation queries the response was YES. Maximal size of possible extension queue 12718. Compared 1869802 event pairs, 34888 based on Foata normal form. 0/248797 useless extension candidates. Maximal degree in co-relation 192882. Up to 249409 conditions per place. [2023-08-04 05:43:55,287 INFO L140 encePairwiseOnDemand]: 274/279 looper letters, 61 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2023-08-04 05:43:55,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 348 flow [2023-08-04 05:43:55,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:43:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:43:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 472 transitions. [2023-08-04 05:43:55,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5639187574671446 [2023-08-04 05:43:55,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 472 transitions. [2023-08-04 05:43:55,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 472 transitions. [2023-08-04 05:43:55,289 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:43:55,289 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 472 transitions. [2023-08-04 05:43:55,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:55,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:55,292 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:55,292 INFO L175 Difference]: Start difference. First operand has 77 places, 55 transitions, 173 flow. Second operand 3 states and 472 transitions. [2023-08-04 05:43:55,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 348 flow [2023-08-04 05:43:55,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 76 transitions, 341 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 05:43:55,296 INFO L231 Difference]: Finished difference. Result has 77 places, 57 transitions, 187 flow [2023-08-04 05:43:55,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=77, PETRI_TRANSITIONS=57} [2023-08-04 05:43:55,297 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 11 predicate places. [2023-08-04 05:43:55,297 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 57 transitions, 187 flow [2023-08-04 05:43:55,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:55,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:43:55,297 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:43:55,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 05:43:55,298 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:43:55,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:43:55,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2063503753, now seen corresponding path program 1 times [2023-08-04 05:43:55,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:43:55,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944015903] [2023-08-04 05:43:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:43:55,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:43:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 05:43:55,354 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 05:43:55,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 05:43:55,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944015903] [2023-08-04 05:43:55,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944015903] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 05:43:55,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 05:43:55,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 05:43:55,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935867160] [2023-08-04 05:43:55,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 05:43:55,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 05:43:55,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 05:43:55,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 05:43:55,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 05:43:55,367 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 279 [2023-08-04 05:43:55,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 57 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:43:55,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 05:43:55,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 279 [2023-08-04 05:43:55,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 05:44:20,759 INFO L124 PetriNetUnfolderBase]: 211864/270127 cut-off events. [2023-08-04 05:44:20,760 INFO L125 PetriNetUnfolderBase]: For 14101/14101 co-relation queries the response was YES. [2023-08-04 05:44:21,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564406 conditions, 270127 events. 211864/270127 cut-off events. For 14101/14101 co-relation queries the response was YES. Maximal size of possible extension queue 12584. Compared 1774638 event pairs, 174592 based on Foata normal form. 0/242029 useless extension candidates. Maximal degree in co-relation 199215. Up to 257980 conditions per place. [2023-08-04 05:44:22,917 INFO L140 encePairwiseOnDemand]: 275/279 looper letters, 59 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2023-08-04 05:44:22,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 73 transitions, 344 flow [2023-08-04 05:44:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 05:44:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 05:44:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 458 transitions. [2023-08-04 05:44:22,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5471923536439666 [2023-08-04 05:44:22,919 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 458 transitions. [2023-08-04 05:44:22,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 458 transitions. [2023-08-04 05:44:22,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 05:44:22,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 458 transitions. [2023-08-04 05:44:22,920 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:44:22,921 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:44:22,921 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 279.0) internal successors, (1116), 4 states have internal predecessors, (1116), 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:44:22,921 INFO L175 Difference]: Start difference. First operand has 77 places, 57 transitions, 187 flow. Second operand 3 states and 458 transitions. [2023-08-04 05:44:22,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 73 transitions, 344 flow [2023-08-04 05:44:22,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 73 transitions, 340 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 05:44:22,930 INFO L231 Difference]: Finished difference. Result has 79 places, 58 transitions, 198 flow [2023-08-04 05:44:22,930 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2023-08-04 05:44:22,931 INFO L281 CegarLoopForPetriNet]: 66 programPoint places, 13 predicate places. [2023-08-04 05:44:22,931 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 58 transitions, 198 flow [2023-08-04 05:44:22,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 05:44:22,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 05:44:22,931 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:44:22,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 05:44:22,931 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2023-08-04 05:44:22,932 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 05:44:22,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1027649930, now seen corresponding path program 1 times [2023-08-04 05:44:22,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 05:44:22,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426282827] [2023-08-04 05:44:22,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 05:44:22,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 05:44:22,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:44:22,954 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 05:44:22,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 05:44:22,979 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 05:44:22,979 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 05:44:22,979 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2023-08-04 05:44:22,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 4 remaining) [2023-08-04 05:44:22,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 4 remaining) [2023-08-04 05:44:22,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 4 remaining) [2023-08-04 05:44:22,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-04 05:44:22,980 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 05:44:22,980 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-04 05:44:22,982 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 05:44:22,982 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 05:44:23,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 05:44:23 BasicIcfg [2023-08-04 05:44:23,060 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 05:44:23,061 INFO L158 Benchmark]: Toolchain (without parser) took 221481.53ms. Allocated memory was 482.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 430.2MB in the beginning and 13.2GB in the end (delta: -12.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-04 05:44:23,061 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 341.8MB. Free memory was 290.5MB in the beginning and 290.4MB in the end (delta: 133.0kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 05:44:23,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 504.47ms. Allocated memory is still 482.3MB. Free memory was 429.9MB in the beginning and 405.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 05:44:23,062 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.27ms. Allocated memory is still 482.3MB. Free memory was 405.6MB in the beginning and 402.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-04 05:44:23,062 INFO L158 Benchmark]: Boogie Preprocessor took 42.59ms. Allocated memory is still 482.3MB. Free memory was 402.9MB in the beginning and 400.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 05:44:23,062 INFO L158 Benchmark]: RCFGBuilder took 729.66ms. Allocated memory is still 482.3MB. Free memory was 400.5MB in the beginning and 423.0MB in the end (delta: -22.4MB). Peak memory consumption was 23.3MB. Max. memory is 16.0GB. [2023-08-04 05:44:23,062 INFO L158 Benchmark]: TraceAbstraction took 220130.36ms. Allocated memory was 482.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 423.0MB in the beginning and 13.2GB in the end (delta: -12.7GB). Peak memory consumption was 2.8GB. Max. memory is 16.0GB. [2023-08-04 05:44:23,063 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.13ms. Allocated memory is still 341.8MB. Free memory was 290.5MB in the beginning and 290.4MB in the end (delta: 133.0kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 504.47ms. Allocated memory is still 482.3MB. Free memory was 429.9MB in the beginning and 405.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 66.27ms. Allocated memory is still 482.3MB. Free memory was 405.6MB in the beginning and 402.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 42.59ms. Allocated memory is still 482.3MB. Free memory was 402.9MB in the beginning and 400.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 729.66ms. Allocated memory is still 482.3MB. Free memory was 400.5MB in the beginning and 423.0MB in the end (delta: -22.4MB). Peak memory consumption was 23.3MB. Max. memory is 16.0GB. * TraceAbstraction took 220130.36ms. Allocated memory was 482.3MB in the beginning and 16.0GB in the end (delta: 15.5GB). Free memory was 423.0MB in the beginning and 13.2GB in the end (delta: -12.7GB). Peak memory consumption was 2.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, 134 PlacesBefore, 39 PlacesAfterwards, 132 TransitionsBefore, 33 TransitionsAfterwards, 2758 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 113 TotalNumberOfCompositions, 6826 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3180, independent: 2989, independent conditional: 0, independent unconditional: 2989, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1447, independent: 1416, independent conditional: 0, independent unconditional: 1416, dependent: 31, dependent conditional: 0, dependent unconditional: 31, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3180, independent: 1573, independent conditional: 0, independent unconditional: 1573, dependent: 160, dependent conditional: 0, dependent unconditional: 160, unknown: 1447, unknown conditional: 0, unknown unconditional: 1447] , Statistics on independence cache: Total cache size (in pairs): 136, Positive cache size: 120, Positive conditional cache size: 0, Positive unconditional cache size: 120, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 110 PlacesBefore, 33 PlacesAfterwards, 105 TransitionsBefore, 26 TransitionsAfterwards, 1468 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 85 TotalNumberOfCompositions, 3203 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1940, independent: 1815, independent conditional: 0, independent unconditional: 1815, dependent: 125, dependent conditional: 0, dependent unconditional: 125, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 768, independent: 751, independent conditional: 0, independent unconditional: 751, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1940, independent: 1064, independent conditional: 0, independent unconditional: 1064, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 768, unknown conditional: 0, unknown unconditional: 768] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 79, Positive conditional cache size: 0, Positive unconditional cache size: 79, Negative cache size: 7, Negative conditional cache size: 0, Negative unconditional cache size: 7, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 166 PlacesBefore, 66 PlacesAfterwards, 158 TransitionsBefore, 54 TransitionsAfterwards, 6708 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 4 ChoiceCompositions, 119 TotalNumberOfCompositions, 22640 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7277, independent: 6908, independent conditional: 0, independent unconditional: 6908, dependent: 369, dependent conditional: 0, dependent unconditional: 369, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3123, independent: 3072, independent conditional: 0, independent unconditional: 3072, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7277, independent: 3836, independent conditional: 0, independent unconditional: 3836, dependent: 318, dependent conditional: 0, dependent unconditional: 318, unknown: 3123, unknown conditional: 0, unknown unconditional: 3123] , Statistics on independence cache: Total cache size (in pairs): 323, Positive cache size: 297, Positive conditional cache size: 0, Positive unconditional cache size: 297, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t388[2]; [L854] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t388={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] COND TRUE 0 asdf<2 [L854] FCALL, FORK 0 pthread_create(&t388[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t388[asdf], ((void *)0), P0, ((void *)0))=-1, t388={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t388={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] COND TRUE 0 asdf<2 [L854] FCALL, FORK 0 pthread_create(&t388[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t388[asdf], ((void *)0), P0, ((void *)0))=0, t388={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t388={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L854] COND FALSE 0 !(asdf<2) [L855] 0 pthread_t t389[2]; [L856] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t388={6:0}, t389={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] COND TRUE 0 asdf<2 [L856] FCALL, FORK 0 pthread_create(&t389[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t389[asdf], ((void *)0), P1, ((void *)0))=1, t388={6:0}, t389={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t388={6:0}, t389={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] COND TRUE 0 asdf<2 [L856] FCALL, FORK 0 pthread_create(&t389[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t389[asdf], ((void *)0), P1, ((void *)0))=2, t388={6:0}, t389={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t388={6:0}, t389={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] COND FALSE 0 !(asdf<2) [L857] 0 pthread_t t390[2]; [L858] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t388={6:0}, t389={7:0}, t390={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] COND TRUE 0 asdf<2 [L858] FCALL, FORK 0 pthread_create(&t390[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=0, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t390[asdf], ((void *)0), P2, ((void *)0))=3, t388={6:0}, t389={7:0}, t390={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 5 z$w_buff1 = z$w_buff0 [L801] 5 z$w_buff0 = 1 [L802] 5 z$w_buff1_used = z$w_buff0_used [L803] 5 z$w_buff0_used = (_Bool)1 [L804] CALL 5 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 5 !(!expression) [L804] RET 5 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 5 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 5 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 5 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 5 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 5 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t388={6:0}, t389={7:0}, t390={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] COND TRUE 0 asdf<2 [L858] FCALL, FORK 0 pthread_create(&t390[asdf], ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, asdf=1, asdf=2, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t390[asdf], ((void *)0), P2, ((void *)0))=4, t388={6:0}, t389={7:0}, t390={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L800] 6 z$w_buff1 = z$w_buff0 [L801] 6 z$w_buff0 = 1 [L802] 6 z$w_buff1_used = z$w_buff0_used [L803] 6 z$w_buff0_used = (_Bool)1 [L804] CALL 6 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND TRUE 6 !expression [L18] 6 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=1, z$w_buff1_used=1, z=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.1s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 69 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 37 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 170 IncrementalHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 15 mSDtfsCounter, 170 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 48 NumberOfCodeBlocks, 48 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 90 SizeOfPredicates, 0 NumberOfNonLiveVariables, 369 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 10 procedures, 182 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: 210.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 205.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 163 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 106 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 590 IncrementalHoareTripleChecker+Invalid, 614 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 17 mSDtfsCounter, 590 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=6, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 162 NumberOfCodeBlocks, 162 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 274 SizeOfPredicates, 0 NumberOfNonLiveVariables, 585 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 46/53 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 7 procedures, 156 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.0s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-04 05:44:23,084 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...