/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/mix034_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 12:04:25,186 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 12:04:25,255 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:04:25,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 12:04:25,259 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 12:04:25,283 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 12:04:25,284 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 12:04:25,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 12:04:25,288 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 12:04:25,290 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 12:04:25,291 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 12:04:25,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 12:04:25,291 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 12:04:25,292 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 12:04:25,292 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 12:04:25,292 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 12:04:25,292 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 12:04:25,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 12:04:25,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 12:04:25,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 12:04:25,293 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 12:04:25,294 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 12:04:25,294 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 12:04:25,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 12:04:25,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 12:04:25,294 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 12:04:25,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 12:04:25,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:04:25,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 12:04:25,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 12:04:25,296 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 12:04:25,296 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 12:04:25,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 12:04:25,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 12:04:25,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 12:04:25,297 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:04:25,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 12:04:25,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 12:04:25,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 12:04:25,538 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 12:04:25,542 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 12:04:25,543 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-08-26 12:04:26,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 12:04:26,740 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 12:04:26,742 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_pso.opt_tso.opt.i [2023-08-26 12:04:26,755 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd371aa7/51e28fb295554fe48eb6bbd87de8563f/FLAG473c7735d [2023-08-26 12:04:26,764 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cd371aa7/51e28fb295554fe48eb6bbd87de8563f [2023-08-26 12:04:26,765 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 12:04:26,766 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 12:04:26,767 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 12:04:26,767 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 12:04:26,769 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 12:04:26,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:04:26" (1/1) ... [2023-08-26 12:04:26,770 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4d4134 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:26, skipping insertion in model container [2023-08-26 12:04:26,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 12:04:26" (1/1) ... [2023-08-26 12:04:26,810 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 12:04:27,095 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:04:27,106 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 12:04:27,123 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:04:27,125 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 12:04:27,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 12:04:27,172 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:04:27,172 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 12:04:27,177 INFO L206 MainTranslator]: Completed translation [2023-08-26 12:04:27,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27 WrapperNode [2023-08-26 12:04:27,177 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 12:04:27,178 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 12:04:27,178 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 12:04:27,178 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 12:04:27,183 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:04:27" (1/1) ... [2023-08-26 12:04:27,206 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:04:27" (1/1) ... [2023-08-26 12:04:27,221 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 127 [2023-08-26 12:04:27,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 12:04:27,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 12:04:27,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 12:04:27,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 12:04:27,228 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (1/1) ... [2023-08-26 12:04:27,228 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (1/1) ... [2023-08-26 12:04:27,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (1/1) ... [2023-08-26 12:04:27,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (1/1) ... [2023-08-26 12:04:27,247 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (1/1) ... [2023-08-26 12:04:27,249 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (1/1) ... [2023-08-26 12:04:27,250 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (1/1) ... [2023-08-26 12:04:27,251 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (1/1) ... [2023-08-26 12:04:27,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 12:04:27,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 12:04:27,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 12:04:27,264 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 12:04:27,265 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (1/1) ... [2023-08-26 12:04:27,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 12:04:27,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 12:04:27,289 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:04:27,310 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:04:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 12:04:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 12:04:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 12:04:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 12:04:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 12:04:27,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 12:04:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 12:04:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 12:04:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 12:04:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 12:04:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 12:04:27,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 12:04:27,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 12:04:27,323 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:04:27,450 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 12:04:27,451 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 12:04:27,695 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 12:04:27,812 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 12:04:27,812 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 12:04:27,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:04:27 BoogieIcfgContainer [2023-08-26 12:04:27,814 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 12:04:27,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 12:04:27,816 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 12:04:27,818 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 12:04:27,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 12:04:26" (1/3) ... [2023-08-26 12:04:27,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f77e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:04:27, skipping insertion in model container [2023-08-26 12:04:27,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 12:04:27" (2/3) ... [2023-08-26 12:04:27,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f77e12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 12:04:27, skipping insertion in model container [2023-08-26 12:04:27,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 12:04:27" (3/3) ... [2023-08-26 12:04:27,821 INFO L112 eAbstractionObserver]: Analyzing ICFG mix034_pso.opt_tso.opt.i [2023-08-26 12:04:27,833 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 12:04:27,833 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 12:04:27,833 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 12:04:27,871 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 12:04:27,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 12:04:27,941 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 12:04:27,942 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:04:27,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 12:04:27,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 99 transitions, 208 flow [2023-08-26 12:04:27,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 200 flow [2023-08-26 12:04:27,952 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 12:04:27,960 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 12:04:27,963 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-26 12:04:27,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 200 flow [2023-08-26 12:04:27,987 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-26 12:04:27,987 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:04:27,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 68 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 58. Up to 2 conditions per place. [2023-08-26 12:04:27,989 INFO L119 LiptonReduction]: Number of co-enabled transitions 1220 [2023-08-26 12:04:31,255 INFO L134 LiptonReduction]: Checked pairs total: 3073 [2023-08-26 12:04:31,255 INFO L136 LiptonReduction]: Total number of compositions: 101 [2023-08-26 12:04:31,270 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 12:04:31,275 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;@6e70b69f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 12:04:31,275 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 12:04:31,276 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 12:04:31,276 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-08-26 12:04:31,276 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:04:31,276 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:04:31,277 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 12:04:31,277 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:04:31,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:04:31,280 INFO L85 PathProgramCache]: Analyzing trace with hash 460, now seen corresponding path program 1 times [2023-08-26 12:04:31,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:04:31,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086206977] [2023-08-26 12:04:31,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:04:31,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:04:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:04:31,367 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:04:31,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:04:31,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086206977] [2023-08-26 12:04:31,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086206977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:04:31,369 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:04:31,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 12:04:31,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165852245] [2023-08-26 12:04:31,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:04:31,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 12:04:31,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:04:31,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 12:04:31,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 12:04:31,396 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 200 [2023-08-26 12:04:31,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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:04:31,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:04:31,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 200 [2023-08-26 12:04:31,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:04:31,479 INFO L124 PetriNetUnfolderBase]: 173/310 cut-off events. [2023-08-26 12:04:31,479 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-26 12:04:31,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 626 conditions, 310 events. 173/310 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1124 event pairs, 173 based on Foata normal form. 0/262 useless extension candidates. Maximal degree in co-relation 616. Up to 303 conditions per place. [2023-08-26 12:04:31,482 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 16 selfloop transitions, 0 changer transitions 0/17 dead transitions. [2023-08-26 12:04:31,482 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 17 transitions, 72 flow [2023-08-26 12:04:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 12:04:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 12:04:31,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 197 transitions. [2023-08-26 12:04:31,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925 [2023-08-26 12:04:31,493 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 197 transitions. [2023-08-26 12:04:31,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 197 transitions. [2023-08-26 12:04:31,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:04:31,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 197 transitions. [2023-08-26 12:04:31,501 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 98.5) internal successors, (197), 2 states have internal predecessors, (197), 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:04:31,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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:04:31,504 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 200.0) internal successors, (600), 3 states have internal predecessors, (600), 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:04:31,505 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 2 states and 197 transitions. [2023-08-26 12:04:31,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 17 transitions, 72 flow [2023-08-26 12:04:31,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 17 transitions, 70 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:04:31,508 INFO L231 Difference]: Finished difference. Result has 23 places, 17 transitions, 38 flow [2023-08-26 12:04:31,509 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=38, PETRI_PLACES=23, PETRI_TRANSITIONS=17} [2023-08-26 12:04:31,511 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -5 predicate places. [2023-08-26 12:04:31,512 INFO L495 AbstractCegarLoop]: Abstraction has has 23 places, 17 transitions, 38 flow [2023-08-26 12:04:31,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 88.5) internal successors, (177), 2 states have internal predecessors, (177), 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:04:31,512 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:04:31,512 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 12:04:31,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 12:04:31,513 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:04:31,513 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:04:31,514 INFO L85 PathProgramCache]: Analyzing trace with hash 436908996, now seen corresponding path program 1 times [2023-08-26 12:04:31,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:04:31,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696280304] [2023-08-26 12:04:31,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:04:31,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:04:31,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:04:31,722 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:04:31,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:04:31,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696280304] [2023-08-26 12:04:31,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696280304] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:04:31,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:04:31,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:04:31,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656196452] [2023-08-26 12:04:31,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:04:31,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:04:31,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:04:31,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:04:31,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:04:31,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 200 [2023-08-26 12:04:31,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 17 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:04:31,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:04:31,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 200 [2023-08-26 12:04:31,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:04:31,782 INFO L124 PetriNetUnfolderBase]: 142/271 cut-off events. [2023-08-26 12:04:31,783 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 12:04:31,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 271 events. 142/271 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 996 event pairs, 18 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 532. Up to 205 conditions per place. [2023-08-26 12:04:31,784 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 18 selfloop transitions, 2 changer transitions 2/23 dead transitions. [2023-08-26 12:04:31,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 24 places, 23 transitions, 94 flow [2023-08-26 12:04:31,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:04:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:04:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2023-08-26 12:04:31,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47333333333333333 [2023-08-26 12:04:31,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 284 transitions. [2023-08-26 12:04:31,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 284 transitions. [2023-08-26 12:04:31,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:04:31,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 284 transitions. [2023-08-26 12:04:31,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.66666666666667) internal successors, (284), 3 states have internal predecessors, (284), 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:04:31,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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:04:31,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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:04:31,789 INFO L175 Difference]: Start difference. First operand has 23 places, 17 transitions, 38 flow. Second operand 3 states and 284 transitions. [2023-08-26 12:04:31,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 24 places, 23 transitions, 94 flow [2023-08-26 12:04:31,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:04:31,790 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 38 flow [2023-08-26 12:04:31,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=38, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2023-08-26 12:04:31,790 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2023-08-26 12:04:31,790 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 38 flow [2023-08-26 12:04:31,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.66666666666667) internal successors, (266), 3 states have internal predecessors, (266), 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:04:31,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:04:31,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:04:31,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 12:04:31,791 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:04:31,791 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:04:31,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1037193546, now seen corresponding path program 1 times [2023-08-26 12:04:31,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:04:31,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776366430] [2023-08-26 12:04:31,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:04:31,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:04:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:04:31,964 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:04:31,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:04:31,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776366430] [2023-08-26 12:04:31,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776366430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:04:31,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:04:31,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 12:04:31,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936976210] [2023-08-26 12:04:31,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:04:31,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 12:04:31,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:04:31,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 12:04:31,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 12:04:31,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 200 [2023-08-26 12:04:31,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 38 flow. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:04:31,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:04:31,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 200 [2023-08-26 12:04:31,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:04:32,008 INFO L124 PetriNetUnfolderBase]: 97/190 cut-off events. [2023-08-26 12:04:32,008 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 12:04:32,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 395 conditions, 190 events. 97/190 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 611 event pairs, 37 based on Foata normal form. 8/198 useless extension candidates. Maximal degree in co-relation 391. Up to 117 conditions per place. [2023-08-26 12:04:32,010 INFO L140 encePairwiseOnDemand]: 197/200 looper letters, 17 selfloop transitions, 2 changer transitions 0/20 dead transitions. [2023-08-26 12:04:32,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 20 transitions, 86 flow [2023-08-26 12:04:32,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 12:04:32,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 12:04:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2023-08-26 12:04:32,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4583333333333333 [2023-08-26 12:04:32,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 275 transitions. [2023-08-26 12:04:32,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 275 transitions. [2023-08-26 12:04:32,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:04:32,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 275 transitions. [2023-08-26 12:04:32,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 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:04:32,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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:04:32,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 200.0) internal successors, (800), 4 states have internal predecessors, (800), 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:04:32,016 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 38 flow. Second operand 3 states and 275 transitions. [2023-08-26 12:04:32,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 20 transitions, 86 flow [2023-08-26 12:04:32,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 82 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:04:32,017 INFO L231 Difference]: Finished difference. Result has 24 places, 15 transitions, 42 flow [2023-08-26 12:04:32,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=34, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=42, PETRI_PLACES=24, PETRI_TRANSITIONS=15} [2023-08-26 12:04:32,018 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -4 predicate places. [2023-08-26 12:04:32,018 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 15 transitions, 42 flow [2023-08-26 12:04:32,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 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:04:32,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:04:32,019 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:04:32,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 12:04:32,022 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:04:32,022 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:04:32,022 INFO L85 PathProgramCache]: Analyzing trace with hash -351332292, now seen corresponding path program 1 times [2023-08-26 12:04:32,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:04:32,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171337267] [2023-08-26 12:04:32,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:04:32,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:04:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:04:32,149 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:04:32,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:04:32,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171337267] [2023-08-26 12:04:32,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171337267] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:04:32,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:04:32,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:04:32,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940292226] [2023-08-26 12:04:32,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:04:32,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:04:32,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:04:32,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:04:32,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:04:32,151 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2023-08-26 12:04:32,152 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 15 transitions, 42 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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:04:32,152 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:04:32,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2023-08-26 12:04:32,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:04:32,217 INFO L124 PetriNetUnfolderBase]: 60/134 cut-off events. [2023-08-26 12:04:32,217 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-26 12:04:32,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 134 events. 60/134 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 426 event pairs, 13 based on Foata normal form. 20/154 useless extension candidates. Maximal degree in co-relation 302. Up to 60 conditions per place. [2023-08-26 12:04:32,218 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 20 selfloop transitions, 3 changer transitions 15/39 dead transitions. [2023-08-26 12:04:32,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 39 transitions, 177 flow [2023-08-26 12:04:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:04:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:04:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 440 transitions. [2023-08-26 12:04:32,220 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44 [2023-08-26 12:04:32,220 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 440 transitions. [2023-08-26 12:04:32,220 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 440 transitions. [2023-08-26 12:04:32,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:04:32,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 440 transitions. [2023-08-26 12:04:32,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 88.0) internal successors, (440), 5 states have internal predecessors, (440), 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:04:32,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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:04:32,223 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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:04:32,223 INFO L175 Difference]: Start difference. First operand has 24 places, 15 transitions, 42 flow. Second operand 5 states and 440 transitions. [2023-08-26 12:04:32,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 39 transitions, 177 flow [2023-08-26 12:04:32,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 39 transitions, 167 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 12:04:32,224 INFO L231 Difference]: Finished difference. Result has 29 places, 17 transitions, 65 flow [2023-08-26 12:04:32,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=15, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=65, PETRI_PLACES=29, PETRI_TRANSITIONS=17} [2023-08-26 12:04:32,224 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 1 predicate places. [2023-08-26 12:04:32,225 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 17 transitions, 65 flow [2023-08-26 12:04:32,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 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:04:32,225 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:04:32,225 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:04:32,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 12:04:32,225 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:04:32,226 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:04:32,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1525884074, now seen corresponding path program 1 times [2023-08-26 12:04:32,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:04:32,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806126842] [2023-08-26 12:04:32,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:04:32,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:04:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:04:32,381 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:04:32,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:04:32,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806126842] [2023-08-26 12:04:32,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806126842] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:04:32,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:04:32,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:04:32,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792093039] [2023-08-26 12:04:32,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:04:32,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:04:32,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:04:32,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:04:32,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:04:32,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2023-08-26 12:04:32,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 17 transitions, 65 flow. Second operand has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:04:32,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:04:32,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2023-08-26 12:04:32,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:04:32,440 INFO L124 PetriNetUnfolderBase]: 24/67 cut-off events. [2023-08-26 12:04:32,440 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-26 12:04:32,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 67 events. 24/67 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 147 event pairs, 10 based on Foata normal form. 8/75 useless extension candidates. Maximal degree in co-relation 184. Up to 29 conditions per place. [2023-08-26 12:04:32,440 INFO L140 encePairwiseOnDemand]: 195/200 looper letters, 18 selfloop transitions, 5 changer transitions 8/32 dead transitions. [2023-08-26 12:04:32,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 32 transitions, 171 flow [2023-08-26 12:04:32,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:04:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:04:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2023-08-26 12:04:32,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4275 [2023-08-26 12:04:32,442 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 513 transitions. [2023-08-26 12:04:32,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 513 transitions. [2023-08-26 12:04:32,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:04:32,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 513 transitions. [2023-08-26 12:04:32,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.5) internal successors, (513), 6 states have internal predecessors, (513), 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:04:32,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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:04:32,445 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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:04:32,445 INFO L175 Difference]: Start difference. First operand has 29 places, 17 transitions, 65 flow. Second operand 6 states and 513 transitions. [2023-08-26 12:04:32,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 32 transitions, 171 flow [2023-08-26 12:04:32,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 32 transitions, 152 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-26 12:04:32,446 INFO L231 Difference]: Finished difference. Result has 32 places, 17 transitions, 72 flow [2023-08-26 12:04:32,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=72, PETRI_PLACES=32, PETRI_TRANSITIONS=17} [2023-08-26 12:04:32,447 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 4 predicate places. [2023-08-26 12:04:32,447 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 17 transitions, 72 flow [2023-08-26 12:04:32,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 82.4) internal successors, (412), 5 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 12:04:32,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:04:32,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:04:32,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 12:04:32,448 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:04:32,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:04:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash -829170200, now seen corresponding path program 1 times [2023-08-26 12:04:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:04:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222392455] [2023-08-26 12:04:32,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:04:32,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:04:32,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:04:32,576 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:04:32,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:04:32,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222392455] [2023-08-26 12:04:32,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222392455] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:04:32,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:04:32,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 12:04:32,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711390891] [2023-08-26 12:04:32,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:04:32,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 12:04:32,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:04:32,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 12:04:32,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 12:04:32,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2023-08-26 12:04:32,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 17 transitions, 72 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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:04:32,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:04:32,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2023-08-26 12:04:32,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:04:32,634 INFO L124 PetriNetUnfolderBase]: 24/71 cut-off events. [2023-08-26 12:04:32,634 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-08-26 12:04:32,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 213 conditions, 71 events. 24/71 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 185 event pairs, 1 based on Foata normal form. 1/72 useless extension candidates. Maximal degree in co-relation 204. Up to 41 conditions per place. [2023-08-26 12:04:32,635 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 21 selfloop transitions, 7 changer transitions 9/37 dead transitions. [2023-08-26 12:04:32,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 37 transitions, 225 flow [2023-08-26 12:04:32,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 12:04:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 12:04:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 434 transitions. [2023-08-26 12:04:32,636 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.434 [2023-08-26 12:04:32,636 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 434 transitions. [2023-08-26 12:04:32,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 434 transitions. [2023-08-26 12:04:32,636 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:04:32,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 434 transitions. [2023-08-26 12:04:32,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.8) internal successors, (434), 5 states have internal predecessors, (434), 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:04:32,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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:04:32,640 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 200.0) internal successors, (1200), 6 states have internal predecessors, (1200), 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:04:32,640 INFO L175 Difference]: Start difference. First operand has 32 places, 17 transitions, 72 flow. Second operand 5 states and 434 transitions. [2023-08-26 12:04:32,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 37 transitions, 225 flow [2023-08-26 12:04:32,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 194 flow, removed 10 selfloop flow, removed 5 redundant places. [2023-08-26 12:04:32,642 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 92 flow [2023-08-26 12:04:32,642 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2023-08-26 12:04:32,643 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2023-08-26 12:04:32,643 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 92 flow [2023-08-26 12:04:32,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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:04:32,643 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:04:32,643 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:04:32,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 12:04:32,643 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:04:32,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:04:32,644 INFO L85 PathProgramCache]: Analyzing trace with hash 276321032, now seen corresponding path program 2 times [2023-08-26 12:04:32,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:04:32,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025030677] [2023-08-26 12:04:32,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:04:32,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:04:32,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:04:32,800 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:04:32,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:04:32,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025030677] [2023-08-26 12:04:32,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025030677] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:04:32,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:04:32,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:04:32,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142909826] [2023-08-26 12:04:32,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:04:32,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 12:04:32,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:04:32,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 12:04:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 12:04:32,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 200 [2023-08-26 12:04:32,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 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:04:32,803 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:04:32,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 200 [2023-08-26 12:04:32,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:04:32,874 INFO L124 PetriNetUnfolderBase]: 23/78 cut-off events. [2023-08-26 12:04:32,874 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2023-08-26 12:04:32,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259 conditions, 78 events. 23/78 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 220 event pairs, 3 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 251. Up to 36 conditions per place. [2023-08-26 12:04:32,875 INFO L140 encePairwiseOnDemand]: 194/200 looper letters, 16 selfloop transitions, 3 changer transitions 18/37 dead transitions. [2023-08-26 12:04:32,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 37 transitions, 226 flow [2023-08-26 12:04:32,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 12:04:32,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 12:04:32,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2023-08-26 12:04:32,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42833333333333334 [2023-08-26 12:04:32,877 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 514 transitions. [2023-08-26 12:04:32,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 514 transitions. [2023-08-26 12:04:32,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:04:32,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 514 transitions. [2023-08-26 12:04:32,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 85.66666666666667) internal successors, (514), 6 states have internal predecessors, (514), 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:04:32,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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:04:32,879 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 200.0) internal successors, (1400), 7 states have internal predecessors, (1400), 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:04:32,879 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 92 flow. Second operand 6 states and 514 transitions. [2023-08-26 12:04:32,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 37 transitions, 226 flow [2023-08-26 12:04:32,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 37 transitions, 226 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 12:04:32,881 INFO L231 Difference]: Finished difference. Result has 37 places, 17 transitions, 77 flow [2023-08-26 12:04:32,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=77, PETRI_PLACES=37, PETRI_TRANSITIONS=17} [2023-08-26 12:04:32,881 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2023-08-26 12:04:32,881 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 17 transitions, 77 flow [2023-08-26 12:04:32,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 83.0) internal successors, (415), 5 states have internal predecessors, (415), 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:04:32,882 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:04:32,882 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:04:32,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 12:04:32,882 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:04:32,882 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:04:32,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1737381960, now seen corresponding path program 3 times [2023-08-26 12:04:32,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:04:32,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278296070] [2023-08-26 12:04:32,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:04:32,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:04:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 12:04:33,189 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:04:33,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 12:04:33,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278296070] [2023-08-26 12:04:33,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278296070] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 12:04:33,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 12:04:33,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 12:04:33,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974329791] [2023-08-26 12:04:33,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 12:04:33,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 12:04:33,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 12:04:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 12:04:33,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-26 12:04:33,191 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 200 [2023-08-26 12:04:33,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 17 transitions, 77 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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:04:33,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 12:04:33,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 200 [2023-08-26 12:04:33,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 12:04:33,262 INFO L124 PetriNetUnfolderBase]: 6/36 cut-off events. [2023-08-26 12:04:33,262 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2023-08-26 12:04:33,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 36 events. 6/36 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 65 event pairs, 0 based on Foata normal form. 1/37 useless extension candidates. Maximal degree in co-relation 120. Up to 13 conditions per place. [2023-08-26 12:04:33,262 INFO L140 encePairwiseOnDemand]: 193/200 looper letters, 13 selfloop transitions, 5 changer transitions 8/26 dead transitions. [2023-08-26 12:04:33,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 26 transitions, 174 flow [2023-08-26 12:04:33,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 12:04:33,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 12:04:33,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 631 transitions. [2023-08-26 12:04:33,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.394375 [2023-08-26 12:04:33,264 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 631 transitions. [2023-08-26 12:04:33,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 631 transitions. [2023-08-26 12:04:33,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 12:04:33,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 631 transitions. [2023-08-26 12:04:33,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 78.875) internal successors, (631), 8 states have internal predecessors, (631), 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:04:33,267 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 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:04:33,267 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 200.0) internal successors, (1800), 9 states have internal predecessors, (1800), 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:04:33,267 INFO L175 Difference]: Start difference. First operand has 37 places, 17 transitions, 77 flow. Second operand 8 states and 631 transitions. [2023-08-26 12:04:33,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 26 transitions, 174 flow [2023-08-26 12:04:33,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 158 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-08-26 12:04:33,269 INFO L231 Difference]: Finished difference. Result has 38 places, 17 transitions, 80 flow [2023-08-26 12:04:33,269 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=200, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=80, PETRI_PLACES=38, PETRI_TRANSITIONS=17} [2023-08-26 12:04:33,271 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 10 predicate places. [2023-08-26 12:04:33,271 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 17 transitions, 80 flow [2023-08-26 12:04:33,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 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:04:33,271 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 12:04:33,271 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 12:04:33,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 12:04:33,273 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P1Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 12:04:33,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 12:04:33,275 INFO L85 PathProgramCache]: Analyzing trace with hash -131714866, now seen corresponding path program 4 times [2023-08-26 12:04:33,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 12:04:33,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176049130] [2023-08-26 12:04:33,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 12:04:33,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 12:04:33,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:04:33,316 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 12:04:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 12:04:33,356 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 12:04:33,356 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 12:04:33,357 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 12:04:33,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 12:04:33,358 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 12:04:33,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 12:04:33,359 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 12:04:33,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 12:04:33,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 12:04:33,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 12:04:33,361 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 12:04:33,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 12:04:33,361 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-08-26 12:04:33,365 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 12:04:33,365 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 12:04:33,413 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 12:04:33 BasicIcfg [2023-08-26 12:04:33,413 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 12:04:33,414 INFO L158 Benchmark]: Toolchain (without parser) took 6647.43ms. Allocated memory was 446.7MB in the beginning and 553.6MB in the end (delta: 107.0MB). Free memory was 421.8MB in the beginning and 511.9MB in the end (delta: -90.1MB). Peak memory consumption was 18.5MB. Max. memory is 16.0GB. [2023-08-26 12:04:33,414 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 446.7MB. Free memory is still 422.7MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 12:04:33,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.75ms. Allocated memory is still 446.7MB. Free memory was 421.3MB in the beginning and 398.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 12:04:33,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.18ms. Allocated memory is still 446.7MB. Free memory was 398.1MB in the beginning and 395.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:04:33,414 INFO L158 Benchmark]: Boogie Preprocessor took 41.46ms. Allocated memory is still 446.7MB. Free memory was 395.6MB in the beginning and 394.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 12:04:33,415 INFO L158 Benchmark]: RCFGBuilder took 549.93ms. Allocated memory is still 446.7MB. Free memory was 394.1MB in the beginning and 419.4MB in the end (delta: -25.4MB). Peak memory consumption was 35.4MB. Max. memory is 16.0GB. [2023-08-26 12:04:33,415 INFO L158 Benchmark]: TraceAbstraction took 5597.82ms. Allocated memory was 446.7MB in the beginning and 553.6MB in the end (delta: 107.0MB). Free memory was 419.4MB in the beginning and 511.9MB in the end (delta: -92.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.0GB. [2023-08-26 12:04:33,416 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 446.7MB. Free memory is still 422.7MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 410.75ms. Allocated memory is still 446.7MB. Free memory was 421.3MB in the beginning and 398.1MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.18ms. Allocated memory is still 446.7MB. Free memory was 398.1MB in the beginning and 395.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.46ms. Allocated memory is still 446.7MB. Free memory was 395.6MB in the beginning and 394.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 549.93ms. Allocated memory is still 446.7MB. Free memory was 394.1MB in the beginning and 419.4MB in the end (delta: -25.4MB). Peak memory consumption was 35.4MB. Max. memory is 16.0GB. * TraceAbstraction took 5597.82ms. Allocated memory was 446.7MB in the beginning and 553.6MB in the end (delta: 107.0MB). Free memory was 419.4MB in the beginning and 511.9MB in the end (delta: -92.5MB). Peak memory consumption was 14.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 101 PlacesBefore, 28 PlacesAfterwards, 97 TransitionsBefore, 22 TransitionsAfterwards, 1220 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 101 TotalNumberOfCompositions, 3073 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1570, independent: 1430, independent conditional: 0, independent unconditional: 1430, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 722, independent: 694, independent conditional: 0, independent unconditional: 694, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1570, independent: 736, independent conditional: 0, independent unconditional: 736, dependent: 112, dependent conditional: 0, dependent unconditional: 112, unknown: 722, unknown conditional: 0, unknown unconditional: 722] , Statistics on independence cache: Total cache size (in pairs): 54, Positive cache size: 42, Positive conditional cache size: 0, Positive unconditional cache size: 42, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff1_thd0; [L726] 0 _Bool x$r_buff1_thd1; [L727] 0 _Bool x$r_buff1_thd2; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L813] 0 pthread_t t903; [L814] FCALL, FORK 0 pthread_create(&t903, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t903, ((void *)0), P0, ((void *)0))=-2, t903={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L815] 0 pthread_t t904; [L816] FCALL, FORK 0 pthread_create(&t904, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t904, ((void *)0), P1, ((void *)0))=-1, t903={5:0}, t904={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L771] 2 x$w_buff1 = x$w_buff0 [L772] 2 x$w_buff0 = 1 [L773] 2 x$w_buff1_used = x$w_buff0_used [L774] 2 x$w_buff0_used = (_Bool)1 [L775] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L775] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L776] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L777] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L778] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L779] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L782] 2 y = 1 [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L788] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L747] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L748] 1 x$flush_delayed = weak$$choice2 [L749] 1 x$mem_tmp = x [L750] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L751] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L752] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L753] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L754] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L756] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 __unbuffered_p0_EAX = x [L758] 1 x = x$flush_delayed ? x$mem_tmp : x [L759] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L791] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L793] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L794] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L795] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L798] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 2 return 0; [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L823] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L824] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L825] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L826] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t903={5:0}, t904={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L829] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L831] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix034_pso.opt_tso.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: 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: 814]: 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: 816]: 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, 117 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: 5.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 4 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 359 IncrementalHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 3 mSDtfsCounter, 359 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=6, InterpolantAutomatonStates: 38, 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, 1.1s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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:04:33,437 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...