/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/mix003.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 11:56:56,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 11:56:57,051 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 11:56:57,058 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 11:56:57,058 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 11:56:57,088 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 11:56:57,088 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 11:56:57,088 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 11:56:57,089 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 11:56:57,091 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 11:56:57,092 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 11:56:57,092 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 11:56:57,092 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 11:56:57,093 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 11:56:57,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 11:56:57,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 11:56:57,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 11:56:57,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 11:56:57,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 11:56:57,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 11:56:57,094 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 11:56:57,094 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 11:56:57,094 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 11:56:57,095 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 11:56:57,095 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 11:56:57,095 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 11:56:57,095 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 11:56:57,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:56:57,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 11:56:57,096 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 11:56:57,096 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 11:56:57,096 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 11:56:57,096 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 11:56:57,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 11:56:57,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 11:56:57,097 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 11:56:57,315 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 11:56:57,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 11:56:57,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 11:56:57,329 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 11:56:57,329 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 11:56:57,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2023-08-26 11:56:58,257 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 11:56:58,486 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 11:56:58,487 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2023-08-26 11:56:58,497 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af79c4e23/5748d5e568ae40f18705e3de568fe9af/FLAG3d106a6ec [2023-08-26 11:56:58,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af79c4e23/5748d5e568ae40f18705e3de568fe9af [2023-08-26 11:56:58,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 11:56:58,510 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 11:56:58,510 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 11:56:58,510 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 11:56:58,512 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 11:56:58,513 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30cbfc67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58, skipping insertion in model container [2023-08-26 11:56:58,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,548 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 11:56:58,722 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:56:58,729 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 11:56:58,741 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 11:56:58,742 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 11:56:58,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 11:56:58,780 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 11:56:58,780 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 11:56:58,785 INFO L206 MainTranslator]: Completed translation [2023-08-26 11:56:58,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58 WrapperNode [2023-08-26 11:56:58,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 11:56:58,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 11:56:58,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 11:56:58,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 11:56:58,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,800 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,816 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 137 [2023-08-26 11:56:58,816 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 11:56:58,817 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 11:56:58,817 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 11:56:58,817 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 11:56:58,822 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,831 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,837 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 11:56:58,837 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 11:56:58,838 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 11:56:58,838 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 11:56:58,838 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (1/1) ... [2023-08-26 11:56:58,842 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 11:56:58,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 11:56:58,859 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 11:56:58,881 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 11:56:58,891 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 11:56:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 11:56:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 11:56:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 11:56:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 11:56:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 11:56:58,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 11:56:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 11:56:58,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 11:56:58,892 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 11:56:58,892 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 11:56:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 11:56:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 11:56:58,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 11:56:58,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 11:56:58,895 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 11:56:59,037 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 11:56:59,038 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 11:56:59,311 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 11:56:59,397 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 11:56:59,397 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 11:56:59,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:56:59 BoogieIcfgContainer [2023-08-26 11:56:59,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 11:56:59,400 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 11:56:59,400 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 11:56:59,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 11:56:59,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 11:56:58" (1/3) ... [2023-08-26 11:56:59,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28365bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:56:59, skipping insertion in model container [2023-08-26 11:56:59,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 11:56:58" (2/3) ... [2023-08-26 11:56:59,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28365bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 11:56:59, skipping insertion in model container [2023-08-26 11:56:59,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 11:56:59" (3/3) ... [2023-08-26 11:56:59,404 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2023-08-26 11:56:59,417 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 11:56:59,418 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 11:56:59,418 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 11:56:59,457 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 11:56:59,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 261 flow [2023-08-26 11:56:59,525 INFO L124 PetriNetUnfolderBase]: 3/120 cut-off events. [2023-08-26 11:56:59,525 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:56:59,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-26 11:56:59,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 123 transitions, 261 flow [2023-08-26 11:56:59,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 120 transitions, 249 flow [2023-08-26 11:56:59,535 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 11:56:59,543 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 120 transitions, 249 flow [2023-08-26 11:56:59,545 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 120 transitions, 249 flow [2023-08-26 11:56:59,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 120 transitions, 249 flow [2023-08-26 11:56:59,565 INFO L124 PetriNetUnfolderBase]: 3/120 cut-off events. [2023-08-26 11:56:59,565 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:56:59,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-26 11:56:59,567 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-26 11:57:02,707 INFO L134 LiptonReduction]: Checked pairs total: 7055 [2023-08-26 11:57:02,707 INFO L136 LiptonReduction]: Total number of compositions: 128 [2023-08-26 11:57:02,716 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 11:57:02,720 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;@2c1e7c9f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 11:57:02,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 11:57:02,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 11:57:02,721 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 11:57:02,721 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:57:02,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:02,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 11:57:02,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:02,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:02,726 INFO L85 PathProgramCache]: Analyzing trace with hash 559, now seen corresponding path program 1 times [2023-08-26 11:57:02,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:02,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134614644] [2023-08-26 11:57:02,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:02,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:02,799 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 11:57:02,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:02,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134614644] [2023-08-26 11:57:02,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134614644] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:02,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:02,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 11:57:02,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285493927] [2023-08-26 11:57:02,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:02,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 11:57:02,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:02,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 11:57:02,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 11:57:02,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-26 11:57:02,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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 11:57:02,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:02,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-26 11:57:02,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:03,091 INFO L124 PetriNetUnfolderBase]: 1146/1744 cut-off events. [2023-08-26 11:57:03,091 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-08-26 11:57:03,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3498 conditions, 1744 events. 1146/1744 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 8387 event pairs, 1146 based on Foata normal form. 0/1503 useless extension candidates. Maximal degree in co-relation 3487. Up to 1698 conditions per place. [2023-08-26 11:57:03,099 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 21 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-26 11:57:03,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 101 flow [2023-08-26 11:57:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 11:57:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 11:57:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 246 transitions. [2023-08-26 11:57:03,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900398406374502 [2023-08-26 11:57:03,108 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 246 transitions. [2023-08-26 11:57:03,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 246 transitions. [2023-08-26 11:57:03,109 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:03,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 246 transitions. [2023-08-26 11:57:03,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 123.0) internal successors, (246), 2 states have internal predecessors, (246), 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 11:57:03,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 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 11:57:03,115 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 251.0) internal successors, (753), 3 states have internal predecessors, (753), 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 11:57:03,116 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 246 transitions. [2023-08-26 11:57:03,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 101 flow [2023-08-26 11:57:03,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 98 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 11:57:03,118 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-26 11:57:03,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2023-08-26 11:57:03,122 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-26 11:57:03,122 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-26 11:57:03,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 109.5) internal successors, (219), 2 states have internal predecessors, (219), 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 11:57:03,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:03,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 11:57:03,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 11:57:03,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:03,123 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:03,123 INFO L85 PathProgramCache]: Analyzing trace with hash 548175, now seen corresponding path program 1 times [2023-08-26 11:57:03,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:03,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813326980] [2023-08-26 11:57:03,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:03,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:03,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:03,346 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 11:57:03,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:03,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813326980] [2023-08-26 11:57:03,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813326980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:03,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:03,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:57:03,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461858460] [2023-08-26 11:57:03,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:03,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:57:03,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:03,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:57:03,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:57:03,350 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-26 11:57:03,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 11:57:03,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:03,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-26 11:57:03,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:03,493 INFO L124 PetriNetUnfolderBase]: 895/1372 cut-off events. [2023-08-26 11:57:03,493 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 11:57:03,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2753 conditions, 1372 events. 895/1372 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6357 event pairs, 400 based on Foata normal form. 0/1285 useless extension candidates. Maximal degree in co-relation 2750. Up to 1084 conditions per place. [2023-08-26 11:57:03,499 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-26 11:57:03,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 158 flow [2023-08-26 11:57:03,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:57:03,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:57:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2023-08-26 11:57:03,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47808764940239046 [2023-08-26 11:57:03,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2023-08-26 11:57:03,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2023-08-26 11:57:03,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:03,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2023-08-26 11:57:03,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 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 11:57:03,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 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 11:57:03,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 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 11:57:03,509 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 360 transitions. [2023-08-26 11:57:03,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 158 flow [2023-08-26 11:57:03,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 158 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 11:57:03,510 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-26 11:57:03,512 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-26 11:57:03,512 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-26 11:57:03,513 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-26 11:57:03,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 11:57:03,514 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:03,514 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:03,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 11:57:03,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:03,520 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:03,520 INFO L85 PathProgramCache]: Analyzing trace with hash 109952605, now seen corresponding path program 1 times [2023-08-26 11:57:03,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:03,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93332392] [2023-08-26 11:57:03,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:03,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:03,689 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 11:57:03,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:03,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93332392] [2023-08-26 11:57:03,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93332392] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:03,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:03,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:57:03,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027719098] [2023-08-26 11:57:03,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:03,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:57:03,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:03,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:57:03,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:57:03,692 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 251 [2023-08-26 11:57:03,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 11:57:03,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:03,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 251 [2023-08-26 11:57:03,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:03,824 INFO L124 PetriNetUnfolderBase]: 775/1182 cut-off events. [2023-08-26 11:57:03,824 INFO L125 PetriNetUnfolderBase]: For 97/97 co-relation queries the response was YES. [2023-08-26 11:57:03,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2495 conditions, 1182 events. 775/1182 cut-off events. For 97/97 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5234 event pairs, 263 based on Foata normal form. 32/1201 useless extension candidates. Maximal degree in co-relation 2491. Up to 817 conditions per place. [2023-08-26 11:57:03,828 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 26 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2023-08-26 11:57:03,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 31 transitions, 130 flow [2023-08-26 11:57:03,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:57:03,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:57:03,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-26 11:57:03,830 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46082337317397076 [2023-08-26 11:57:03,830 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-26 11:57:03,830 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-26 11:57:03,830 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:03,830 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-26 11:57:03,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 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 11:57:03,832 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 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 11:57:03,832 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 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 11:57:03,833 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 3 states and 347 transitions. [2023-08-26 11:57:03,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 31 transitions, 130 flow [2023-08-26 11:57:03,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 31 transitions, 124 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 11:57:03,834 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 60 flow [2023-08-26 11:57:03,834 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2023-08-26 11:57:03,835 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-26 11:57:03,835 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 60 flow [2023-08-26 11:57:03,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.0) internal successors, (327), 3 states have internal predecessors, (327), 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 11:57:03,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:03,836 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:03,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 11:57:03,838 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:03,838 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:03,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1711566294, now seen corresponding path program 1 times [2023-08-26 11:57:03,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:03,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263706669] [2023-08-26 11:57:03,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:03,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:03,969 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 11:57:03,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:03,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263706669] [2023-08-26 11:57:03,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263706669] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:03,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:03,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 11:57:03,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965307325] [2023-08-26 11:57:03,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:03,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 11:57:03,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:03,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 11:57:03,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 11:57:03,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 251 [2023-08-26 11:57:03,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:57:03,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:03,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 251 [2023-08-26 11:57:03,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:04,088 INFO L124 PetriNetUnfolderBase]: 778/1260 cut-off events. [2023-08-26 11:57:04,088 INFO L125 PetriNetUnfolderBase]: For 72/84 co-relation queries the response was YES. [2023-08-26 11:57:04,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2571 conditions, 1260 events. 778/1260 cut-off events. For 72/84 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5963 event pairs, 265 based on Foata normal form. 36/1287 useless extension candidates. Maximal degree in co-relation 2566. Up to 798 conditions per place. [2023-08-26 11:57:04,093 INFO L140 encePairwiseOnDemand]: 248/251 looper letters, 29 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-26 11:57:04,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 34 transitions, 146 flow [2023-08-26 11:57:04,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 11:57:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 11:57:04,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2023-08-26 11:57:04,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4648074369189907 [2023-08-26 11:57:04,094 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 350 transitions. [2023-08-26 11:57:04,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 350 transitions. [2023-08-26 11:57:04,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:04,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 350 transitions. [2023-08-26 11:57:04,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:57:04,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 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 11:57:04,096 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 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 11:57:04,096 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 60 flow. Second operand 3 states and 350 transitions. [2023-08-26 11:57:04,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 34 transitions, 146 flow [2023-08-26 11:57:04,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 11:57:04,097 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 64 flow [2023-08-26 11:57:04,098 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-26 11:57:04,098 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2023-08-26 11:57:04,098 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 64 flow [2023-08-26 11:57:04,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 11:57:04,098 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:04,098 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:04,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 11:57:04,099 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:04,099 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:04,099 INFO L85 PathProgramCache]: Analyzing trace with hash 93194318, now seen corresponding path program 1 times [2023-08-26 11:57:04,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:04,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661410260] [2023-08-26 11:57:04,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:04,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:04,193 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 11:57:04,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:04,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661410260] [2023-08-26 11:57:04,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661410260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:04,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:04,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:57:04,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052399366] [2023-08-26 11:57:04,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:04,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:57:04,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:04,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:57:04,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:57:04,195 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-08-26 11:57:04,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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 11:57:04,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:04,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-08-26 11:57:04,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:04,346 INFO L124 PetriNetUnfolderBase]: 501/842 cut-off events. [2023-08-26 11:57:04,347 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-26 11:57:04,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1792 conditions, 842 events. 501/842 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4080 event pairs, 104 based on Foata normal form. 80/914 useless extension candidates. Maximal degree in co-relation 1786. Up to 472 conditions per place. [2023-08-26 11:57:04,350 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 29 selfloop transitions, 4 changer transitions 21/58 dead transitions. [2023-08-26 11:57:04,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 58 transitions, 246 flow [2023-08-26 11:57:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:57:04,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:57:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2023-08-26 11:57:04,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.450996015936255 [2023-08-26 11:57:04,352 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2023-08-26 11:57:04,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2023-08-26 11:57:04,352 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:04,352 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2023-08-26 11:57:04,353 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 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 11:57:04,355 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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 11:57:04,355 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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 11:57:04,356 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 64 flow. Second operand 5 states and 566 transitions. [2023-08-26 11:57:04,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 58 transitions, 246 flow [2023-08-26 11:57:04,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 58 transitions, 242 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 11:57:04,357 INFO L231 Difference]: Finished difference. Result has 40 places, 26 transitions, 96 flow [2023-08-26 11:57:04,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=40, PETRI_TRANSITIONS=26} [2023-08-26 11:57:04,359 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-26 11:57:04,359 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 26 transitions, 96 flow [2023-08-26 11:57:04,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 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 11:57:04,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:04,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:04,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 11:57:04,360 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:04,360 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1747260058, now seen corresponding path program 1 times [2023-08-26 11:57:04,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:04,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012571235] [2023-08-26 11:57:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:04,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:04,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:04,515 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 11:57:04,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012571235] [2023-08-26 11:57:04,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012571235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:04,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:04,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 11:57:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411428722] [2023-08-26 11:57:04,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:04,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 11:57:04,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:04,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 11:57:04,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 11:57:04,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-08-26 11:57:04,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 26 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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 11:57:04,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:04,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-08-26 11:57:04,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:04,652 INFO L124 PetriNetUnfolderBase]: 252/470 cut-off events. [2023-08-26 11:57:04,652 INFO L125 PetriNetUnfolderBase]: For 156/156 co-relation queries the response was YES. [2023-08-26 11:57:04,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1281 conditions, 470 events. 252/470 cut-off events. For 156/156 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2060 event pairs, 71 based on Foata normal form. 44/506 useless extension candidates. Maximal degree in co-relation 1272. Up to 151 conditions per place. [2023-08-26 11:57:04,654 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 38 selfloop transitions, 7 changer transitions 21/70 dead transitions. [2023-08-26 11:57:04,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 70 transitions, 360 flow [2023-08-26 11:57:04,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 11:57:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 11:57:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions. [2023-08-26 11:57:04,656 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45152722443559096 [2023-08-26 11:57:04,656 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 680 transitions. [2023-08-26 11:57:04,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 680 transitions. [2023-08-26 11:57:04,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:04,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 680 transitions. [2023-08-26 11:57:04,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 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 11:57:04,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 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 11:57:04,660 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 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 11:57:04,660 INFO L175 Difference]: Start difference. First operand has 40 places, 26 transitions, 96 flow. Second operand 6 states and 680 transitions. [2023-08-26 11:57:04,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 70 transitions, 360 flow [2023-08-26 11:57:04,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 70 transitions, 354 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 11:57:04,662 INFO L231 Difference]: Finished difference. Result has 44 places, 29 transitions, 146 flow [2023-08-26 11:57:04,662 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=146, PETRI_PLACES=44, PETRI_TRANSITIONS=29} [2023-08-26 11:57:04,662 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-26 11:57:04,662 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 29 transitions, 146 flow [2023-08-26 11:57:04,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.6) internal successors, (523), 5 states have internal predecessors, (523), 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 11:57:04,663 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:04,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:04,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 11:57:04,663 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:04,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:04,663 INFO L85 PathProgramCache]: Analyzing trace with hash 492546746, now seen corresponding path program 1 times [2023-08-26 11:57:04,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:04,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707645990] [2023-08-26 11:57:04,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:04,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:04,818 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 11:57:04,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:04,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707645990] [2023-08-26 11:57:04,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707645990] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:04,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:04,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 11:57:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525802570] [2023-08-26 11:57:04,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:04,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 11:57:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:04,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 11:57:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 11:57:04,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 251 [2023-08-26 11:57:04,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 29 transitions, 146 flow. Second operand has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 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 11:57:04,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:04,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 251 [2023-08-26 11:57:04,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:04,930 INFO L124 PetriNetUnfolderBase]: 168/325 cut-off events. [2023-08-26 11:57:04,930 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2023-08-26 11:57:04,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 939 conditions, 325 events. 168/325 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1353 event pairs, 68 based on Foata normal form. 11/328 useless extension candidates. Maximal degree in co-relation 928. Up to 129 conditions per place. [2023-08-26 11:57:04,932 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 35 selfloop transitions, 10 changer transitions 11/60 dead transitions. [2023-08-26 11:57:04,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 354 flow [2023-08-26 11:57:04,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 11:57:04,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 11:57:04,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 772 transitions. [2023-08-26 11:57:04,934 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43938531587933977 [2023-08-26 11:57:04,934 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 772 transitions. [2023-08-26 11:57:04,934 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 772 transitions. [2023-08-26 11:57:04,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:04,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 772 transitions. [2023-08-26 11:57:04,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.28571428571429) internal successors, (772), 7 states have internal predecessors, (772), 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 11:57:04,937 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 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 11:57:04,937 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 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 11:57:04,937 INFO L175 Difference]: Start difference. First operand has 44 places, 29 transitions, 146 flow. Second operand 7 states and 772 transitions. [2023-08-26 11:57:04,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 354 flow [2023-08-26 11:57:04,939 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 60 transitions, 310 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-26 11:57:04,940 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2023-08-26 11:57:04,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-26 11:57:04,940 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-26 11:57:04,940 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2023-08-26 11:57:04,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 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 11:57:04,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:04,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:04,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 11:57:04,941 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:04,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:04,941 INFO L85 PathProgramCache]: Analyzing trace with hash -128922591, now seen corresponding path program 1 times [2023-08-26 11:57:04,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:04,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996535106] [2023-08-26 11:57:04,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:04,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:04,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:05,515 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 11:57:05,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:05,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996535106] [2023-08-26 11:57:05,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996535106] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:05,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:05,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 11:57:05,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121930839] [2023-08-26 11:57:05,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:05,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 11:57:05,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:05,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 11:57:05,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-08-26 11:57:05,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 251 [2023-08-26 11:57:05,518 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 7 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 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 11:57:05,518 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:05,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 251 [2023-08-26 11:57:05,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:05,684 INFO L124 PetriNetUnfolderBase]: 221/445 cut-off events. [2023-08-26 11:57:05,684 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2023-08-26 11:57:05,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1292 conditions, 445 events. 221/445 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2167 event pairs, 39 based on Foata normal form. 1/443 useless extension candidates. Maximal degree in co-relation 1282. Up to 144 conditions per place. [2023-08-26 11:57:05,686 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 46 selfloop transitions, 7 changer transitions 26/83 dead transitions. [2023-08-26 11:57:05,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 83 transitions, 602 flow [2023-08-26 11:57:05,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 11:57:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 11:57:05,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 765 transitions. [2023-08-26 11:57:05,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43540125213431985 [2023-08-26 11:57:05,690 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 765 transitions. [2023-08-26 11:57:05,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 765 transitions. [2023-08-26 11:57:05,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:05,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 765 transitions. [2023-08-26 11:57:05,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.28571428571429) internal successors, (765), 7 states have internal predecessors, (765), 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 11:57:05,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 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 11:57:05,693 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 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 11:57:05,693 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 7 states and 765 transitions. [2023-08-26 11:57:05,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 83 transitions, 602 flow [2023-08-26 11:57:05,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 83 transitions, 480 flow, removed 36 selfloop flow, removed 6 redundant places. [2023-08-26 11:57:05,697 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 145 flow [2023-08-26 11:57:05,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-08-26 11:57:05,697 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2023-08-26 11:57:05,698 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 145 flow [2023-08-26 11:57:05,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.71428571428571) internal successors, (726), 7 states have internal predecessors, (726), 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 11:57:05,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:05,698 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:05,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 11:57:05,698 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:05,698 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:05,698 INFO L85 PathProgramCache]: Analyzing trace with hash 43676345, now seen corresponding path program 2 times [2023-08-26 11:57:05,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:05,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781123377] [2023-08-26 11:57:05,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:05,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:05,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:05,858 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 11:57:05,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:05,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781123377] [2023-08-26 11:57:05,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781123377] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:05,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:05,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:57:05,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051345550] [2023-08-26 11:57:05,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:05,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:57:05,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:05,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:57:05,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:57:05,859 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 251 [2023-08-26 11:57:05,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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 11:57:05,860 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:05,860 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 251 [2023-08-26 11:57:05,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:06,008 INFO L124 PetriNetUnfolderBase]: 653/1148 cut-off events. [2023-08-26 11:57:06,009 INFO L125 PetriNetUnfolderBase]: For 938/938 co-relation queries the response was YES. [2023-08-26 11:57:06,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3433 conditions, 1148 events. 653/1148 cut-off events. For 938/938 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5512 event pairs, 51 based on Foata normal form. 1/1149 useless extension candidates. Maximal degree in co-relation 3423. Up to 688 conditions per place. [2023-08-26 11:57:06,012 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 70 selfloop transitions, 10 changer transitions 7/87 dead transitions. [2023-08-26 11:57:06,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 87 transitions, 537 flow [2023-08-26 11:57:06,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:57:06,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:57:06,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2023-08-26 11:57:06,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4350597609561753 [2023-08-26 11:57:06,014 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 546 transitions. [2023-08-26 11:57:06,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 546 transitions. [2023-08-26 11:57:06,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:06,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 546 transitions. [2023-08-26 11:57:06,015 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 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 11:57:06,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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 11:57:06,017 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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 11:57:06,017 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 145 flow. Second operand 5 states and 546 transitions. [2023-08-26 11:57:06,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 87 transitions, 537 flow [2023-08-26 11:57:06,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 87 transitions, 534 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 11:57:06,021 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 213 flow [2023-08-26 11:57:06,021 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=213, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2023-08-26 11:57:06,022 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-26 11:57:06,022 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 213 flow [2023-08-26 11:57:06,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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 11:57:06,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:06,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:06,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 11:57:06,022 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:06,023 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:06,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1104888065, now seen corresponding path program 3 times [2023-08-26 11:57:06,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:06,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19988617] [2023-08-26 11:57:06,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:06,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:06,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 11:57:06,164 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 11:57:06,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 11:57:06,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19988617] [2023-08-26 11:57:06,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19988617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 11:57:06,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 11:57:06,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 11:57:06,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751712685] [2023-08-26 11:57:06,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 11:57:06,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 11:57:06,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 11:57:06,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 11:57:06,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 11:57:06,165 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 251 [2023-08-26 11:57:06,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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 11:57:06,166 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 11:57:06,166 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 251 [2023-08-26 11:57:06,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 11:57:06,312 INFO L124 PetriNetUnfolderBase]: 754/1335 cut-off events. [2023-08-26 11:57:06,312 INFO L125 PetriNetUnfolderBase]: For 1775/1775 co-relation queries the response was YES. [2023-08-26 11:57:06,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4644 conditions, 1335 events. 754/1335 cut-off events. For 1775/1775 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6537 event pairs, 136 based on Foata normal form. 1/1336 useless extension candidates. Maximal degree in co-relation 4632. Up to 748 conditions per place. [2023-08-26 11:57:06,316 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 49 selfloop transitions, 16 changer transitions 26/91 dead transitions. [2023-08-26 11:57:06,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 91 transitions, 644 flow [2023-08-26 11:57:06,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 11:57:06,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 11:57:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 541 transitions. [2023-08-26 11:57:06,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43107569721115535 [2023-08-26 11:57:06,317 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 541 transitions. [2023-08-26 11:57:06,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 541 transitions. [2023-08-26 11:57:06,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 11:57:06,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 541 transitions. [2023-08-26 11:57:06,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 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 11:57:06,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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 11:57:06,320 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 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 11:57:06,320 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 213 flow. Second operand 5 states and 541 transitions. [2023-08-26 11:57:06,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 91 transitions, 644 flow [2023-08-26 11:57:06,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 91 transitions, 644 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 11:57:06,327 INFO L231 Difference]: Finished difference. Result has 56 places, 49 transitions, 331 flow [2023-08-26 11:57:06,327 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=331, PETRI_PLACES=56, PETRI_TRANSITIONS=49} [2023-08-26 11:57:06,327 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2023-08-26 11:57:06,327 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 49 transitions, 331 flow [2023-08-26 11:57:06,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 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 11:57:06,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 11:57:06,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:06,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 11:57:06,328 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 11:57:06,328 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 11:57:06,328 INFO L85 PathProgramCache]: Analyzing trace with hash 939477489, now seen corresponding path program 4 times [2023-08-26 11:57:06,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 11:57:06,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83993068] [2023-08-26 11:57:06,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 11:57:06,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 11:57:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:57:06,360 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 11:57:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 11:57:06,411 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 11:57:06,411 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 11:57:06,412 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 11:57:06,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 11:57:06,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 11:57:06,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 11:57:06,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 11:57:06,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 11:57:06,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 11:57:06,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 11:57:06,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 11:57:06,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 11:57:06,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 11:57:06,414 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 11:57:06,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 11:57:06,414 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 11:57:06,417 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 11:57:06,417 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 11:57:06,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 11:57:06 BasicIcfg [2023-08-26 11:57:06,469 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 11:57:06,469 INFO L158 Benchmark]: Toolchain (without parser) took 7959.84ms. Allocated memory was 367.0MB in the beginning and 528.5MB in the end (delta: 161.5MB). Free memory was 341.8MB in the beginning and 496.7MB in the end (delta: -154.9MB). Peak memory consumption was 311.4MB. Max. memory is 16.0GB. [2023-08-26 11:57:06,469 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 367.0MB. Free memory is still 343.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 11:57:06,470 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.16ms. Allocated memory is still 367.0MB. Free memory was 341.8MB in the beginning and 318.4MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 11:57:06,470 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.24ms. Allocated memory is still 367.0MB. Free memory was 317.9MB in the beginning and 315.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:57:06,470 INFO L158 Benchmark]: Boogie Preprocessor took 20.41ms. Allocated memory is still 367.0MB. Free memory was 315.8MB in the beginning and 313.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 11:57:06,470 INFO L158 Benchmark]: RCFGBuilder took 561.20ms. Allocated memory is still 367.0MB. Free memory was 313.7MB in the beginning and 325.9MB in the end (delta: -12.2MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. [2023-08-26 11:57:06,470 INFO L158 Benchmark]: TraceAbstraction took 7069.00ms. Allocated memory was 367.0MB in the beginning and 528.5MB in the end (delta: 161.5MB). Free memory was 325.9MB in the beginning and 496.7MB in the end (delta: -170.7MB). Peak memory consumption was 294.7MB. Max. memory is 16.0GB. [2023-08-26 11:57:06,471 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 367.0MB. Free memory is still 343.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 275.16ms. Allocated memory is still 367.0MB. Free memory was 341.8MB in the beginning and 318.4MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 30.24ms. Allocated memory is still 367.0MB. Free memory was 317.9MB in the beginning and 315.8MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 20.41ms. Allocated memory is still 367.0MB. Free memory was 315.8MB in the beginning and 313.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 561.20ms. Allocated memory is still 367.0MB. Free memory was 313.7MB in the beginning and 325.9MB in the end (delta: -12.2MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. * TraceAbstraction took 7069.00ms. Allocated memory was 367.0MB in the beginning and 528.5MB in the end (delta: 161.5MB). Free memory was 325.9MB in the beginning and 496.7MB in the end (delta: -170.7MB). Peak memory consumption was 294.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 127 PlacesBefore, 41 PlacesAfterwards, 120 TransitionsBefore, 32 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 128 TotalNumberOfCompositions, 7055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2784, independent: 2591, independent conditional: 0, independent unconditional: 2591, dependent: 193, dependent conditional: 0, dependent unconditional: 193, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1379, independent: 1343, independent conditional: 0, independent unconditional: 1343, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2784, independent: 1248, independent conditional: 0, independent unconditional: 1248, dependent: 157, dependent conditional: 0, dependent unconditional: 157, unknown: 1379, unknown conditional: 0, unknown unconditional: 1379] , Statistics on independence cache: Total cache size (in pairs): 128, Positive cache size: 112, Positive conditional cache size: 0, Positive unconditional cache size: 112, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: 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; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t62; [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62, ((void *)0), P0, ((void *)0))=-2, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t63; [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t63, ((void *)0), P1, ((void *)0))=-1, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 0 pthread_t t64; [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t64, ((void *)0), P2, ((void *)0))=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L801] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L804] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0: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=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix003.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 848]: 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: 850]: 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: 846]: 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 7 procedures, 151 locations, 12 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 6.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 209 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 209 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 771 IncrementalHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 12 mSDtfsCounter, 771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=331occurred in iteration=10, InterpolantAutomatonStates: 46, 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.6s InterpolantComputationTime, 164 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 131 ConstructedInterpolants, 0 QuantifiedInterpolants, 779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 11:57:06,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...