/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 TOGETHER -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi005_bound2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-03 17:46:59,052 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-03 17:46:59,091 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-03 17:46:59,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-03 17:46:59,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-03 17:46:59,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-03 17:46:59,101 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-03 17:46:59,133 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-03 17:46:59,133 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-03 17:46:59,137 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-03 17:46:59,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-03 17:46:59,138 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-03 17:46:59,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-03 17:46:59,138 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-03 17:46:59,138 INFO L153 SettingsManager]: * Use SBE=true [2023-08-03 17:46:59,138 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-03 17:46:59,139 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-03 17:46:59,139 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-03 17:46:59,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-03 17:46:59,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-03 17:46:59,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-03 17:46:59,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-03 17:46:59,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-03 17:46:59,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-03 17:46:59,141 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-03 17:46:59,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-03 17:46:59,141 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-03 17:46:59,142 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-03 17:46:59,142 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-03 17:46:59,142 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-03 17:46:59,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:46:59,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-03 17:46:59,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-03 17:46:59,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-03 17:46:59,143 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-03 17:46:59,143 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-03 17:46:59,143 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-03 17:46:59,143 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-03 17:46:59,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-03 17:46:59,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-03 17:46:59,143 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-03 17:46:59,145 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 -> TOGETHER [2023-08-03 17:46:59,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-03 17:46:59,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-03 17:46:59,322 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-03 17:46:59,322 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-03 17:46:59,323 INFO L274 PluginConnector]: CDTParser initialized [2023-08-03 17:46:59,323 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi005_bound2.i [2023-08-03 17:47:00,212 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-03 17:47:00,404 INFO L384 CDTParser]: Found 1 translation units. [2023-08-03 17:47:00,404 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/pthread-wmm_rfi005_bound2.i [2023-08-03 17:47:00,414 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577bdeb75/b259e5c8c6594921a5c47c7159b9fce2/FLAG64748a852 [2023-08-03 17:47:00,422 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/577bdeb75/b259e5c8c6594921a5c47c7159b9fce2 [2023-08-03 17:47:00,424 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-03 17:47:00,425 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-03 17:47:00,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-03 17:47:00,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-03 17:47:00,427 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-03 17:47:00,428 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,428 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2463f903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00, skipping insertion in model container [2023-08-03 17:47:00,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,460 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-03 17:47:00,556 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_rfi005_bound2.i[983,996] [2023-08-03 17:47:00,696 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:47:00,702 INFO L201 MainTranslator]: Completed pre-run [2023-08-03 17:47:00,709 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_rfi005_bound2.i[983,996] [2023-08-03 17:47:00,715 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:47:00,716 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-03 17:47:00,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-03 17:47:00,773 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:47:00,774 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-03 17:47:00,779 INFO L206 MainTranslator]: Completed translation [2023-08-03 17:47:00,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00 WrapperNode [2023-08-03 17:47:00,780 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-03 17:47:00,781 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-03 17:47:00,781 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-03 17:47:00,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-03 17:47:00,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,814 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,837 INFO L138 Inliner]: procedures = 175, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 184 [2023-08-03 17:47:00,837 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-03 17:47:00,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-03 17:47:00,837 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-03 17:47:00,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-03 17:47:00,850 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,850 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,853 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,853 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,859 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,861 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,864 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,867 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-03 17:47:00,867 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-03 17:47:00,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-03 17:47:00,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-03 17:47:00,868 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (1/1) ... [2023-08-03 17:47:00,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-03 17:47:00,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:47:00,889 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-03 17:47:00,894 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-03 17:47:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-03 17:47:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-03 17:47:00,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-03 17:47:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-03 17:47:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-03 17:47:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-03 17:47:00,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-03 17:47:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-03 17:47:00,914 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-03 17:47:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-03 17:47:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-03 17:47:00,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-03 17:47:00,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-03 17:47:00,915 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-03 17:47:01,017 INFO L236 CfgBuilder]: Building ICFG [2023-08-03 17:47:01,018 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-03 17:47:01,294 INFO L277 CfgBuilder]: Performing block encoding [2023-08-03 17:47:01,387 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-03 17:47:01,387 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-08-03 17:47:01,390 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:47:01 BoogieIcfgContainer [2023-08-03 17:47:01,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-03 17:47:01,392 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-03 17:47:01,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-03 17:47:01,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-03 17:47:01,394 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.08 05:47:00" (1/3) ... [2023-08-03 17:47:01,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9f9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:47:01, skipping insertion in model container [2023-08-03 17:47:01,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.08 05:47:00" (2/3) ... [2023-08-03 17:47:01,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19e9f9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.08 05:47:01, skipping insertion in model container [2023-08-03 17:47:01,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.08 05:47:01" (3/3) ... [2023-08-03 17:47:01,398 INFO L112 eAbstractionObserver]: Analyzing ICFG pthread-wmm_rfi005_bound2.i [2023-08-03 17:47:01,403 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-03 17:47:01,409 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-03 17:47:01,409 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-08-03 17:47:01,409 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-03 17:47:01,445 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:47:01,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 17:47:01,536 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-03 17:47:01,536 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:47:01,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 643 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-03 17:47:01,541 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 17:47:01,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 106 places, 105 transitions, 220 flow [2023-08-03 17:47:01,547 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:47:01,558 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 106 places, 105 transitions, 220 flow [2023-08-03 17:47:01,560 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 106 places, 105 transitions, 220 flow [2023-08-03 17:47:01,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 105 transitions, 220 flow [2023-08-03 17:47:01,587 INFO L124 PetriNetUnfolderBase]: 14/224 cut-off events. [2023-08-03 17:47:01,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:47:01,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 224 events. 14/224 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 643 event pairs, 0 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-03 17:47:01,590 INFO L119 LiptonReduction]: Number of co-enabled transitions 1570 [2023-08-03 17:47:03,930 INFO L134 LiptonReduction]: Checked pairs total: 4088 [2023-08-03 17:47:03,930 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-03 17:47:03,938 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:47:03,942 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;@2b621dd7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:47:03,942 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-03 17:47:03,945 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:47:03,945 INFO L124 PetriNetUnfolderBase]: 1/13 cut-off events. [2023-08-03 17:47:03,945 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:47:03,945 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:47:03,945 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:47:03,946 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 17:47:03,948 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:47:03,949 INFO L85 PathProgramCache]: Analyzing trace with hash 542225849, now seen corresponding path program 1 times [2023-08-03 17:47:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:47:03,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401962890] [2023-08-03 17:47:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:47:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:47:04,084 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-03 17:47:04,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:47:04,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401962890] [2023-08-03 17:47:04,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401962890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:47:04,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:47:04,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:47:04,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100753917] [2023-08-03 17:47:04,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:47:04,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:47:04,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:47:04,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:47:04,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:47:04,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 197 [2023-08-03 17:47:04,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 28 transitions, 66 flow. Second operand has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-03 17:47:04,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:47:04,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 197 [2023-08-03 17:47:04,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:47:04,248 INFO L124 PetriNetUnfolderBase]: 470/848 cut-off events. [2023-08-03 17:47:04,248 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:47:04,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1674 conditions, 848 events. 470/848 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3778 event pairs, 224 based on Foata normal form. 36/700 useless extension candidates. Maximal degree in co-relation 1654. Up to 799 conditions per place. [2023-08-03 17:47:04,253 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 26 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-03 17:47:04,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 31 transitions, 128 flow [2023-08-03 17:47:04,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:47:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:47:04,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 285 transitions. [2023-08-03 17:47:04,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48223350253807107 [2023-08-03 17:47:04,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 285 transitions. [2023-08-03 17:47:04,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 285 transitions. [2023-08-03 17:47:04,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:47:04,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 285 transitions. [2023-08-03 17:47:04,277 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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-03 17:47:04,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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-03 17:47:04,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 197.0) internal successors, (788), 4 states have internal predecessors, (788), 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-03 17:47:04,281 INFO L175 Difference]: Start difference. First operand has 32 places, 28 transitions, 66 flow. Second operand 3 states and 285 transitions. [2023-08-03 17:47:04,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 31 transitions, 128 flow [2023-08-03 17:47:04,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-03 17:47:04,286 INFO L231 Difference]: Finished difference. Result has 35 places, 27 transitions, 72 flow [2023-08-03 17:47:04,287 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=35, PETRI_TRANSITIONS=27} [2023-08-03 17:47:04,289 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 3 predicate places. [2023-08-03 17:47:04,290 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 27 transitions, 72 flow [2023-08-03 17:47:04,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.66666666666667) internal successors, (260), 3 states have internal predecessors, (260), 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-03 17:47:04,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:47:04,290 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-03 17:47:04,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-03 17:47:04,290 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 4 more)] === [2023-08-03 17:47:04,291 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:47:04,291 INFO L85 PathProgramCache]: Analyzing trace with hash -359804759, now seen corresponding path program 1 times [2023-08-03 17:47:04,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:47:04,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498184601] [2023-08-03 17:47:04,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:04,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:47:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:47:04,321 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:47:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:47:04,351 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:47:04,351 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:47:04,352 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2023-08-03 17:47:04,353 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-03 17:47:04,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 7 remaining) [2023-08-03 17:47:04,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 7 remaining) [2023-08-03 17:47:04,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-03 17:47:04,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 7 remaining) [2023-08-03 17:47:04,354 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-03 17:47:04,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-03 17:47:04,354 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-03 17:47:04,356 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-03 17:47:04,356 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-03 17:47:04,374 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-03 17:47:04,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 17:47:04,428 INFO L124 PetriNetUnfolderBase]: 30/468 cut-off events. [2023-08-03 17:47:04,429 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:47:04,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 468 events. 30/468 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2030 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-03 17:47:04,430 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 17:47:04,431 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 124 transitions, 272 flow [2023-08-03 17:47:04,431 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-03 17:47:04,432 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 124 transitions, 272 flow [2023-08-03 17:47:04,432 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 124 transitions, 272 flow [2023-08-03 17:47:04,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 124 transitions, 272 flow [2023-08-03 17:47:04,463 INFO L124 PetriNetUnfolderBase]: 30/468 cut-off events. [2023-08-03 17:47:04,463 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-03 17:47:04,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 468 events. 30/468 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2030 event pairs, 0 based on Foata normal form. 0/405 useless extension candidates. Maximal degree in co-relation 335. Up to 18 conditions per place. [2023-08-03 17:47:04,469 INFO L119 LiptonReduction]: Number of co-enabled transitions 3776 [2023-08-03 17:47:06,832 INFO L134 LiptonReduction]: Checked pairs total: 12295 [2023-08-03 17:47:06,832 INFO L136 LiptonReduction]: Total number of compositions: 97 [2023-08-03 17:47:06,834 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-03 17:47:06,834 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;@2b621dd7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-03 17:47:06,834 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-03 17:47:06,836 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-03 17:47:06,837 INFO L124 PetriNetUnfolderBase]: 1/14 cut-off events. [2023-08-03 17:47:06,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-03 17:47:06,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:47:06,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-03 17:47:06,837 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-03 17:47:06,837 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:47:06,837 INFO L85 PathProgramCache]: Analyzing trace with hash 771287666, now seen corresponding path program 1 times [2023-08-03 17:47:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:47:06,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593871680] [2023-08-03 17:47:06,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:06,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:47:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:47:06,887 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-03 17:47:06,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:47:06,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593871680] [2023-08-03 17:47:06,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593871680] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:47:06,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:47:06,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-03 17:47:06,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858024682] [2023-08-03 17:47:06,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:47:06,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:47:06,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:47:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:47:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:47:06,900 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 221 [2023-08-03 17:47:06,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-03 17:47:06,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:47:06,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 221 [2023-08-03 17:47:06,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:47:11,202 INFO L124 PetriNetUnfolderBase]: 37938/53041 cut-off events. [2023-08-03 17:47:11,202 INFO L125 PetriNetUnfolderBase]: For 616/616 co-relation queries the response was YES. [2023-08-03 17:47:11,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104989 conditions, 53041 events. 37938/53041 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 1580. Compared 328778 event pairs, 28056 based on Foata normal form. 1460/43957 useless extension candidates. Maximal degree in co-relation 23097. Up to 51115 conditions per place. [2023-08-03 17:47:11,442 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 39 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-03 17:47:11,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 47 transitions, 200 flow [2023-08-03 17:47:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:47:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:47:11,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-03 17:47:11,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4947209653092006 [2023-08-03 17:47:11,445 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-03 17:47:11,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-03 17:47:11,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:47:11,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-03 17:47:11,447 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 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-03 17:47:11,449 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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-03 17:47:11,450 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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-03 17:47:11,450 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 110 flow. Second operand 3 states and 328 transitions. [2023-08-03 17:47:11,450 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 47 transitions, 200 flow [2023-08-03 17:47:11,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 47 transitions, 196 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-03 17:47:11,455 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 116 flow [2023-08-03 17:47:11,455 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-08-03 17:47:11,455 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-08-03 17:47:11,455 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 116 flow [2023-08-03 17:47:11,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-03 17:47:11,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:47:11,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:47:11,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-03 17:47:11,456 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-03 17:47:11,459 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:47:11,459 INFO L85 PathProgramCache]: Analyzing trace with hash -192531812, now seen corresponding path program 1 times [2023-08-03 17:47:11,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:47:11,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565678814] [2023-08-03 17:47:11,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:11,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:47:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:47:11,536 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-03 17:47:11,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:47:11,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565678814] [2023-08-03 17:47:11,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565678814] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:47:11,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666000291] [2023-08-03 17:47:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:11,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:47:11,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:47:11,541 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-03 17:47:11,544 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-03 17:47:11,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:47:11,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-03 17:47:11,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:47:11,630 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-03 17:47:11,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-03 17:47:11,642 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-03 17:47:11,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666000291] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-03 17:47:11,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-03 17:47:11,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-03 17:47:11,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419902054] [2023-08-03 17:47:11,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-03 17:47:11,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:47:11,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:47:11,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:47:11,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-03 17:47:11,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 221 [2023-08-03 17:47:11,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 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-03 17:47:11,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:47:11,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 221 [2023-08-03 17:47:11,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:47:15,181 INFO L124 PetriNetUnfolderBase]: 31938/44041 cut-off events. [2023-08-03 17:47:15,181 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2023-08-03 17:47:15,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87132 conditions, 44041 events. 31938/44041 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 1398. Compared 259790 event pairs, 16140 based on Foata normal form. 4/35629 useless extension candidates. Maximal degree in co-relation 23092. Up to 42409 conditions per place. [2023-08-03 17:47:15,366 INFO L140 encePairwiseOnDemand]: 217/221 looper letters, 44 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-08-03 17:47:15,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 234 flow [2023-08-03 17:47:15,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-03 17:47:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-03 17:47:15,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2023-08-03 17:47:15,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807692307692308 [2023-08-03 17:47:15,368 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2023-08-03 17:47:15,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2023-08-03 17:47:15,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:47:15,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2023-08-03 17:47:15,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 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-03 17:47:15,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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-03 17:47:15,371 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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-03 17:47:15,371 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 116 flow. Second operand 4 states and 425 transitions. [2023-08-03 17:47:15,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 234 flow [2023-08-03 17:47:15,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 54 transitions, 232 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-03 17:47:15,372 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 134 flow [2023-08-03 17:47:15,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-03 17:47:15,373 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-03 17:47:15,373 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 134 flow [2023-08-03 17:47:15,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.4) internal successors, (482), 5 states have internal predecessors, (482), 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-03 17:47:15,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:47:15,373 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-03 17:47:15,380 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-03 17:47:15,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:47:15,578 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-03 17:47:15,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:47:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash -148142165, now seen corresponding path program 1 times [2023-08-03 17:47:15,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:47:15,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241172721] [2023-08-03 17:47:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:47:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:47:15,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:47:15,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:47:15,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241172721] [2023-08-03 17:47:15,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241172721] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-03 17:47:15,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744587660] [2023-08-03 17:47:15,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:15,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:47:15,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-03 17:47:15,639 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-03 17:47:15,641 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-03 17:47:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:47:15,689 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-03 17:47:15,689 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-03 17:47:15,708 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-03 17:47:15,708 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-03 17:47:15,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744587660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:47:15,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-03 17:47:15,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-08-03 17:47:15,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386332836] [2023-08-03 17:47:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:47:15,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-03 17:47:15,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:47:15,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-03 17:47:15,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-03 17:47:15,722 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 221 [2023-08-03 17:47:15,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:47:15,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:47:15,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 221 [2023-08-03 17:47:15,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:47:18,914 INFO L124 PetriNetUnfolderBase]: 31914/43997 cut-off events. [2023-08-03 17:47:18,914 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2023-08-03 17:47:18,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87100 conditions, 43997 events. 31914/43997 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 1396. Compared 259485 event pairs, 16128 based on Foata normal form. 16/35597 useless extension candidates. Maximal degree in co-relation 23069. Up to 42408 conditions per place. [2023-08-03 17:47:19,073 INFO L140 encePairwiseOnDemand]: 218/221 looper letters, 44 selfloop transitions, 3 changer transitions 0/52 dead transitions. [2023-08-03 17:47:19,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 52 transitions, 240 flow [2023-08-03 17:47:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-03 17:47:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-03 17:47:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 518 transitions. [2023-08-03 17:47:19,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4687782805429864 [2023-08-03 17:47:19,075 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 518 transitions. [2023-08-03 17:47:19,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 518 transitions. [2023-08-03 17:47:19,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:47:19,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 518 transitions. [2023-08-03 17:47:19,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 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-03 17:47:19,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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-03 17:47:19,078 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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-03 17:47:19,078 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 134 flow. Second operand 5 states and 518 transitions. [2023-08-03 17:47:19,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 52 transitions, 240 flow [2023-08-03 17:47:19,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 52 transitions, 233 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-03 17:47:19,079 INFO L231 Difference]: Finished difference. Result has 58 places, 42 transitions, 123 flow [2023-08-03 17:47:19,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=58, PETRI_TRANSITIONS=42} [2023-08-03 17:47:19,080 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-03 17:47:19,080 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 42 transitions, 123 flow [2023-08-03 17:47:19,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-03 17:47:19,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:47:19,081 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:47:19,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-08-03 17:47:19,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-03 17:47:19,285 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-03 17:47:19,285 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:47:19,285 INFO L85 PathProgramCache]: Analyzing trace with hash -630877945, now seen corresponding path program 1 times [2023-08-03 17:47:19,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:47:19,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80007080] [2023-08-03 17:47:19,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:19,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:47:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-03 17:47:19,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-08-03 17:47:19,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-03 17:47:19,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80007080] [2023-08-03 17:47:19,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80007080] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-03 17:47:19,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-03 17:47:19,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-03 17:47:19,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985845087] [2023-08-03 17:47:19,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-03 17:47:19,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-03 17:47:19,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-03 17:47:19,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-03 17:47:19,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-03 17:47:19,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 221 [2023-08-03 17:47:19,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 42 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-03 17:47:19,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-03 17:47:19,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 221 [2023-08-03 17:47:19,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-03 17:47:22,466 INFO L124 PetriNetUnfolderBase]: 30090/41549 cut-off events. [2023-08-03 17:47:22,466 INFO L125 PetriNetUnfolderBase]: For 466/466 co-relation queries the response was YES. [2023-08-03 17:47:22,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82095 conditions, 41549 events. 30090/41549 cut-off events. For 466/466 co-relation queries the response was YES. Maximal size of possible extension queue 1364. Compared 244073 event pairs, 6426 based on Foata normal form. 0/34061 useless extension candidates. Maximal degree in co-relation 21745. Up to 38929 conditions per place. [2023-08-03 17:47:22,631 INFO L140 encePairwiseOnDemand]: 216/221 looper letters, 51 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2023-08-03 17:47:22,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 59 transitions, 270 flow [2023-08-03 17:47:22,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-03 17:47:22,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-03 17:47:22,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-03 17:47:22,633 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.526395173453997 [2023-08-03 17:47:22,633 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-03 17:47:22,633 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-03 17:47:22,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-03 17:47:22,633 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-03 17:47:22,634 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 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-03 17:47:22,635 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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-03 17:47:22,635 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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-03 17:47:22,635 INFO L175 Difference]: Start difference. First operand has 58 places, 42 transitions, 123 flow. Second operand 3 states and 349 transitions. [2023-08-03 17:47:22,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 59 transitions, 270 flow [2023-08-03 17:47:22,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 59 transitions, 265 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-03 17:47:22,637 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 139 flow [2023-08-03 17:47:22,637 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-08-03 17:47:22,638 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-08-03 17:47:22,638 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 139 flow [2023-08-03 17:47:22,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-03 17:47:22,638 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-03 17:47:22,638 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-03 17:47:22,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-03 17:47:22,638 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 6 more)] === [2023-08-03 17:47:22,638 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-03 17:47:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1917620885, now seen corresponding path program 1 times [2023-08-03 17:47:22,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-03 17:47:22,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721471896] [2023-08-03 17:47:22,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-03 17:47:22,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-03 17:47:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:47:22,649 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-03 17:47:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-03 17:47:22,661 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-03 17:47:22,661 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-03 17:47:22,661 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (8 of 9 remaining) [2023-08-03 17:47:22,661 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 9 remaining) [2023-08-03 17:47:22,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (6 of 9 remaining) [2023-08-03 17:47:22,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 9 remaining) [2023-08-03 17:47:22,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 9 remaining) [2023-08-03 17:47:22,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 9 remaining) [2023-08-03 17:47:22,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 9 remaining) [2023-08-03 17:47:22,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 9 remaining) [2023-08-03 17:47:22,662 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 9 remaining) [2023-08-03 17:47:22,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-03 17:47:22,662 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-03 17:47:22,665 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-03 17:47:22,665 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-03 17:47:22,701 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.08 05:47:22 BasicIcfg [2023-08-03 17:47:22,701 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-03 17:47:22,701 INFO L158 Benchmark]: Toolchain (without parser) took 22276.56ms. Allocated memory was 390.1MB in the beginning and 7.2GB in the end (delta: 6.8GB). Free memory was 328.5MB in the beginning and 5.3GB in the end (delta: -5.0GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-03 17:47:22,701 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 390.1MB. Free memory is still 339.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-03 17:47:22,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.43ms. Allocated memory is still 390.1MB. Free memory was 328.2MB in the beginning and 303.1MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-03 17:47:22,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.48ms. Allocated memory was 390.1MB in the beginning and 595.6MB in the end (delta: 205.5MB). Free memory was 303.1MB in the beginning and 560.4MB in the end (delta: -257.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. [2023-08-03 17:47:22,702 INFO L158 Benchmark]: Boogie Preprocessor took 29.37ms. Allocated memory is still 595.6MB. Free memory was 560.4MB in the beginning and 558.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-03 17:47:22,702 INFO L158 Benchmark]: RCFGBuilder took 523.02ms. Allocated memory is still 595.6MB. Free memory was 558.3MB in the beginning and 508.9MB in the end (delta: 49.4MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. [2023-08-03 17:47:22,702 INFO L158 Benchmark]: TraceAbstraction took 21308.79ms. Allocated memory was 595.6MB in the beginning and 7.2GB in the end (delta: 6.6GB). Free memory was 508.0MB in the beginning and 5.3GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. [2023-08-03 17:47:22,703 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.09ms. Allocated memory is still 390.1MB. Free memory is still 339.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 354.43ms. Allocated memory is still 390.1MB. Free memory was 328.2MB in the beginning and 303.1MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.48ms. Allocated memory was 390.1MB in the beginning and 595.6MB in the end (delta: 205.5MB). Free memory was 303.1MB in the beginning and 560.4MB in the end (delta: -257.3MB). Peak memory consumption was 9.4MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.37ms. Allocated memory is still 595.6MB. Free memory was 560.4MB in the beginning and 558.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 523.02ms. Allocated memory is still 595.6MB. Free memory was 558.3MB in the beginning and 508.9MB in the end (delta: 49.4MB). Peak memory consumption was 48.2MB. Max. memory is 16.0GB. * TraceAbstraction took 21308.79ms. Allocated memory was 595.6MB in the beginning and 7.2GB in the end (delta: 6.6GB). Free memory was 508.0MB in the beginning and 5.3GB in the end (delta: -4.8GB). Peak memory consumption was 1.8GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 106 PlacesBefore, 32 PlacesAfterwards, 105 TransitionsBefore, 28 TransitionsAfterwards, 1570 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 92 TotalNumberOfCompositions, 4088 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2160, independent: 2013, independent conditional: 0, independent unconditional: 2013, dependent: 147, dependent conditional: 0, dependent unconditional: 147, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 851, independent: 827, independent conditional: 0, independent unconditional: 827, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2160, independent: 1186, independent conditional: 0, independent unconditional: 1186, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 851, unknown conditional: 0, unknown unconditional: 851] , Statistics on independence cache: Total cache size (in pairs): 96, Positive cache size: 83, Positive conditional cache size: 0, Positive unconditional cache size: 83, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.4s, 129 PlacesBefore, 51 PlacesAfterwards, 124 TransitionsBefore, 43 TransitionsAfterwards, 3776 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 3 ChoiceCompositions, 97 TotalNumberOfCompositions, 12295 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4077, independent: 3812, independent conditional: 0, independent unconditional: 3812, dependent: 265, dependent conditional: 0, dependent unconditional: 265, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1847, independent: 1808, independent conditional: 0, independent unconditional: 1808, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4077, independent: 2004, independent conditional: 0, independent unconditional: 2004, dependent: 226, dependent conditional: 0, dependent unconditional: 226, unknown: 1847, unknown conditional: 0, unknown unconditional: 1847] , Statistics on independence cache: Total cache size (in pairs): 212, Positive cache size: 190, Positive conditional cache size: 0, Positive unconditional cache size: 190, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L721] 0 int y = 0; [L722] 0 _Bool y$flush_delayed; [L723] 0 int y$mem_tmp; [L724] 0 _Bool y$r_buff0_thd0; [L725] 0 _Bool y$r_buff0_thd1; [L726] 0 _Bool y$r_buff0_thd2; [L727] 0 _Bool y$r_buff1_thd0; [L728] 0 _Bool y$r_buff1_thd1; [L729] 0 _Bool y$r_buff1_thd2; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1665[2]; [L835] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] COND TRUE 0 asdf<2 [L835] FCALL, FORK 0 pthread_create(&t1665[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1665[asdf], ((void *)0), P0, ((void *)0))=-2, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] COND TRUE 0 asdf<2 [L835] FCALL, FORK 0 pthread_create(&t1665[asdf], ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=1, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1665[asdf], ((void *)0), P0, ((void *)0))=-1, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] 0 asdf++ VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1665={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L835] COND FALSE 0 !(asdf<2) [L836] 0 pthread_t t1666[2]; [L837] 0 int asdf=0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, t1665={5:0}, t1666={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L837] COND TRUE 0 asdf<2 [L837] FCALL, FORK 0 pthread_create(&t1666[asdf], ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, asdf=0, asdf=2, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1666[asdf], ((void *)0), P1, ((void *)0))=0, t1665={5:0}, t1666={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L771] 3 y$w_buff1 = y$w_buff0 [L772] 3 y$w_buff0 = 1 [L773] 3 y$w_buff1_used = y$w_buff0_used [L774] 3 y$w_buff0_used = (_Bool)1 [L775] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND FALSE 3 !(!expression) [L775] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L776] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L777] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L778] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L779] 3 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L782] 3 y$w_buff1 = y$w_buff0 [L783] 3 y$w_buff0 = 2 [L784] 3 y$w_buff1_used = y$w_buff0_used [L785] 3 y$w_buff0_used = (_Bool)1 [L786] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L19] COND TRUE 3 !expression [L19] 3 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=1, y$w_buff1_used=1, y=0] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 121 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: 2.9s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 17 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=1, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 11 NumberOfCodeBlocks, 11 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 4 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 140 locations, 9 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: 18.3s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 167 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 142 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 355 IncrementalHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 3 mSDtfsCounter, 355 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=4, InterpolantAutomatonStates: 15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 152 SizeOfPredicates, 0 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 17/25 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-03 17:47:22,732 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...