/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 --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -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/mix006_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 18:09:00,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 18:09:00,624 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 18:09:00,628 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 18:09:00,629 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 18:09:00,655 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 18:09:00,655 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 18:09:00,656 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 18:09:00,656 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 18:09:00,659 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 18:09:00,660 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 18:09:00,660 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 18:09:00,660 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 18:09:00,661 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 18:09:00,661 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 18:09:00,661 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 18:09:00,661 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 18:09:00,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 18:09:00,662 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 18:09:00,662 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 18:09:00,662 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 18:09:00,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 18:09:00,663 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 18:09:00,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 18:09:00,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 18:09:00,663 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 18:09:00,664 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 18:09:00,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:09:00,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 18:09:00,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 18:09:00,665 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 18:09:00,665 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 18:09:00,665 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 18:09:00,665 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 18:09:00,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 18:09:00,666 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.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST 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 18:09:00,963 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 18:09:00,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 18:09:00,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 18:09:00,979 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 18:09:00,980 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 18:09:00,981 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:09:01,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 18:09:02,213 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 18:09:02,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:09:02,225 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a522a2fa4/353e2f1934ea4e6fb46425d7579c4137/FLAG5c75a8212 [2023-08-26 18:09:02,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a522a2fa4/353e2f1934ea4e6fb46425d7579c4137 [2023-08-26 18:09:02,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 18:09:02,561 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 18:09:02,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 18:09:02,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 18:09:02,565 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 18:09:02,565 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:09:02" (1/1) ... [2023-08-26 18:09:02,566 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1011f3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:02, skipping insertion in model container [2023-08-26 18:09:02,566 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 06:09:02" (1/1) ... [2023-08-26 18:09:02,617 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 18:09:02,924 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:09:02,936 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 18:09:02,962 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:09:02,963 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 18:09:02,997 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 18:09:03,027 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:09:03,027 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 18:09:03,032 INFO L206 MainTranslator]: Completed translation [2023-08-26 18:09:03,032 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03 WrapperNode [2023-08-26 18:09:03,032 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 18:09:03,033 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 18:09:03,034 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 18:09:03,034 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 18:09:03,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,065 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,082 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 136 [2023-08-26 18:09:03,082 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 18:09:03,083 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 18:09:03,083 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 18:09:03,083 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 18:09:03,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,097 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,107 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,108 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,115 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,120 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 18:09:03,135 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 18:09:03,135 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 18:09:03,135 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 18:09:03,136 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (1/1) ... [2023-08-26 18:09:03,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 18:09:03,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 18:09:03,157 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 18:09:03,176 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 18:09:03,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 18:09:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 18:09:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 18:09:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 18:09:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 18:09:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 18:09:03,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 18:09:03,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 18:09:03,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 18:09:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 18:09:03,194 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 18:09:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 18:09:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 18:09:03,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 18:09:03,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 18:09:03,196 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 18:09:03,329 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 18:09:03,330 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 18:09:03,587 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 18:09:03,724 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 18:09:03,724 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 18:09:03,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:09:03 BoogieIcfgContainer [2023-08-26 18:09:03,726 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 18:09:03,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 18:09:03,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 18:09:03,730 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 18:09:03,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 06:09:02" (1/3) ... [2023-08-26 18:09:03,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c7ae3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:09:03, skipping insertion in model container [2023-08-26 18:09:03,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 06:09:03" (2/3) ... [2023-08-26 18:09:03,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c7ae3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 06:09:03, skipping insertion in model container [2023-08-26 18:09:03,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 06:09:03" (3/3) ... [2023-08-26 18:09:03,732 INFO L112 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc_pso.oepc_rmo.oepc.i [2023-08-26 18:09:03,744 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 18:09:03,744 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-26 18:09:03,744 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 18:09:03,798 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 18:09:03,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 259 flow [2023-08-26 18:09:03,878 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-26 18:09:03,878 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:09:03,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 98 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-26 18:09:03,885 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 122 transitions, 259 flow [2023-08-26 18:09:03,889 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 119 transitions, 247 flow [2023-08-26 18:09:03,892 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 18:09:03,903 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-26 18:09:03,906 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-26 18:09:03,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 119 transitions, 247 flow [2023-08-26 18:09:03,939 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-26 18:09:03,940 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:09:03,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 97 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2023-08-26 18:09:03,942 INFO L119 LiptonReduction]: Number of co-enabled transitions 2400 [2023-08-26 18:09:07,056 INFO L134 LiptonReduction]: Checked pairs total: 7188 [2023-08-26 18:09:07,056 INFO L136 LiptonReduction]: Total number of compositions: 121 [2023-08-26 18:09:07,065 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 18:09:07,069 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;@5de8c577, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 18:09:07,070 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2023-08-26 18:09:07,071 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 18:09:07,071 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 18:09:07,071 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:09:07,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:07,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 18:09:07,072 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 18:09:07,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:07,075 INFO L85 PathProgramCache]: Analyzing trace with hash 550, now seen corresponding path program 1 times [2023-08-26 18:09:07,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:07,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819594734] [2023-08-26 18:09:07,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:07,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:07,151 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 18:09:07,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:07,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819594734] [2023-08-26 18:09:07,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819594734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:07,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:07,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 18:09:07,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836470266] [2023-08-26 18:09:07,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:07,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 18:09:07,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:07,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 18:09:07,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 18:09:07,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 243 [2023-08-26 18:09:07,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 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 18:09:07,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:07,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 243 [2023-08-26 18:09:07,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:07,384 INFO L124 PetriNetUnfolderBase]: 1146/1721 cut-off events. [2023-08-26 18:09:07,384 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-26 18:09:07,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3475 conditions, 1721 events. 1146/1721 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 8194 event pairs, 1146 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 3464. Up to 1698 conditions per place. [2023-08-26 18:09:07,395 INFO L140 encePairwiseOnDemand]: 236/243 looper letters, 21 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2023-08-26 18:09:07,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 101 flow [2023-08-26 18:09:07,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 18:09:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 18:09:07,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 244 transitions. [2023-08-26 18:09:07,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020576131687243 [2023-08-26 18:09:07,404 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 244 transitions. [2023-08-26 18:09:07,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 244 transitions. [2023-08-26 18:09:07,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:07,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 244 transitions. [2023-08-26 18:09:07,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 122.0) internal successors, (244), 2 states have internal predecessors, (244), 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 18:09:07,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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 18:09:07,411 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 243.0) internal successors, (729), 3 states have internal predecessors, (729), 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 18:09:07,413 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 244 transitions. [2023-08-26 18:09:07,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 101 flow [2023-08-26 18:09:07,415 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 18:09:07,416 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2023-08-26 18:09:07,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, 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 18:09:07,419 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2023-08-26 18:09:07,419 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2023-08-26 18:09:07,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 108.5) internal successors, (217), 2 states have internal predecessors, (217), 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 18:09:07,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:07,420 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 18:09:07,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 18:09:07,420 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 9 more)] === [2023-08-26 18:09:07,420 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:07,420 INFO L85 PathProgramCache]: Analyzing trace with hash 540422, now seen corresponding path program 1 times [2023-08-26 18:09:07,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269884338] [2023-08-26 18:09:07,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:07,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:07,579 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 18:09:07,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:07,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269884338] [2023-08-26 18:09:07,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269884338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:07,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:07,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:09:07,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948077964] [2023-08-26 18:09:07,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:07,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:09:07,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:07,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:09:07,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:09:07,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 243 [2023-08-26 18:09:07,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 18:09:07,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:07,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 243 [2023-08-26 18:09:07,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:07,760 INFO L124 PetriNetUnfolderBase]: 895/1451 cut-off events. [2023-08-26 18:09:07,761 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 18:09:07,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1451 events. 895/1451 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 8050 event pairs, 142 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 2829. Up to 1084 conditions per place. [2023-08-26 18:09:07,767 INFO L140 encePairwiseOnDemand]: 240/243 looper letters, 31 selfloop transitions, 2 changer transitions 2/39 dead transitions. [2023-08-26 18:09:07,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 39 transitions, 158 flow [2023-08-26 18:09:07,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:09:07,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:09:07,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-26 18:09:07,773 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897119341563786 [2023-08-26 18:09:07,773 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-26 18:09:07,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-26 18:09:07,774 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:07,774 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-26 18:09:07,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 18:09:07,777 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 18:09:07,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 18:09:07,778 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 357 transitions. [2023-08-26 18:09:07,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 39 transitions, 158 flow [2023-08-26 18:09:07,779 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 18:09:07,781 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2023-08-26 18:09:07,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, 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 18:09:07,782 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2023-08-26 18:09:07,783 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2023-08-26 18:09:07,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.0) internal successors, (324), 3 states have internal predecessors, (324), 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 18:09:07,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:07,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:09:07,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 18:09:07,787 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 18:09:07,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:07,790 INFO L85 PathProgramCache]: Analyzing trace with hash -530302818, now seen corresponding path program 1 times [2023-08-26 18:09:07,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:07,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722911384] [2023-08-26 18:09:07,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:07,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:07,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:08,046 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 18:09:08,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:08,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722911384] [2023-08-26 18:09:08,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722911384] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:08,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:08,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 18:09:08,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430981193] [2023-08-26 18:09:08,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:08,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 18:09:08,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:08,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 18:09:08,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 18:09:08,051 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 243 [2023-08-26 18:09:08,052 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 18:09:08,052 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:08,052 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 243 [2023-08-26 18:09:08,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:08,382 INFO L124 PetriNetUnfolderBase]: 2459/3678 cut-off events. [2023-08-26 18:09:08,382 INFO L125 PetriNetUnfolderBase]: For 155/155 co-relation queries the response was YES. [2023-08-26 18:09:08,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7619 conditions, 3678 events. 2459/3678 cut-off events. For 155/155 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 17957 event pairs, 815 based on Foata normal form. 112/3790 useless extension candidates. Maximal degree in co-relation 7615. Up to 2550 conditions per place. [2023-08-26 18:09:08,397 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 34 selfloop transitions, 7 changer transitions 0/41 dead transitions. [2023-08-26 18:09:08,397 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 41 transitions, 178 flow [2023-08-26 18:09:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 18:09:08,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 18:09:08,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-26 18:09:08,399 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2023-08-26 18:09:08,399 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-26 18:09:08,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-26 18:09:08,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:08,399 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-26 18:09:08,400 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 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 18:09:08,401 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 18:09:08,401 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 243.0) internal successors, (972), 4 states have internal predecessors, (972), 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 18:09:08,401 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 3 states and 333 transitions. [2023-08-26 18:09:08,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 41 transitions, 178 flow [2023-08-26 18:09:08,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 41 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:09:08,403 INFO L231 Difference]: Finished difference. Result has 35 places, 29 transitions, 106 flow [2023-08-26 18:09:08,403 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=35, PETRI_TRANSITIONS=29} [2023-08-26 18:09:08,403 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -6 predicate places. [2023-08-26 18:09:08,403 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 29 transitions, 106 flow [2023-08-26 18:09:08,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 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 18:09:08,404 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:08,404 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:09:08,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 18:09:08,404 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 18:09:08,404 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 740479054, now seen corresponding path program 1 times [2023-08-26 18:09:08,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:08,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658192918] [2023-08-26 18:09:08,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:08,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:08,499 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 18:09:08,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:08,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658192918] [2023-08-26 18:09:08,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658192918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:08,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:08,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:09:08,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429474290] [2023-08-26 18:09:08,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:08,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:09:08,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:08,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:09:08,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:09:08,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 243 [2023-08-26 18:09:08,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 29 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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 18:09:08,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:08,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 243 [2023-08-26 18:09:08,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:08,806 INFO L124 PetriNetUnfolderBase]: 2285/3424 cut-off events. [2023-08-26 18:09:08,807 INFO L125 PetriNetUnfolderBase]: For 1314/1314 co-relation queries the response was YES. [2023-08-26 18:09:08,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8558 conditions, 3424 events. 2285/3424 cut-off events. For 1314/1314 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 16648 event pairs, 468 based on Foata normal form. 50/3474 useless extension candidates. Maximal degree in co-relation 8553. Up to 1837 conditions per place. [2023-08-26 18:09:08,821 INFO L140 encePairwiseOnDemand]: 236/243 looper letters, 48 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2023-08-26 18:09:08,821 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 288 flow [2023-08-26 18:09:08,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:09:08,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:09:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-08-26 18:09:08,823 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45164609053497945 [2023-08-26 18:09:08,823 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-08-26 18:09:08,823 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-08-26 18:09:08,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:08,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-08-26 18:09:08,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 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 18:09:08,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 18:09:08,826 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 18:09:08,826 INFO L175 Difference]: Start difference. First operand has 35 places, 29 transitions, 106 flow. Second operand 4 states and 439 transitions. [2023-08-26 18:09:08,826 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 288 flow [2023-08-26 18:09:08,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 55 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 18:09:08,833 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 140 flow [2023-08-26 18:09:08,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-26 18:09:08,835 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-26 18:09:08,835 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 140 flow [2023-08-26 18:09:08,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 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 18:09:08,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:08,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:09:08,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 18:09:08,835 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 18:09:08,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:08,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1748302565, now seen corresponding path program 1 times [2023-08-26 18:09:08,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:08,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768069864] [2023-08-26 18:09:08,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:08,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:08,951 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 18:09:08,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:08,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768069864] [2023-08-26 18:09:08,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768069864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:08,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:08,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 18:09:08,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154231421] [2023-08-26 18:09:08,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:08,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:09:08,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:08,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:09:08,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:09:08,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 243 [2023-08-26 18:09:08,953 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 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 18:09:08,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:08,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 243 [2023-08-26 18:09:08,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:09,209 INFO L124 PetriNetUnfolderBase]: 2149/3224 cut-off events. [2023-08-26 18:09:09,209 INFO L125 PetriNetUnfolderBase]: For 2504/2504 co-relation queries the response was YES. [2023-08-26 18:09:09,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8555 conditions, 3224 events. 2149/3224 cut-off events. For 2504/2504 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 14769 event pairs, 634 based on Foata normal form. 40/3264 useless extension candidates. Maximal degree in co-relation 8548. Up to 1596 conditions per place. [2023-08-26 18:09:09,225 INFO L140 encePairwiseOnDemand]: 235/243 looper letters, 43 selfloop transitions, 11 changer transitions 0/54 dead transitions. [2023-08-26 18:09:09,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 54 transitions, 324 flow [2023-08-26 18:09:09,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 18:09:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 18:09:09,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 435 transitions. [2023-08-26 18:09:09,226 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44753086419753085 [2023-08-26 18:09:09,226 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 435 transitions. [2023-08-26 18:09:09,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 435 transitions. [2023-08-26 18:09:09,227 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:09,227 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 435 transitions. [2023-08-26 18:09:09,228 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 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 18:09:09,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 18:09:09,229 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 243.0) internal successors, (1215), 5 states have internal predecessors, (1215), 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 18:09:09,229 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 140 flow. Second operand 4 states and 435 transitions. [2023-08-26 18:09:09,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 54 transitions, 324 flow [2023-08-26 18:09:09,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 319 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:09:09,239 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 226 flow [2023-08-26 18:09:09,240 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-08-26 18:09:09,240 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2023-08-26 18:09:09,240 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 226 flow [2023-08-26 18:09:09,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 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 18:09:09,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:09,241 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:09:09,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 18:09:09,241 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 18:09:09,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:09,241 INFO L85 PathProgramCache]: Analyzing trace with hash 601582767, now seen corresponding path program 1 times [2023-08-26 18:09:09,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:09,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185568200] [2023-08-26 18:09:09,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:09,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:09,338 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 18:09:09,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:09,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185568200] [2023-08-26 18:09:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185568200] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:09,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:09,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 18:09:09,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418287330] [2023-08-26 18:09:09,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:09,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 18:09:09,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:09,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 18:09:09,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 18:09:09,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 243 [2023-08-26 18:09:09,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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 18:09:09,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:09,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 243 [2023-08-26 18:09:09,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:09,556 INFO L124 PetriNetUnfolderBase]: 1148/1992 cut-off events. [2023-08-26 18:09:09,556 INFO L125 PetriNetUnfolderBase]: For 1581/1633 co-relation queries the response was YES. [2023-08-26 18:09:09,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5072 conditions, 1992 events. 1148/1992 cut-off events. For 1581/1633 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 11413 event pairs, 217 based on Foata normal form. 226/2167 useless extension candidates. Maximal degree in co-relation 5062. Up to 1060 conditions per place. [2023-08-26 18:09:09,565 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 55 selfloop transitions, 8 changer transitions 7/84 dead transitions. [2023-08-26 18:09:09,565 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 84 transitions, 560 flow [2023-08-26 18:09:09,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 18:09:09,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 18:09:09,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2023-08-26 18:09:09,567 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4534979423868313 [2023-08-26 18:09:09,567 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2023-08-26 18:09:09,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2023-08-26 18:09:09,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:09,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2023-08-26 18:09:09,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 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 18:09:09,569 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 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 18:09:09,570 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 243.0) internal successors, (1458), 6 states have internal predecessors, (1458), 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 18:09:09,570 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 226 flow. Second operand 5 states and 551 transitions. [2023-08-26 18:09:09,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 84 transitions, 560 flow [2023-08-26 18:09:09,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 84 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:09:09,574 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 282 flow [2023-08-26 18:09:09,574 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-26 18:09:09,575 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2023-08-26 18:09:09,575 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 282 flow [2023-08-26 18:09:09,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.75) internal successors, (407), 4 states have internal predecessors, (407), 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 18:09:09,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:09,575 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:09:09,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 18:09:09,576 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 18:09:09,576 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:09,576 INFO L85 PathProgramCache]: Analyzing trace with hash 845298342, now seen corresponding path program 1 times [2023-08-26 18:09:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:09,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914644204] [2023-08-26 18:09:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:09,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:09,675 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 18:09:09,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:09,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914644204] [2023-08-26 18:09:09,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914644204] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:09,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:09,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:09:09,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081782391] [2023-08-26 18:09:09,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:09,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:09:09,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:09,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:09:09,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:09:09,677 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 243 [2023-08-26 18:09:09,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 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 18:09:09,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:09,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 243 [2023-08-26 18:09:09,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:09,920 INFO L124 PetriNetUnfolderBase]: 911/1637 cut-off events. [2023-08-26 18:09:09,921 INFO L125 PetriNetUnfolderBase]: For 1923/1960 co-relation queries the response was YES. [2023-08-26 18:09:09,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5298 conditions, 1637 events. 911/1637 cut-off events. For 1923/1960 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 9452 event pairs, 138 based on Foata normal form. 128/1717 useless extension candidates. Maximal degree in co-relation 5284. Up to 516 conditions per place. [2023-08-26 18:09:09,927 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 70 selfloop transitions, 15 changer transitions 12/111 dead transitions. [2023-08-26 18:09:09,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 111 transitions, 790 flow [2023-08-26 18:09:09,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:09:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:09:09,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 772 transitions. [2023-08-26 18:09:09,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4538506760728983 [2023-08-26 18:09:09,930 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 772 transitions. [2023-08-26 18:09:09,930 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 772 transitions. [2023-08-26 18:09:09,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:09,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 772 transitions. [2023-08-26 18:09:09,931 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 18:09:09,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 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 18:09:09,933 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 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 18:09:09,933 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 282 flow. Second operand 7 states and 772 transitions. [2023-08-26 18:09:09,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 111 transitions, 790 flow [2023-08-26 18:09:09,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 111 transitions, 786 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 18:09:09,939 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 377 flow [2023-08-26 18:09:09,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=377, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2023-08-26 18:09:09,939 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 17 predicate places. [2023-08-26 18:09:09,939 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 377 flow [2023-08-26 18:09:09,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 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 18:09:09,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:09,940 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 18:09:09,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 18:09:09,940 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 18:09:09,940 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:09,940 INFO L85 PathProgramCache]: Analyzing trace with hash -619851594, now seen corresponding path program 1 times [2023-08-26 18:09:09,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:09,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802168729] [2023-08-26 18:09:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:09,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:10,076 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 18:09:10,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:10,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802168729] [2023-08-26 18:09:10,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802168729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:10,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:10,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 18:09:10,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211062234] [2023-08-26 18:09:10,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:10,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 18:09:10,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:10,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 18:09:10,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 18:09:10,078 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 243 [2023-08-26 18:09:10,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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 18:09:10,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:10,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 243 [2023-08-26 18:09:10,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:10,473 INFO L124 PetriNetUnfolderBase]: 1829/3047 cut-off events. [2023-08-26 18:09:10,473 INFO L125 PetriNetUnfolderBase]: For 9852/9852 co-relation queries the response was YES. [2023-08-26 18:09:10,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12405 conditions, 3047 events. 1829/3047 cut-off events. For 9852/9852 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 17017 event pairs, 141 based on Foata normal form. 10/3057 useless extension candidates. Maximal degree in co-relation 12388. Up to 1131 conditions per place. [2023-08-26 18:09:10,483 INFO L140 encePairwiseOnDemand]: 234/243 looper letters, 64 selfloop transitions, 21 changer transitions 59/144 dead transitions. [2023-08-26 18:09:10,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 144 transitions, 1341 flow [2023-08-26 18:09:10,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 18:09:10,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 18:09:10,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions. [2023-08-26 18:09:10,486 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44238683127572015 [2023-08-26 18:09:10,486 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 645 transitions. [2023-08-26 18:09:10,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions. [2023-08-26 18:09:10,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:10,486 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions. [2023-08-26 18:09:10,487 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 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 18:09:10,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 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 18:09:10,489 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 243.0) internal successors, (1701), 7 states have internal predecessors, (1701), 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 18:09:10,489 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 377 flow. Second operand 6 states and 645 transitions. [2023-08-26 18:09:10,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 144 transitions, 1341 flow [2023-08-26 18:09:10,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 144 transitions, 1190 flow, removed 57 selfloop flow, removed 2 redundant places. [2023-08-26 18:09:10,527 INFO L231 Difference]: Finished difference. Result has 63 places, 48 transitions, 376 flow [2023-08-26 18:09:10,527 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=376, PETRI_PLACES=63, PETRI_TRANSITIONS=48} [2023-08-26 18:09:10,528 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-26 18:09:10,528 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 48 transitions, 376 flow [2023-08-26 18:09:10,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.8) internal successors, (494), 5 states have internal predecessors, (494), 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 18:09:10,528 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:10,528 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 18:09:10,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 18:09:10,529 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 18:09:10,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:10,529 INFO L85 PathProgramCache]: Analyzing trace with hash -77748554, now seen corresponding path program 2 times [2023-08-26 18:09:10,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:10,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046900734] [2023-08-26 18:09:10,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:10,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:10,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:10,691 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 18:09:10,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:10,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046900734] [2023-08-26 18:09:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046900734] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:10,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:09:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311718628] [2023-08-26 18:09:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:10,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 18:09:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:10,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 18:09:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 18:09:10,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 243 [2023-08-26 18:09:10,696 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 48 transitions, 376 flow. Second operand has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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 18:09:10,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:10,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 243 [2023-08-26 18:09:10,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:10,865 INFO L124 PetriNetUnfolderBase]: 454/902 cut-off events. [2023-08-26 18:09:10,865 INFO L125 PetriNetUnfolderBase]: For 1712/1734 co-relation queries the response was YES. [2023-08-26 18:09:10,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3107 conditions, 902 events. 454/902 cut-off events. For 1712/1734 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4866 event pairs, 137 based on Foata normal form. 39/920 useless extension candidates. Maximal degree in co-relation 3087. Up to 318 conditions per place. [2023-08-26 18:09:10,870 INFO L140 encePairwiseOnDemand]: 237/243 looper letters, 40 selfloop transitions, 11 changer transitions 29/91 dead transitions. [2023-08-26 18:09:10,870 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 91 transitions, 755 flow [2023-08-26 18:09:10,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 18:09:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 18:09:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 751 transitions. [2023-08-26 18:09:10,872 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44150499706055263 [2023-08-26 18:09:10,872 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 751 transitions. [2023-08-26 18:09:10,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 751 transitions. [2023-08-26 18:09:10,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:10,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 751 transitions. [2023-08-26 18:09:10,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 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 18:09:10,876 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 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 18:09:10,877 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 243.0) internal successors, (1944), 8 states have internal predecessors, (1944), 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 18:09:10,878 INFO L175 Difference]: Start difference. First operand has 63 places, 48 transitions, 376 flow. Second operand 7 states and 751 transitions. [2023-08-26 18:09:10,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 91 transitions, 755 flow [2023-08-26 18:09:10,882 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 716 flow, removed 15 selfloop flow, removed 5 redundant places. [2023-08-26 18:09:10,884 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 283 flow [2023-08-26 18:09:10,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=283, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2023-08-26 18:09:10,885 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 22 predicate places. [2023-08-26 18:09:10,885 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 283 flow [2023-08-26 18:09:10,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 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 18:09:10,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:10,886 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 18:09:10,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 18:09:10,886 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 18:09:10,886 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:10,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1084472111, now seen corresponding path program 1 times [2023-08-26 18:09:10,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651587036] [2023-08-26 18:09:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:10,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 18:09:11,688 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 18:09:11,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 18:09:11,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651587036] [2023-08-26 18:09:11,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651587036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 18:09:11,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 18:09:11,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 18:09:11,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313098172] [2023-08-26 18:09:11,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 18:09:11,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 18:09:11,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 18:09:11,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 18:09:11,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-26 18:09:11,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 243 [2023-08-26 18:09:11,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 283 flow. Second operand has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 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 18:09:11,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 18:09:11,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 243 [2023-08-26 18:09:11,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 18:09:12,018 INFO L124 PetriNetUnfolderBase]: 585/1117 cut-off events. [2023-08-26 18:09:12,018 INFO L125 PetriNetUnfolderBase]: For 3281/3281 co-relation queries the response was YES. [2023-08-26 18:09:12,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4485 conditions, 1117 events. 585/1117 cut-off events. For 3281/3281 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5752 event pairs, 72 based on Foata normal form. 1/1118 useless extension candidates. Maximal degree in co-relation 4466. Up to 265 conditions per place. [2023-08-26 18:09:12,023 INFO L140 encePairwiseOnDemand]: 232/243 looper letters, 73 selfloop transitions, 21 changer transitions 57/151 dead transitions. [2023-08-26 18:09:12,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 151 transitions, 1315 flow [2023-08-26 18:09:12,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 18:09:12,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 18:09:12,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 913 transitions. [2023-08-26 18:09:12,026 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.417466849565615 [2023-08-26 18:09:12,026 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 913 transitions. [2023-08-26 18:09:12,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 913 transitions. [2023-08-26 18:09:12,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 18:09:12,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 913 transitions. [2023-08-26 18:09:12,027 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.44444444444444) internal successors, (913), 9 states have internal predecessors, (913), 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 18:09:12,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 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 18:09:12,030 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 243.0) internal successors, (2430), 10 states have internal predecessors, (2430), 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 18:09:12,030 INFO L175 Difference]: Start difference. First operand has 63 places, 39 transitions, 283 flow. Second operand 9 states and 913 transitions. [2023-08-26 18:09:12,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 151 transitions, 1315 flow [2023-08-26 18:09:12,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 151 transitions, 1113 flow, removed 48 selfloop flow, removed 9 redundant places. [2023-08-26 18:09:12,039 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 384 flow [2023-08-26 18:09:12,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=243, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=384, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-08-26 18:09:12,040 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-26 18:09:12,040 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 384 flow [2023-08-26 18:09:12,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.28571428571429) internal successors, (646), 7 states have internal predecessors, (646), 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 18:09:12,041 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 18:09:12,041 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 18:09:12,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 18:09:12,041 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 18:09:12,041 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 18:09:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash 378507233, now seen corresponding path program 2 times [2023-08-26 18:09:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 18:09:12,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162154683] [2023-08-26 18:09:12,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 18:09:12,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 18:09:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:09:12,074 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 18:09:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 18:09:12,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 18:09:12,119 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 18:09:12,120 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONASSERT (11 of 12 remaining) [2023-08-26 18:09:12,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (10 of 12 remaining) [2023-08-26 18:09:12,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 12 remaining) [2023-08-26 18:09:12,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 12 remaining) [2023-08-26 18:09:12,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 12 remaining) [2023-08-26 18:09:12,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 12 remaining) [2023-08-26 18:09:12,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 12 remaining) [2023-08-26 18:09:12,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 12 remaining) [2023-08-26 18:09:12,121 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 12 remaining) [2023-08-26 18:09:12,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 12 remaining) [2023-08-26 18:09:12,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 12 remaining) [2023-08-26 18:09:12,122 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 12 remaining) [2023-08-26 18:09:12,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 18:09:12,122 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 18:09:12,126 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 18:09:12,126 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 18:09:12,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 06:09:12 BasicIcfg [2023-08-26 18:09:12,166 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 18:09:12,166 INFO L158 Benchmark]: Toolchain (without parser) took 9605.67ms. Allocated memory was 346.0MB in the beginning and 648.0MB in the end (delta: 302.0MB). Free memory was 320.5MB in the beginning and 340.9MB in the end (delta: -20.4MB). Peak memory consumption was 284.0MB. Max. memory is 16.0GB. [2023-08-26 18:09:12,166 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 346.0MB. Free memory is still 322.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 18:09:12,166 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.15ms. Allocated memory is still 346.0MB. Free memory was 320.0MB in the beginning and 296.8MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 18:09:12,167 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.87ms. Allocated memory is still 346.0MB. Free memory was 296.8MB in the beginning and 294.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 18:09:12,167 INFO L158 Benchmark]: Boogie Preprocessor took 37.45ms. Allocated memory is still 346.0MB. Free memory was 294.1MB in the beginning and 292.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 18:09:12,167 INFO L158 Benchmark]: RCFGBuilder took 591.07ms. Allocated memory is still 346.0MB. Free memory was 292.0MB in the beginning and 312.5MB in the end (delta: -20.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. [2023-08-26 18:09:12,167 INFO L158 Benchmark]: TraceAbstraction took 8438.18ms. Allocated memory was 346.0MB in the beginning and 648.0MB in the end (delta: 302.0MB). Free memory was 311.4MB in the beginning and 340.9MB in the end (delta: -29.5MB). Peak memory consumption was 273.5MB. Max. memory is 16.0GB. [2023-08-26 18:09:12,168 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.15ms. Allocated memory is still 346.0MB. Free memory is still 322.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 470.15ms. Allocated memory is still 346.0MB. Free memory was 320.0MB in the beginning and 296.8MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.87ms. Allocated memory is still 346.0MB. Free memory was 296.8MB in the beginning and 294.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.45ms. Allocated memory is still 346.0MB. Free memory was 294.1MB in the beginning and 292.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 591.07ms. Allocated memory is still 346.0MB. Free memory was 292.0MB in the beginning and 312.5MB in the end (delta: -20.4MB). Peak memory consumption was 33.6MB. Max. memory is 16.0GB. * TraceAbstraction took 8438.18ms. Allocated memory was 346.0MB in the beginning and 648.0MB in the end (delta: 302.0MB). Free memory was 311.4MB in the beginning and 340.9MB in the end (delta: -29.5MB). Peak memory consumption was 273.5MB. 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, 126 PlacesBefore, 41 PlacesAfterwards, 119 TransitionsBefore, 32 TransitionsAfterwards, 2400 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 121 TotalNumberOfCompositions, 7188 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2938, independent: 2725, independent conditional: 0, independent unconditional: 2725, dependent: 213, dependent conditional: 0, dependent unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1382, independent: 1339, independent conditional: 0, independent unconditional: 1339, dependent: 43, dependent conditional: 0, dependent unconditional: 43, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2938, independent: 1386, independent conditional: 0, independent unconditional: 1386, dependent: 170, dependent conditional: 0, dependent unconditional: 170, unknown: 1382, unknown conditional: 0, unknown unconditional: 1382] , Statistics on independence cache: Total cache size (in pairs): 115, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, 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_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t153; [L844] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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(&t153, ((void *)0), P0, ((void *)0))=-2, t153={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] [L845] 0 pthread_t t154; [L846] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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(&t154, ((void *)0), P1, ((void *)0))=-1, t153={5:0}, t154={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t155; [L848] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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(&t155, ((void *)0), P2, ((void *)0))=0, t153={5:0}, t154={6:0}, t155={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=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] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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] [L759] 1 x = 1 VAL [__unbuffered_cnt=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=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] [L776] 2 x = 2 VAL [__unbuffered_cnt=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=2, 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] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, 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] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, 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] [L799] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, 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] [L802] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=2, 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] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] 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) [L810] 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)) [L811] 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)) [L812] 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)) [L813] 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)) [L814] 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)) [L815] 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)) [L816] 3 __unbuffered_p2_EBX = z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=1, x=2, 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] [L821] 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) [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] 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 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=1, x=2, 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] [L762] 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) [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] 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 [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __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=1, x=2, 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] [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L785] 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) [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] 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 [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] 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=1, __unbuffered_p1_EAX=2, __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=1, x=2, 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] [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 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) [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] 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 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] 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_p1_EAX=2, __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, t153={5:0}, t154={6:0}, t155={3:0}, weak$$choice2=1, x=2, 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] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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", "mix006_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __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=1, x=2, 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: 844]: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 150 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: 8.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 859 IncrementalHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 35 mSDtfsCounter, 859 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=384occurred in iteration=10, InterpolantAutomatonStates: 50, 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.7s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 945 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 18:09:12,183 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...