/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.pointer.base.address.is.valid.at.dereference ASSERTandASSUME --cacsl2boogietranslator.pointer.to.allocated.memory.at.dereference ASSERTandASSUME --cacsl2boogietranslator.check.array.bounds.for.arrays.that.are.off.heap ASSERTandASSUME --cacsl2boogietranslator.check.if.freed.pointer.was.valid true --cacsl2boogietranslator.adapt.memory.model.on.pointer.casts.if.necessary true -i ../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:09:08,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:09:08,119 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 12:09:08,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:09:08,124 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:09:08,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:09:08,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:09:08,153 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:09:08,154 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:09:08,157 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:09:08,157 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:09:08,158 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:09:08,158 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:09:08,159 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:09:08,159 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:09:08,159 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:09:08,160 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:09:08,160 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:09:08,160 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:09:08,160 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:09:08,160 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:09:08,161 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:09:08,161 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:09:08,162 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:09:08,162 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:09:08,162 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:09:08,162 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:09:08,162 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:09:08,163 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:09:08,163 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:09:08,164 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:09:08,164 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:09:08,164 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:09:08,165 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:09:08,165 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:09:08,165 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer base address is valid at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Pointer to allocated memory at dereference -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check array bounds for arrays that are off heap -> ASSERTandASSUME Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check if freed pointer was valid -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Adapt memory model on pointer casts if necessary -> true [2023-08-26 12:09:08,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:09:08,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:09:08,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:09:08,499 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:09:08,500 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:09:08,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi007_tso.i [2023-08-26 12:09:09,881 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:09:10,197 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:09:10,197 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi007_tso.i [2023-08-26 12:09:10,213 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a761ab34a/7264c1302c6446f68045dee2f73e80f5/FLAG6d6bbd77b [2023-08-26 12:09:10,230 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a761ab34a/7264c1302c6446f68045dee2f73e80f5 [2023-08-26 12:09:10,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:09:10,235 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:09:10,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:09:10,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:09:10,241 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:09:10,242 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,243 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63bdc5b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10, skipping insertion in model container [2023-08-26 12:09:10,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,295 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:09:10,735 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:09:10,749 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:09:10,778 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:09:10,780 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 12:09:10,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:09:10,859 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:09:10,859 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:09:10,866 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:09:10,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10 WrapperNode [2023-08-26 12:09:10,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:09:10,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:09:10,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:09:10,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:09:10,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,903 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,947 INFO L138 Inliner]: procedures = 175, calls = 44, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2023-08-26 12:09:10,947 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:09:10,948 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:09:10,948 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:09:10,948 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:09:10,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,995 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:10,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:11,000 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:11,003 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:09:11,004 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:09:11,004 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:09:11,004 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:09:11,006 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (1/1) ... [2023-08-26 12:09:11,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:09:11,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:09:11,099 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-26 12:09:11,110 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-26 12:09:11,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:09:11,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:09:11,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:09:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:09:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:09:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:09:11,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:09:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:09:11,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:09:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:09:11,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:09:11,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:09:11,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:09:11,151 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 12:09:11,335 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:09:11,337 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:09:11,586 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:09:11,724 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:09:11,725 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:09:11,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:09:11 BoogieIcfgContainer [2023-08-26 12:09:11,727 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:09:11,731 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:09:11,731 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:09:11,735 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:09:11,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:09:10" (1/3) ... [2023-08-26 12:09:11,736 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3319b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:09:11, skipping insertion in model container [2023-08-26 12:09:11,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:09:10" (2/3) ... [2023-08-26 12:09:11,737 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3319b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:09:11, skipping insertion in model container [2023-08-26 12:09:11,737 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:09:11" (3/3) ... [2023-08-26 12:09:11,742 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi007_tso.i [2023-08-26 12:09:11,760 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:09:11,760 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 12:09:11,760 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:09:11,823 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:09:11,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 204 flow [2023-08-26 12:09:11,919 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-08-26 12:09:11,921 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:11,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 3/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 12:09:11,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 101 places, 97 transitions, 204 flow [2023-08-26 12:09:11,931 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 95 transitions, 196 flow [2023-08-26 12:09:11,934 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:09:11,949 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 99 places, 95 transitions, 196 flow [2023-08-26 12:09:11,951 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 99 places, 95 transitions, 196 flow [2023-08-26 12:09:11,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 95 transitions, 196 flow [2023-08-26 12:09:11,973 INFO L124 PetriNetUnfolderBase]: 3/95 cut-off events. [2023-08-26 12:09:11,973 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:11,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 102 conditions, 95 events. 3/95 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 67 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 12:09:11,975 INFO L119 LiptonReduction]: Number of co-enabled transitions 1244 [2023-08-26 12:09:16,347 INFO L134 LiptonReduction]: Checked pairs total: 3405 [2023-08-26 12:09:16,348 INFO L136 LiptonReduction]: Total number of compositions: 100 [2023-08-26 12:09:16,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:09:16,366 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=false, 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;@36812e90, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:09:16,367 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 12:09:16,368 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:09:16,368 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:09:16,368 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:16,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:09:16,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:09:16,369 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:09:16,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:09:16,374 INFO L85 PathProgramCache]: Analyzing trace with hash 497, now seen corresponding path program 1 times [2023-08-26 12:09:16,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:09:16,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267792131] [2023-08-26 12:09:16,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:09:16,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:09:16,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:09:16,486 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-26 12:09:16,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:09:16,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267792131] [2023-08-26 12:09:16,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267792131] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:09:16,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:09:16,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:09:16,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955464951] [2023-08-26 12:09:16,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:09:16,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:09:16,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:09:16,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:09:16,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:09:16,529 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 197 [2023-08-26 12:09:16,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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-26 12:09:16,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:09:16,532 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 197 [2023-08-26 12:09:16,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:09:16,668 INFO L124 PetriNetUnfolderBase]: 211/372 cut-off events. [2023-08-26 12:09:16,668 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-26 12:09:16,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 372 events. 211/372 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1498 event pairs, 211 based on Foata normal form. 0/318 useless extension candidates. Maximal degree in co-relation 740. Up to 365 conditions per place. [2023-08-26 12:09:16,672 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 17 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-26 12:09:16,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 78 flow [2023-08-26 12:09:16,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:09:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:09:16,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 190 transitions. [2023-08-26 12:09:16,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48223350253807107 [2023-08-26 12:09:16,704 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 190 transitions. [2023-08-26 12:09:16,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 190 transitions. [2023-08-26 12:09:16,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:09:16,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 190 transitions. [2023-08-26 12:09:16,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.0) internal successors, (190), 2 states have internal predecessors, (190), 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-26 12:09:16,725 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-26 12:09:16,726 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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-26 12:09:16,727 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 2 states and 190 transitions. [2023-08-26 12:09:16,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 78 flow [2023-08-26 12:09:16,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 76 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:09:16,731 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-26 12:09:16,732 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-26 12:09:16,735 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-26 12:09:16,735 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-26 12:09:16,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 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-26 12:09:16,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:09:16,736 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:09:16,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:09:16,736 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:09:16,753 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:09:16,753 INFO L85 PathProgramCache]: Analyzing trace with hash 468510749, now seen corresponding path program 1 times [2023-08-26 12:09:16,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:09:16,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53795189] [2023-08-26 12:09:16,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:09:16,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:09:16,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:09:17,049 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-26 12:09:17,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:09:17,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53795189] [2023-08-26 12:09:17,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53795189] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:09:17,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:09:17,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:09:17,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057085032] [2023-08-26 12:09:17,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:09:17,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:09:17,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:09:17,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:09:17,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:09:17,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 197 [2023-08-26 12:09:17,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-26 12:09:17,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:09:17,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 197 [2023-08-26 12:09:17,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:09:17,196 INFO L124 PetriNetUnfolderBase]: 173/328 cut-off events. [2023-08-26 12:09:17,196 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:09:17,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 328 events. 173/328 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1405 event pairs, 21 based on Foata normal form. 0/307 useless extension candidates. Maximal degree in co-relation 640. Up to 249 conditions per place. [2023-08-26 12:09:17,202 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 20 selfloop transitions, 2 changer transitions 2/26 dead transitions. [2023-08-26 12:09:17,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 26 transitions, 104 flow [2023-08-26 12:09:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:09:17,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:09:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2023-08-26 12:09:17,209 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46362098138747887 [2023-08-26 12:09:17,209 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 274 transitions. [2023-08-26 12:09:17,209 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 274 transitions. [2023-08-26 12:09:17,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:09:17,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 274 transitions. [2023-08-26 12:09:17,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 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-26 12:09:17,216 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-26 12:09:17,217 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-26 12:09:17,217 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 274 transitions. [2023-08-26 12:09:17,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 26 transitions, 104 flow [2023-08-26 12:09:17,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 26 transitions, 104 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:09:17,218 INFO L231 Difference]: Finished difference. Result has 26 places, 17 transitions, 42 flow [2023-08-26 12:09:17,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=26, PETRI_TRANSITIONS=17} [2023-08-26 12:09:17,220 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-26 12:09:17,223 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 17 transitions, 42 flow [2023-08-26 12:09:17,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.66666666666667) internal successors, (254), 3 states have internal predecessors, (254), 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-26 12:09:17,223 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:09:17,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:09:17,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:09:17,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:09:17,228 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:09:17,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1238988522, now seen corresponding path program 1 times [2023-08-26 12:09:17,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:09:17,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849842807] [2023-08-26 12:09:17,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:09:17,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:09:17,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:09:17,476 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-26 12:09:17,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:09:17,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849842807] [2023-08-26 12:09:17,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849842807] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:09:17,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:09:17,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 12:09:17,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453435895] [2023-08-26 12:09:17,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:09:17,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:09:17,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:09:17,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:09:17,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:09:17,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 197 [2023-08-26 12:09:17,479 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 17 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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-26 12:09:17,479 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:09:17,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 197 [2023-08-26 12:09:17,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:09:17,601 INFO L124 PetriNetUnfolderBase]: 133/264 cut-off events. [2023-08-26 12:09:17,601 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2023-08-26 12:09:17,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 264 events. 133/264 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1062 event pairs, 45 based on Foata normal form. 20/283 useless extension candidates. Maximal degree in co-relation 537. Up to 146 conditions per place. [2023-08-26 12:09:17,603 INFO L140 encePairwiseOnDemand]: 193/197 looper letters, 18 selfloop transitions, 2 changer transitions 11/33 dead transitions. [2023-08-26 12:09:17,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 33 transitions, 138 flow [2023-08-26 12:09:17,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:09:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:09:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 438 transitions. [2023-08-26 12:09:17,606 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4446700507614213 [2023-08-26 12:09:17,606 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 438 transitions. [2023-08-26 12:09:17,606 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 438 transitions. [2023-08-26 12:09:17,606 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:09:17,606 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 438 transitions. [2023-08-26 12:09:17,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 87.6) internal successors, (438), 5 states have internal predecessors, (438), 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-26 12:09:17,609 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-26 12:09:17,610 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-26 12:09:17,610 INFO L175 Difference]: Start difference. First operand has 26 places, 17 transitions, 42 flow. Second operand 5 states and 438 transitions. [2023-08-26 12:09:17,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 33 transitions, 138 flow [2023-08-26 12:09:17,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:09:17,612 INFO L231 Difference]: Finished difference. Result has 30 places, 17 transitions, 50 flow [2023-08-26 12:09:17,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=50, PETRI_PLACES=30, PETRI_TRANSITIONS=17} [2023-08-26 12:09:17,613 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 0 predicate places. [2023-08-26 12:09:17,613 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 17 transitions, 50 flow [2023-08-26 12:09:17,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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-26 12:09:17,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:09:17,613 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:09:17,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:09:17,614 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:09:17,614 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:09:17,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1492209849, now seen corresponding path program 1 times [2023-08-26 12:09:17,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:09:17,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678857461] [2023-08-26 12:09:17,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:09:17,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:09:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:09:17,860 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-26 12:09:17,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:09:17,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678857461] [2023-08-26 12:09:17,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678857461] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:09:17,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:09:17,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:09:17,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047644235] [2023-08-26 12:09:17,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:09:17,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:09:17,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:09:17,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:09:17,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:09:17,864 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 197 [2023-08-26 12:09:17,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 17 transitions, 50 flow. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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-26 12:09:17,865 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:09:17,865 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 197 [2023-08-26 12:09:17,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:09:17,969 INFO L124 PetriNetUnfolderBase]: 65/147 cut-off events. [2023-08-26 12:09:17,969 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-26 12:09:17,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 345 conditions, 147 events. 65/147 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 512 event pairs, 14 based on Foata normal form. 20/166 useless extension candidates. Maximal degree in co-relation 338. Up to 71 conditions per place. [2023-08-26 12:09:17,972 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 21 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2023-08-26 12:09:17,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 41 transitions, 187 flow [2023-08-26 12:09:17,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:09:17,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:09:17,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2023-08-26 12:09:17,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43756345177664974 [2023-08-26 12:09:17,974 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 431 transitions. [2023-08-26 12:09:17,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 431 transitions. [2023-08-26 12:09:17,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:09:17,975 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 431 transitions. [2023-08-26 12:09:17,976 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 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-26 12:09:17,978 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-26 12:09:17,978 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 197.0) internal successors, (1182), 6 states have internal predecessors, (1182), 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-26 12:09:17,979 INFO L175 Difference]: Start difference. First operand has 30 places, 17 transitions, 50 flow. Second operand 5 states and 431 transitions. [2023-08-26 12:09:17,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 41 transitions, 187 flow [2023-08-26 12:09:17,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 41 transitions, 173 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-26 12:09:17,981 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 69 flow [2023-08-26 12:09:17,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=69, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-08-26 12:09:17,982 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 1 predicate places. [2023-08-26 12:09:17,982 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 69 flow [2023-08-26 12:09:17,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 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-26 12:09:17,983 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:09:17,983 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:09:17,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:09:17,983 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:09:17,984 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:09:17,984 INFO L85 PathProgramCache]: Analyzing trace with hash -959087134, now seen corresponding path program 1 times [2023-08-26 12:09:17,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:09:17,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647353800] [2023-08-26 12:09:17,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:09:17,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:09:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:09:18,275 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-26 12:09:18,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:09:18,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647353800] [2023-08-26 12:09:18,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647353800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:09:18,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:09:18,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:09:18,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149295962] [2023-08-26 12:09:18,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:09:18,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:09:18,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:09:18,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:09:18,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:09:18,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 197 [2023-08-26 12:09:18,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 69 flow. Second operand has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 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-26 12:09:18,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:09:18,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 197 [2023-08-26 12:09:18,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:09:18,362 INFO L124 PetriNetUnfolderBase]: 24/70 cut-off events. [2023-08-26 12:09:18,362 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-26 12:09:18,362 INFO L83 FinitePrefix]: Finished finitePrefix Result has 196 conditions, 70 events. 24/70 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 171 event pairs, 10 based on Foata normal form. 8/77 useless extension candidates. Maximal degree in co-relation 188. Up to 29 conditions per place. [2023-08-26 12:09:18,363 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 19 selfloop transitions, 5 changer transitions 8/34 dead transitions. [2023-08-26 12:09:18,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 34 transitions, 177 flow [2023-08-26 12:09:18,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:09:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:09:18,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 502 transitions. [2023-08-26 12:09:18,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42470389170896783 [2023-08-26 12:09:18,365 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 502 transitions. [2023-08-26 12:09:18,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 502 transitions. [2023-08-26 12:09:18,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:09:18,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 502 transitions. [2023-08-26 12:09:18,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 83.66666666666667) internal successors, (502), 6 states have internal predecessors, (502), 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-26 12:09:18,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-26 12:09:18,369 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 197.0) internal successors, (1379), 7 states have internal predecessors, (1379), 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-26 12:09:18,369 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 69 flow. Second operand 6 states and 502 transitions. [2023-08-26 12:09:18,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 34 transitions, 177 flow [2023-08-26 12:09:18,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 158 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-26 12:09:18,371 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 76 flow [2023-08-26 12:09:18,371 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=76, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2023-08-26 12:09:18,372 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 4 predicate places. [2023-08-26 12:09:18,372 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 76 flow [2023-08-26 12:09:18,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 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-26 12:09:18,372 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:09:18,372 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:09:18,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:09:18,373 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:09:18,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:09:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash 836828054, now seen corresponding path program 1 times [2023-08-26 12:09:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:09:18,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976357791] [2023-08-26 12:09:18,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:09:18,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:09:18,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:09:18,943 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-26 12:09:18,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:09:18,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976357791] [2023-08-26 12:09:18,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976357791] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:09:18,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:09:18,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 12:09:18,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38843339] [2023-08-26 12:09:18,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:09:18,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:09:18,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:09:18,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:09:18,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:09:18,945 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 197 [2023-08-26 12:09:18,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 71.83333333333333) internal successors, (431), 6 states have internal predecessors, (431), 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-26 12:09:18,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:09:18,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 197 [2023-08-26 12:09:18,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:09:19,127 INFO L124 PetriNetUnfolderBase]: 33/93 cut-off events. [2023-08-26 12:09:19,127 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2023-08-26 12:09:19,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 93 events. 33/93 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 248 event pairs, 2 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 254. Up to 50 conditions per place. [2023-08-26 12:09:19,128 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 18 selfloop transitions, 3 changer transitions 21/42 dead transitions. [2023-08-26 12:09:19,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 245 flow [2023-08-26 12:09:19,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:09:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:09:19,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 522 transitions. [2023-08-26 12:09:19,131 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.378535170413343 [2023-08-26 12:09:19,131 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 522 transitions. [2023-08-26 12:09:19,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 522 transitions. [2023-08-26 12:09:19,131 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:09:19,131 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 522 transitions. [2023-08-26 12:09:19,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 74.57142857142857) internal successors, (522), 7 states have internal predecessors, (522), 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-26 12:09:19,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-26 12:09:19,135 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-26 12:09:19,135 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 76 flow. Second operand 7 states and 522 transitions. [2023-08-26 12:09:19,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 245 flow [2023-08-26 12:09:19,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 42 transitions, 214 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-26 12:09:19,137 INFO L231 Difference]: Finished difference. Result has 37 places, 19 transitions, 75 flow [2023-08-26 12:09:19,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=75, PETRI_PLACES=37, PETRI_TRANSITIONS=19} [2023-08-26 12:09:19,138 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2023-08-26 12:09:19,138 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 19 transitions, 75 flow [2023-08-26 12:09:19,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.83333333333333) internal successors, (431), 6 states have internal predecessors, (431), 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-26 12:09:19,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:09:19,138 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:09:19,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:09:19,139 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:09:19,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:09:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash 61326634, now seen corresponding path program 2 times [2023-08-26 12:09:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:09:19,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467351950] [2023-08-26 12:09:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:09:19,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:09:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:09:20,202 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-26 12:09:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:09:20,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467351950] [2023-08-26 12:09:20,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467351950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:09:20,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:09:20,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 12:09:20,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158765705] [2023-08-26 12:09:20,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:09:20,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 12:09:20,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:09:20,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 12:09:20,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-26 12:09:20,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 197 [2023-08-26 12:09:20,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 19 transitions, 75 flow. Second operand has 9 states, 9 states have (on average 70.77777777777777) internal successors, (637), 9 states have internal predecessors, (637), 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-26 12:09:20,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:09:20,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 197 [2023-08-26 12:09:20,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:09:20,433 INFO L124 PetriNetUnfolderBase]: 12/57 cut-off events. [2023-08-26 12:09:20,434 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-08-26 12:09:20,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 179 conditions, 57 events. 12/57 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 141 event pairs, 2 based on Foata normal form. 1/58 useless extension candidates. Maximal degree in co-relation 169. Up to 24 conditions per place. [2023-08-26 12:09:20,434 INFO L140 encePairwiseOnDemand]: 190/197 looper letters, 15 selfloop transitions, 5 changer transitions 12/33 dead transitions. [2023-08-26 12:09:20,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 196 flow [2023-08-26 12:09:20,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 12:09:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 12:09:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 512 transitions. [2023-08-26 12:09:20,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37128353879622916 [2023-08-26 12:09:20,442 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 512 transitions. [2023-08-26 12:09:20,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 512 transitions. [2023-08-26 12:09:20,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:09:20,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 512 transitions. [2023-08-26 12:09:20,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 73.14285714285714) internal successors, (512), 7 states have internal predecessors, (512), 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-26 12:09:20,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-26 12:09:20,446 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 197.0) internal successors, (1576), 8 states have internal predecessors, (1576), 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-26 12:09:20,446 INFO L175 Difference]: Start difference. First operand has 37 places, 19 transitions, 75 flow. Second operand 7 states and 512 transitions. [2023-08-26 12:09:20,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 196 flow [2023-08-26 12:09:20,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 33 transitions, 182 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-08-26 12:09:20,448 INFO L231 Difference]: Finished difference. Result has 38 places, 19 transitions, 83 flow [2023-08-26 12:09:20,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=19} [2023-08-26 12:09:20,449 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-26 12:09:20,449 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 19 transitions, 83 flow [2023-08-26 12:09:20,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 70.77777777777777) internal successors, (637), 9 states have internal predecessors, (637), 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-26 12:09:20,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:09:20,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:09:20,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:09:20,450 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:09:20,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:09:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1227768086, now seen corresponding path program 3 times [2023-08-26 12:09:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:09:20,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871477758] [2023-08-26 12:09:20,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:09:20,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:09:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:09:20,489 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:09:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:09:20,565 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:09:20,565 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:09:20,566 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 12:09:20,567 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 12:09:20,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 12:09:20,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 12:09:20,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 12:09:20,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 12:09:20,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 12:09:20,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 12:09:20,568 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 12:09:20,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:09:20,569 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-08-26 12:09:20,574 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:09:20,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:09:20,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:09:20 BasicIcfg [2023-08-26 12:09:20,612 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:09:20,612 INFO L158 Benchmark]: Toolchain (without parser) took 10377.45ms. Allocated memory was 367.0MB in the beginning and 616.6MB in the end (delta: 249.6MB). Free memory was 323.8MB in the beginning and 568.7MB in the end (delta: -244.8MB). Peak memory consumption was 307.8MB. Max. memory is 16.0GB. [2023-08-26 12:09:20,613 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 367.0MB. Free memory was 344.7MB in the beginning and 344.6MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:09:20,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 631.08ms. Allocated memory is still 367.0MB. Free memory was 323.8MB in the beginning and 299.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 12:09:20,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.64ms. Allocated memory is still 367.0MB. Free memory was 299.7MB in the beginning and 296.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:09:20,614 INFO L158 Benchmark]: Boogie Preprocessor took 55.41ms. Allocated memory is still 367.0MB. Free memory was 296.6MB in the beginning and 294.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:09:20,614 INFO L158 Benchmark]: RCFGBuilder took 722.96ms. Allocated memory is still 367.0MB. Free memory was 294.5MB in the beginning and 251.5MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-26 12:09:20,615 INFO L158 Benchmark]: TraceAbstraction took 8881.18ms. Allocated memory was 367.0MB in the beginning and 616.6MB in the end (delta: 249.6MB). Free memory was 251.5MB in the beginning and 568.7MB in the end (delta: -317.2MB). Peak memory consumption was 234.4MB. Max. memory is 16.0GB. [2023-08-26 12:09:20,617 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.10ms. Allocated memory is still 367.0MB. Free memory was 344.7MB in the beginning and 344.6MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 631.08ms. Allocated memory is still 367.0MB. Free memory was 323.8MB in the beginning and 299.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.64ms. Allocated memory is still 367.0MB. Free memory was 299.7MB in the beginning and 296.6MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 55.41ms. Allocated memory is still 367.0MB. Free memory was 296.6MB in the beginning and 294.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 722.96ms. Allocated memory is still 367.0MB. Free memory was 294.5MB in the beginning and 251.5MB in the end (delta: 43.0MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 8881.18ms. Allocated memory was 367.0MB in the beginning and 616.6MB in the end (delta: 249.6MB). Free memory was 251.5MB in the beginning and 568.7MB in the end (delta: -317.2MB). Peak memory consumption was 234.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.4s, 99 PlacesBefore, 30 PlacesAfterwards, 95 TransitionsBefore, 24 TransitionsAfterwards, 1244 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 100 TotalNumberOfCompositions, 3405 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1566, independent: 1437, independent conditional: 0, independent unconditional: 1437, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 697, independent: 674, independent conditional: 0, independent unconditional: 674, dependent: 23, dependent conditional: 0, dependent unconditional: 23, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1566, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 106, dependent conditional: 0, dependent unconditional: 106, unknown: 697, unknown conditional: 0, unknown unconditional: 697] , Statistics on independence cache: Total cache size (in pairs): 57, Positive cache size: 47, Positive conditional cache size: 0, Positive unconditional cache size: 47, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L810] 0 pthread_t t1717; [L811] FCALL, FORK 0 pthread_create(&t1717, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1717, ((void *)0), P0, ((void *)0))=-2, t1717={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] [L812] 0 pthread_t t1718; [L813] FCALL, FORK 0 pthread_create(&t1718, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1718, ((void *)0), P1, ((void *)0))=-1, t1717={5:0}, t1718={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] [L758] 2 y$w_buff1 = y$w_buff0 [L759] 2 y$w_buff0 = 2 [L760] 2 y$w_buff1_used = y$w_buff0_used [L761] 2 y$w_buff0_used = (_Bool)1 [L762] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L762] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L763] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L764] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L765] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L766] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EAX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=0, y$w_buff1_used=0, y=0] [L785] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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=0, y$w_buff1_used=0, y=0] [L738] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=0, y$w_buff1_used=0, y=0] [L741] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=0, y$w_buff1_used=0, y=1] [L744] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L745] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L746] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L747] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L748] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=0, y$w_buff1_used=0, y=1] [L788] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L789] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L790] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L791] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L792] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L753] 1 return 0; [L815] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L817] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L817] RET 0 assume_abort_if_not(main$tmp_guard0) [L819] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L820] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L821] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L822] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L823] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1717={5:0}, t1718={3:0}, weak$$choice2=1, x=1, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=2] [L826] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L827] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L828] 0 y$flush_delayed = weak$$choice2 [L829] 0 y$mem_tmp = y [L830] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L831] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L832] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L833] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L834] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L836] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) [L838] 0 y = y$flush_delayed ? y$mem_tmp : y [L839] 0 y$flush_delayed = (_Bool)0 [L841] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "rfi007_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, 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=0, y$w_buff1=0, y$w_buff1_used=0, y=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 811]: 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: 813]: 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, 115 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: 8.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 412 IncrementalHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 4 mSDtfsCounter, 412 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=7, InterpolantAutomatonStates: 35, 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.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 88 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 12:09:20,644 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...