/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 INSUFFICIENT_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/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 15:22:41,708 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 15:22:41,772 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 15:22:41,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 15:22:41,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 15:22:41,802 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 15:22:41,803 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 15:22:41,803 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 15:22:41,804 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 15:22:41,808 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 15:22:41,808 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 15:22:41,808 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 15:22:41,808 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 15:22:41,809 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 15:22:41,809 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 15:22:41,809 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 15:22:41,810 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 15:22:41,810 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 15:22:41,810 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 15:22:41,810 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 15:22:41,810 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 15:22:41,811 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 15:22:41,811 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 15:22:41,812 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 15:22:41,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 15:22:41,812 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 15:22:41,812 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 15:22:41,812 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:22:41,812 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 15:22:41,812 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 15:22:41,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 15:22:41,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 15:22:41,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 15:22:41,814 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 15:22:41,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 15:22:41,814 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 -> INSUFFICIENT_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 15:22:42,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 15:22:42,071 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 15:22:42,073 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 15:22:42,074 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 15:22:42,075 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 15:22:42,076 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 15:22:43,057 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 15:22:43,301 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 15:22:43,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 15:22:43,322 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311bd704d/7cf699b949cd4016a661634d11083c34/FLAG794b131bb [2023-08-26 15:22:43,337 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/311bd704d/7cf699b949cd4016a661634d11083c34 [2023-08-26 15:22:43,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 15:22:43,342 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 15:22:43,343 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 15:22:43,343 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 15:22:43,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 15:22:43,346 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,347 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a15940c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43, skipping insertion in model container [2023-08-26 15:22:43,347 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,391 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 15:22:43,675 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:22:43,682 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 15:22:43,695 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:22:43,696 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 15:22:43,713 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 15:22:43,739 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:22:43,739 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 15:22:43,744 INFO L206 MainTranslator]: Completed translation [2023-08-26 15:22:43,744 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43 WrapperNode [2023-08-26 15:22:43,744 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 15:22:43,745 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 15:22:43,745 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 15:22:43,745 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 15:22:43,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,776 INFO L138 Inliner]: procedures = 175, calls = 42, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 119 [2023-08-26 15:22:43,776 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 15:22:43,777 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 15:22:43,777 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 15:22:43,777 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 15:22:43,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,787 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,789 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,789 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,797 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,798 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,812 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,813 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,815 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 15:22:43,816 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 15:22:43,816 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 15:22:43,816 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 15:22:43,816 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (1/1) ... [2023-08-26 15:22:43,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 15:22:43,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 15:22:43,847 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 15:22:43,859 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 15:22:43,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 15:22:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 15:22:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 15:22:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 15:22:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 15:22:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 15:22:43,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 15:22:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 15:22:43,871 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 15:22:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 15:22:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 15:22:43,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 15:22:43,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 15:22:43,872 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 15:22:43,954 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 15:22:43,956 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 15:22:44,177 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 15:22:44,306 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 15:22:44,306 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 15:22:44,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:22:44 BoogieIcfgContainer [2023-08-26 15:22:44,308 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 15:22:44,310 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 15:22:44,310 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 15:22:44,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 15:22:44,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 03:22:43" (1/3) ... [2023-08-26 15:22:44,312 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd2e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:22:44, skipping insertion in model container [2023-08-26 15:22:44,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 03:22:43" (2/3) ... [2023-08-26 15:22:44,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd2e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 03:22:44, skipping insertion in model container [2023-08-26 15:22:44,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 03:22:44" (3/3) ... [2023-08-26 15:22:44,314 INFO L112 eAbstractionObserver]: Analyzing ICFG safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2023-08-26 15:22:44,325 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 15:22:44,325 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-26 15:22:44,325 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 15:22:44,365 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 15:22:44,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 96 transitions, 202 flow [2023-08-26 15:22:44,433 INFO L124 PetriNetUnfolderBase]: 3/94 cut-off events. [2023-08-26 15:22:44,435 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:22:44,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 3/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-26 15:22:44,439 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 96 transitions, 202 flow [2023-08-26 15:22:44,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 94 transitions, 194 flow [2023-08-26 15:22:44,444 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 15:22:44,452 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 94 transitions, 194 flow [2023-08-26 15:22:44,454 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 94 transitions, 194 flow [2023-08-26 15:22:44,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 94 transitions, 194 flow [2023-08-26 15:22:44,480 INFO L124 PetriNetUnfolderBase]: 3/94 cut-off events. [2023-08-26 15:22:44,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:22:44,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 94 events. 3/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-26 15:22:44,482 INFO L119 LiptonReduction]: Number of co-enabled transitions 1186 [2023-08-26 15:22:46,983 INFO L134 LiptonReduction]: Checked pairs total: 3046 [2023-08-26 15:22:46,983 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-26 15:22:46,998 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 15:22:47,004 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;@628e6e68, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 15:22:47,004 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-08-26 15:22:47,005 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 15:22:47,005 INFO L124 PetriNetUnfolderBase]: 0/1 cut-off events. [2023-08-26 15:22:47,006 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:22:47,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:22:47,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-26 15:22:47,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:22:47,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:22:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash 458, now seen corresponding path program 1 times [2023-08-26 15:22:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:22:47,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700614156] [2023-08-26 15:22:47,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:22:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:22:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:22:47,096 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 15:22:47,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:22:47,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700614156] [2023-08-26 15:22:47,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700614156] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:22:47,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:22:47,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-26 15:22:47,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763435604] [2023-08-26 15:22:47,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:22:47,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-26 15:22:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:22:47,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-26 15:22:47,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-26 15:22:47,125 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 195 [2023-08-26 15:22:47,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 54 flow. Second operand has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:22:47,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:22:47,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 195 [2023-08-26 15:22:47,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:22:47,251 INFO L124 PetriNetUnfolderBase]: 264/452 cut-off events. [2023-08-26 15:22:47,251 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-26 15:22:47,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 452 events. 264/452 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1779 event pairs, 264 based on Foata normal form. 25/389 useless extension candidates. Maximal degree in co-relation 908. Up to 451 conditions per place. [2023-08-26 15:22:47,257 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 18 selfloop transitions, 0 changer transitions 0/19 dead transitions. [2023-08-26 15:22:47,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 19 transitions, 80 flow [2023-08-26 15:22:47,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-26 15:22:47,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-26 15:22:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 191 transitions. [2023-08-26 15:22:47,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4897435897435897 [2023-08-26 15:22:47,270 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 191 transitions. [2023-08-26 15:22:47,270 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 191 transitions. [2023-08-26 15:22:47,271 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:22:47,273 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 191 transitions. [2023-08-26 15:22:47,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 95.5) internal successors, (191), 2 states have internal predecessors, (191), 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 15:22:47,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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 15:22:47,278 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 195.0) internal successors, (585), 3 states have internal predecessors, (585), 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 15:22:47,279 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 54 flow. Second operand 2 states and 191 transitions. [2023-08-26 15:22:47,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 19 transitions, 80 flow [2023-08-26 15:22:47,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 19 transitions, 78 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:22:47,282 INFO L231 Difference]: Finished difference. Result has 25 places, 19 transitions, 42 flow [2023-08-26 15:22:47,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=42, PETRI_PLACES=25, PETRI_TRANSITIONS=19} [2023-08-26 15:22:47,286 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -5 predicate places. [2023-08-26 15:22:47,286 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 19 transitions, 42 flow [2023-08-26 15:22:47,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 84.5) internal successors, (169), 2 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:22:47,287 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:22:47,287 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-26 15:22:47,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 15:22:47,287 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:22:47,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:22:47,288 INFO L85 PathProgramCache]: Analyzing trace with hash 449746, now seen corresponding path program 1 times [2023-08-26 15:22:47,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:22:47,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288511388] [2023-08-26 15:22:47,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:22:47,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:22:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:22:47,504 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 15:22:47,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:22:47,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288511388] [2023-08-26 15:22:47,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288511388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:22:47,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:22:47,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 15:22:47,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948760705] [2023-08-26 15:22:47,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:22:47,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:22:47,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:22:47,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:22:47,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:22:47,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 195 [2023-08-26 15:22:47,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 19 transitions, 42 flow. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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 15:22:47,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:22:47,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 195 [2023-08-26 15:22:47,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:22:47,567 INFO L124 PetriNetUnfolderBase]: 204/390 cut-off events. [2023-08-26 15:22:47,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 15:22:47,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 390 events. 204/390 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1728 event pairs, 24 based on Foata normal form. 0/350 useless extension candidates. Maximal degree in co-relation 753. Up to 292 conditions per place. [2023-08-26 15:22:47,569 INFO L140 encePairwiseOnDemand]: 192/195 looper letters, 23 selfloop transitions, 2 changer transitions 4/30 dead transitions. [2023-08-26 15:22:47,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 30 transitions, 124 flow [2023-08-26 15:22:47,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:22:47,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:22:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-08-26 15:22:47,586 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2023-08-26 15:22:47,586 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-08-26 15:22:47,586 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-08-26 15:22:47,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:22:47,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-08-26 15:22:47,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 15:22:47,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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 15:22:47,592 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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 15:22:47,592 INFO L175 Difference]: Start difference. First operand has 25 places, 19 transitions, 42 flow. Second operand 3 states and 279 transitions. [2023-08-26 15:22:47,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 30 transitions, 124 flow [2023-08-26 15:22:47,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 124 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 15:22:47,593 INFO L231 Difference]: Finished difference. Result has 26 places, 16 transitions, 40 flow [2023-08-26 15:22:47,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=26, PETRI_TRANSITIONS=16} [2023-08-26 15:22:47,596 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -4 predicate places. [2023-08-26 15:22:47,596 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 16 transitions, 40 flow [2023-08-26 15:22:47,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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 15:22:47,597 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:22:47,597 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:22:47,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 15:22:47,598 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:22:47,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:22:47,602 INFO L85 PathProgramCache]: Analyzing trace with hash 879208606, now seen corresponding path program 1 times [2023-08-26 15:22:47,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:22:47,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973943395] [2023-08-26 15:22:47,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:22:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:22:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:22:47,817 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 15:22:47,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:22:47,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973943395] [2023-08-26 15:22:47,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973943395] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:22:47,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:22:47,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:22:47,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497785270] [2023-08-26 15:22:47,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:22:47,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:22:47,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:22:47,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:22:47,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:22:47,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 195 [2023-08-26 15:22:47,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 16 transitions, 40 flow. Second operand has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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 15:22:47,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:22:47,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 195 [2023-08-26 15:22:47,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:22:47,902 INFO L124 PetriNetUnfolderBase]: 143/266 cut-off events. [2023-08-26 15:22:47,902 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2023-08-26 15:22:47,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 575 conditions, 266 events. 143/266 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1025 event pairs, 36 based on Foata normal form. 20/285 useless extension candidates. Maximal degree in co-relation 571. Up to 197 conditions per place. [2023-08-26 15:22:47,905 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 18 selfloop transitions, 2 changer transitions 11/32 dead transitions. [2023-08-26 15:22:47,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 32 transitions, 140 flow [2023-08-26 15:22:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 15:22:47,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 15:22:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 423 transitions. [2023-08-26 15:22:47,907 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4338461538461538 [2023-08-26 15:22:47,907 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 423 transitions. [2023-08-26 15:22:47,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 423 transitions. [2023-08-26 15:22:47,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:22:47,907 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 423 transitions. [2023-08-26 15:22:47,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 84.6) internal successors, (423), 5 states have internal predecessors, (423), 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 15:22:47,910 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 15:22:47,910 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 195.0) internal successors, (1170), 6 states have internal predecessors, (1170), 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 15:22:47,910 INFO L175 Difference]: Start difference. First operand has 26 places, 16 transitions, 40 flow. Second operand 5 states and 423 transitions. [2023-08-26 15:22:47,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 32 transitions, 140 flow [2023-08-26 15:22:47,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 15:22:47,911 INFO L231 Difference]: Finished difference. Result has 29 places, 16 transitions, 48 flow [2023-08-26 15:22:47,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=48, PETRI_PLACES=29, PETRI_TRANSITIONS=16} [2023-08-26 15:22:47,912 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-26 15:22:47,913 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 16 transitions, 48 flow [2023-08-26 15:22:47,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.0) internal successors, (320), 4 states have internal predecessors, (320), 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 15:22:47,913 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:22:47,913 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:22:47,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 15:22:47,916 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:22:47,917 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:22:47,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1485631321, now seen corresponding path program 1 times [2023-08-26 15:22:47,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:22:47,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338821430] [2023-08-26 15:22:47,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:22:47,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:22:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:22:48,098 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 15:22:48,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:22:48,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338821430] [2023-08-26 15:22:48,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338821430] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:22:48,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:22:48,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:22:48,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030929165] [2023-08-26 15:22:48,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:22:48,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:22:48,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:22:48,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:22:48,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:22:48,101 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 195 [2023-08-26 15:22:48,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 16 transitions, 48 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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 15:22:48,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:22:48,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 195 [2023-08-26 15:22:48,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:22:48,234 INFO L124 PetriNetUnfolderBase]: 186/337 cut-off events. [2023-08-26 15:22:48,234 INFO L125 PetriNetUnfolderBase]: For 99/99 co-relation queries the response was YES. [2023-08-26 15:22:48,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 783 conditions, 337 events. 186/337 cut-off events. For 99/99 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1228 event pairs, 31 based on Foata normal form. 20/357 useless extension candidates. Maximal degree in co-relation 776. Up to 167 conditions per place. [2023-08-26 15:22:48,236 INFO L140 encePairwiseOnDemand]: 189/195 looper letters, 29 selfloop transitions, 6 changer transitions 16/51 dead transitions. [2023-08-26 15:22:48,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 51 transitions, 235 flow [2023-08-26 15:22:48,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:22:48,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:22:48,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 739 transitions. [2023-08-26 15:22:48,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42108262108262107 [2023-08-26 15:22:48,238 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 739 transitions. [2023-08-26 15:22:48,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 739 transitions. [2023-08-26 15:22:48,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:22:48,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 739 transitions. [2023-08-26 15:22:48,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 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 15:22:48,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 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 15:22:48,242 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 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 15:22:48,242 INFO L175 Difference]: Start difference. First operand has 29 places, 16 transitions, 48 flow. Second operand 9 states and 739 transitions. [2023-08-26 15:22:48,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 51 transitions, 235 flow [2023-08-26 15:22:48,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 51 transitions, 221 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 15:22:48,246 INFO L231 Difference]: Finished difference. Result has 37 places, 20 transitions, 83 flow [2023-08-26 15:22:48,246 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=83, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2023-08-26 15:22:48,248 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 7 predicate places. [2023-08-26 15:22:48,248 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 83 flow [2023-08-26 15:22:48,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 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 15:22:48,248 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:22:48,248 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:22:48,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 15:22:48,248 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:22:48,249 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:22:48,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1645376382, now seen corresponding path program 1 times [2023-08-26 15:22:48,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:22:48,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047916104] [2023-08-26 15:22:48,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:22:48,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:22:48,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:22:48,386 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 15:22:48,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:22:48,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047916104] [2023-08-26 15:22:48,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047916104] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:22:48,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:22:48,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:22:48,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968807774] [2023-08-26 15:22:48,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:22:48,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 15:22:48,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:22:48,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 15:22:48,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 15:22:48,388 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 195 [2023-08-26 15:22:48,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 20 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 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 15:22:48,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:22:48,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 195 [2023-08-26 15:22:48,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:22:48,490 INFO L124 PetriNetUnfolderBase]: 199/360 cut-off events. [2023-08-26 15:22:48,490 INFO L125 PetriNetUnfolderBase]: For 360/360 co-relation queries the response was YES. [2023-08-26 15:22:48,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 360 events. 199/360 cut-off events. For 360/360 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1332 event pairs, 68 based on Foata normal form. 15/375 useless extension candidates. Maximal degree in co-relation 974. Up to 143 conditions per place. [2023-08-26 15:22:48,491 INFO L140 encePairwiseOnDemand]: 190/195 looper letters, 21 selfloop transitions, 3 changer transitions 18/42 dead transitions. [2023-08-26 15:22:48,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 227 flow [2023-08-26 15:22:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 15:22:48,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 15:22:48,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2023-08-26 15:22:48,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43162393162393164 [2023-08-26 15:22:48,493 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 505 transitions. [2023-08-26 15:22:48,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 505 transitions. [2023-08-26 15:22:48,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:22:48,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 505 transitions. [2023-08-26 15:22:48,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 84.16666666666667) internal successors, (505), 6 states have internal predecessors, (505), 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 15:22:48,495 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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 15:22:48,496 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 195.0) internal successors, (1365), 7 states have internal predecessors, (1365), 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 15:22:48,496 INFO L175 Difference]: Start difference. First operand has 37 places, 20 transitions, 83 flow. Second operand 6 states and 505 transitions. [2023-08-26 15:22:48,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 227 flow [2023-08-26 15:22:48,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 42 transitions, 219 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-26 15:22:48,498 INFO L231 Difference]: Finished difference. Result has 38 places, 16 transitions, 74 flow [2023-08-26 15:22:48,498 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=74, PETRI_PLACES=38, PETRI_TRANSITIONS=16} [2023-08-26 15:22:48,499 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-26 15:22:48,499 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 16 transitions, 74 flow [2023-08-26 15:22:48,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.0) internal successors, (395), 5 states have internal predecessors, (395), 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 15:22:48,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:22:48,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:22:48,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 15:22:48,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:22:48,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:22:48,499 INFO L85 PathProgramCache]: Analyzing trace with hash -174841762, now seen corresponding path program 1 times [2023-08-26 15:22:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:22:48,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293548359] [2023-08-26 15:22:48,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:22:48,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:22:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:22:48,560 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 15:22:48,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:22:48,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293548359] [2023-08-26 15:22:48,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293548359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:22:48,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:22:48,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 15:22:48,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367748850] [2023-08-26 15:22:48,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:22:48,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 15:22:48,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:22:48,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 15:22:48,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 15:22:48,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 195 [2023-08-26 15:22:48,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 16 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 15:22:48,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:22:48,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 195 [2023-08-26 15:22:48,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:22:48,599 INFO L124 PetriNetUnfolderBase]: 36/89 cut-off events. [2023-08-26 15:22:48,599 INFO L125 PetriNetUnfolderBase]: For 99/100 co-relation queries the response was YES. [2023-08-26 15:22:48,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282 conditions, 89 events. 36/89 cut-off events. For 99/100 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 210 event pairs, 11 based on Foata normal form. 9/97 useless extension candidates. Maximal degree in co-relation 270. Up to 65 conditions per place. [2023-08-26 15:22:48,600 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 20 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-08-26 15:22:48,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 24 transitions, 147 flow [2023-08-26 15:22:48,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 15:22:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 15:22:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2023-08-26 15:22:48,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512820512820513 [2023-08-26 15:22:48,601 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 264 transitions. [2023-08-26 15:22:48,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions. [2023-08-26 15:22:48,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:22:48,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions. [2023-08-26 15:22:48,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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 15:22:48,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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 15:22:48,602 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 195.0) internal successors, (780), 4 states have internal predecessors, (780), 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 15:22:48,602 INFO L175 Difference]: Start difference. First operand has 38 places, 16 transitions, 74 flow. Second operand 3 states and 264 transitions. [2023-08-26 15:22:48,603 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 24 transitions, 147 flow [2023-08-26 15:22:48,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 24 transitions, 108 flow, removed 8 selfloop flow, removed 11 redundant places. [2023-08-26 15:22:48,604 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 61 flow [2023-08-26 15:22:48,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=42, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=61, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-26 15:22:48,604 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -3 predicate places. [2023-08-26 15:22:48,604 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 61 flow [2023-08-26 15:22:48,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.33333333333333) internal successors, (250), 3 states have internal predecessors, (250), 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 15:22:48,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:22:48,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:22:48,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 15:22:48,605 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:22:48,605 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:22:48,605 INFO L85 PathProgramCache]: Analyzing trace with hash -1725853087, now seen corresponding path program 1 times [2023-08-26 15:22:48,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:22:48,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74578335] [2023-08-26 15:22:48,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:22:48,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:22:48,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:22:48,684 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 15:22:48,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:22:48,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74578335] [2023-08-26 15:22:48,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74578335] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:22:48,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:22:48,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 15:22:48,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147394065] [2023-08-26 15:22:48,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:22:48,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 15:22:48,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:22:48,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 15:22:48,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 15:22:48,685 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 195 [2023-08-26 15:22:48,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 61 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:22:48,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:22:48,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 195 [2023-08-26 15:22:48,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:22:48,715 INFO L124 PetriNetUnfolderBase]: 14/45 cut-off events. [2023-08-26 15:22:48,715 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2023-08-26 15:22:48,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 45 events. 14/45 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 69 event pairs, 7 based on Foata normal form. 6/50 useless extension candidates. Maximal degree in co-relation 124. Up to 23 conditions per place. [2023-08-26 15:22:48,715 INFO L140 encePairwiseOnDemand]: 191/195 looper letters, 18 selfloop transitions, 5 changer transitions 0/24 dead transitions. [2023-08-26 15:22:48,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 24 transitions, 123 flow [2023-08-26 15:22:48,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 15:22:48,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 15:22:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 344 transitions. [2023-08-26 15:22:48,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.441025641025641 [2023-08-26 15:22:48,717 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 344 transitions. [2023-08-26 15:22:48,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 344 transitions. [2023-08-26 15:22:48,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:22:48,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 344 transitions. [2023-08-26 15:22:48,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.0) internal successors, (344), 4 states have internal predecessors, (344), 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 15:22:48,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 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 15:22:48,719 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 195.0) internal successors, (975), 5 states have internal predecessors, (975), 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 15:22:48,719 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 61 flow. Second operand 4 states and 344 transitions. [2023-08-26 15:22:48,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 24 transitions, 123 flow [2023-08-26 15:22:48,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 24 transitions, 115 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-26 15:22:48,719 INFO L231 Difference]: Finished difference. Result has 29 places, 18 transitions, 70 flow [2023-08-26 15:22:48,719 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=70, PETRI_PLACES=29, PETRI_TRANSITIONS=18} [2023-08-26 15:22:48,720 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, -1 predicate places. [2023-08-26 15:22:48,720 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 18 transitions, 70 flow [2023-08-26 15:22:48,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 15:22:48,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:22:48,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:22:48,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 15:22:48,720 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:22:48,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:22:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1611839073, now seen corresponding path program 1 times [2023-08-26 15:22:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:22:48,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339901133] [2023-08-26 15:22:48,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:22:48,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:22:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 15:22:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 15:22:49,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 15:22:49,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339901133] [2023-08-26 15:22:49,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339901133] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 15:22:49,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 15:22:49,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 15:22:49,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727421402] [2023-08-26 15:22:49,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 15:22:49,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 15:22:49,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 15:22:49,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 15:22:49,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-26 15:22:49,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 195 [2023-08-26 15:22:49,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 18 transitions, 70 flow. Second operand has 7 states, 7 states have (on average 71.14285714285714) internal successors, (498), 7 states have internal predecessors, (498), 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 15:22:49,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 15:22:49,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 195 [2023-08-26 15:22:49,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 15:22:49,382 INFO L124 PetriNetUnfolderBase]: 15/56 cut-off events. [2023-08-26 15:22:49,383 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-08-26 15:22:49,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 56 events. 15/56 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 2 based on Foata normal form. 1/57 useless extension candidates. Maximal degree in co-relation 162. Up to 20 conditions per place. [2023-08-26 15:22:49,383 INFO L140 encePairwiseOnDemand]: 187/195 looper letters, 16 selfloop transitions, 5 changer transitions 13/35 dead transitions. [2023-08-26 15:22:49,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 35 transitions, 206 flow [2023-08-26 15:22:49,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 15:22:49,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 15:22:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 652 transitions. [2023-08-26 15:22:49,385 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3715099715099715 [2023-08-26 15:22:49,385 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 652 transitions. [2023-08-26 15:22:49,385 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 652 transitions. [2023-08-26 15:22:49,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 15:22:49,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 652 transitions. [2023-08-26 15:22:49,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 72.44444444444444) internal successors, (652), 9 states have internal predecessors, (652), 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 15:22:49,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 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 15:22:49,388 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 195.0) internal successors, (1950), 10 states have internal predecessors, (1950), 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 15:22:49,388 INFO L175 Difference]: Start difference. First operand has 29 places, 18 transitions, 70 flow. Second operand 9 states and 652 transitions. [2023-08-26 15:22:49,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 35 transitions, 206 flow [2023-08-26 15:22:49,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 35 transitions, 187 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-26 15:22:49,389 INFO L231 Difference]: Finished difference. Result has 38 places, 18 transitions, 78 flow [2023-08-26 15:22:49,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=195, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=78, PETRI_PLACES=38, PETRI_TRANSITIONS=18} [2023-08-26 15:22:49,389 INFO L281 CegarLoopForPetriNet]: 30 programPoint places, 8 predicate places. [2023-08-26 15:22:49,389 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 18 transitions, 78 flow [2023-08-26 15:22:49,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 71.14285714285714) internal successors, (498), 7 states have internal predecessors, (498), 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 15:22:49,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 15:22:49,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:22:49,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 15:22:49,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-08-26 15:22:49,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 15:22:49,390 INFO L85 PathProgramCache]: Analyzing trace with hash 220673023, now seen corresponding path program 2 times [2023-08-26 15:22:49,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 15:22:49,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173737461] [2023-08-26 15:22:49,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 15:22:49,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 15:22:49,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:22:49,413 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 15:22:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 15:22:49,461 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 15:22:49,461 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 15:22:49,462 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONASSERT (8 of 9 remaining) [2023-08-26 15:22:49,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (7 of 9 remaining) [2023-08-26 15:22:49,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 9 remaining) [2023-08-26 15:22:49,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 9 remaining) [2023-08-26 15:22:49,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 9 remaining) [2023-08-26 15:22:49,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 9 remaining) [2023-08-26 15:22:49,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 9 remaining) [2023-08-26 15:22:49,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 9 remaining) [2023-08-26 15:22:49,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (0 of 9 remaining) [2023-08-26 15:22:49,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 15:22:49,464 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 15:22:49,467 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 15:22:49,467 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 15:22:49,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 03:22:49 BasicIcfg [2023-08-26 15:22:49,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 15:22:49,496 INFO L158 Benchmark]: Toolchain (without parser) took 6153.63ms. Allocated memory was 402.7MB in the beginning and 543.2MB in the end (delta: 140.5MB). Free memory was 377.7MB in the beginning and 471.0MB in the end (delta: -93.3MB). Peak memory consumption was 47.8MB. Max. memory is 16.0GB. [2023-08-26 15:22:49,496 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 402.7MB. Free memory is still 379.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 15:22:49,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 401.67ms. Allocated memory is still 402.7MB. Free memory was 377.1MB in the beginning and 354.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 15:22:49,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.36ms. Allocated memory is still 402.7MB. Free memory was 354.7MB in the beginning and 352.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:22:49,496 INFO L158 Benchmark]: Boogie Preprocessor took 38.56ms. Allocated memory is still 402.7MB. Free memory was 352.6MB in the beginning and 350.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 15:22:49,496 INFO L158 Benchmark]: RCFGBuilder took 492.17ms. Allocated memory is still 402.7MB. Free memory was 350.5MB in the beginning and 370.2MB in the end (delta: -19.8MB). Peak memory consumption was 31.1MB. Max. memory is 16.0GB. [2023-08-26 15:22:49,497 INFO L158 Benchmark]: TraceAbstraction took 5185.68ms. Allocated memory was 402.7MB in the beginning and 543.2MB in the end (delta: 140.5MB). Free memory was 369.2MB in the beginning and 471.0MB in the end (delta: -101.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-26 15:22:49,498 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 402.7MB. Free memory is still 379.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 401.67ms. Allocated memory is still 402.7MB. Free memory was 377.1MB in the beginning and 354.7MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 31.36ms. Allocated memory is still 402.7MB. Free memory was 354.7MB in the beginning and 352.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.56ms. Allocated memory is still 402.7MB. Free memory was 352.6MB in the beginning and 350.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 492.17ms. Allocated memory is still 402.7MB. Free memory was 350.5MB in the beginning and 370.2MB in the end (delta: -19.8MB). Peak memory consumption was 31.1MB. Max. memory is 16.0GB. * TraceAbstraction took 5185.68ms. Allocated memory was 402.7MB in the beginning and 543.2MB in the end (delta: 140.5MB). Free memory was 369.2MB in the beginning and 471.0MB in the end (delta: -101.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.5s, 98 PlacesBefore, 30 PlacesAfterwards, 94 TransitionsBefore, 24 TransitionsAfterwards, 1186 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 13 ConcurrentYvCompositions, 2 ChoiceCompositions, 99 TotalNumberOfCompositions, 3046 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1610, independent: 1487, independent conditional: 0, independent unconditional: 1487, dependent: 123, dependent conditional: 0, dependent unconditional: 123, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 657, independent: 633, independent conditional: 0, independent unconditional: 633, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1610, independent: 854, independent conditional: 0, independent unconditional: 854, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 657, unknown conditional: 0, unknown unconditional: 657] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 51, Positive conditional cache size: 0, Positive unconditional cache size: 51, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L712] 0 int __unbuffered_p1_EBX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L718] 0 int y = 0; [L719] 0 _Bool y$flush_delayed; [L720] 0 int y$mem_tmp; [L721] 0 _Bool y$r_buff0_thd0; [L722] 0 _Bool y$r_buff0_thd1; [L723] 0 _Bool y$r_buff0_thd2; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$read_delayed; [L728] 0 int *y$read_delayed_var; [L729] 0 int y$w_buff0; [L730] 0 _Bool y$w_buff0_used; [L731] 0 int y$w_buff1; [L732] 0 _Bool y$w_buff1_used; [L733] 0 _Bool weak$$choice0; [L734] 0 _Bool weak$$choice2; [L807] 0 pthread_t t2305; [L808] FCALL, FORK 0 pthread_create(&t2305, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2305, ((void *)0), P0, ((void *)0))=-2, t2305={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L809] 0 pthread_t t2306; [L810] FCALL, FORK 0 pthread_create(&t2306, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2306, ((void *)0), P1, ((void *)0))=-1, t2305={5:0}, t2306={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=0] [L738] 1 y$w_buff1 = y$w_buff0 [L739] 1 y$w_buff0 = 1 [L740] 1 y$w_buff1_used = y$w_buff0_used [L741] 1 y$w_buff0_used = (_Bool)1 [L742] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L742] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L743] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L744] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L745] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L746] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L749] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L766] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L769] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 2 y$flush_delayed = weak$$choice2 [L772] 2 y$mem_tmp = y [L773] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L774] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L775] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L776] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L777] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L779] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 __unbuffered_p1_EBX = y [L781] 2 y = y$flush_delayed ? y$mem_tmp : y [L782] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L785] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L786] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L787] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L788] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L789] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y=0] [L752] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L753] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L755] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L756] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L812] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L814] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L814] RET 0 assume_abort_if_not(main$tmp_guard0) [L816] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L817] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L818] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L819] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L820] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2305={5:0}, t2306={3:0}, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=1] [L823] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L825] 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", "safe022_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={66:67}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y=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: 810]: 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: 808]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 113 locations, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 130 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 130 mSDsluCounter, 8 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 396 IncrementalHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 4 mSDtfsCounter, 396 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=4, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 15:22:49,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...