/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 -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:34:52,129 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:34:52,220 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-24 05:34:52,225 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:34:52,226 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:34:52,259 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:34:52,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:34:52,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:34:52,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:34:52,265 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:34:52,265 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:34:52,266 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:34:52,266 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:34:52,267 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:34:52,268 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:34:52,268 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:34:52,268 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:34:52,268 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:34:52,268 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:34:52,269 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:34:52,269 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:34:52,270 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:34:52,270 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:34:52,270 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:34:52,271 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:34:52,271 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:34:52,271 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:34:52,271 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:34:52,271 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:34:52,272 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:34:52,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:34:52,273 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:34:52,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:34:52,273 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:34:52,273 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:34:52,274 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 [2023-08-24 05:34:52,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:34:52,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:34:52,610 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:34:52,611 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:34:52,611 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:34:52,613 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-08-24 05:34:53,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:34:54,141 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:34:54,142 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-08-24 05:34:54,162 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad003706/ca66925ea9ae4018b431ddf24f33a051/FLAGb493e832d [2023-08-24 05:34:54,174 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ad003706/ca66925ea9ae4018b431ddf24f33a051 [2023-08-24 05:34:54,179 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:34:54,180 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:34:54,182 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:34:54,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:34:54,185 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:34:54,186 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd8fb50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54, skipping insertion in model container [2023-08-24 05:34:54,188 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,248 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:34:54,416 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-08-24 05:34:54,611 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:34:54,624 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:34:54,636 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i[1009,1022] [2023-08-24 05:34:54,656 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:34:54,657 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-24 05:34:54,699 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:34:54,732 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:34:54,733 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:34:54,739 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:34:54,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54 WrapperNode [2023-08-24 05:34:54,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:34:54,741 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:34:54,741 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:34:54,741 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:34:54,747 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,788 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-08-24 05:34:54,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:34:54,789 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:34:54,789 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:34:54,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:34:54,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,811 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,813 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,817 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,820 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:34:54,821 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:34:54,821 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:34:54,821 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:34:54,822 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (1/1) ... [2023-08-24 05:34:54,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:34:54,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:34:54,862 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-24 05:34:54,891 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-24 05:34:54,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:34:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:34:54,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:34:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:34:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:34:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:34:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:34:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:34:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:34:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:34:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:34:54,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:34:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:34:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:34:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:34:54,913 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:34:55,052 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:34:55,053 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:34:55,315 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:34:55,433 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:34:55,433 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:34:55,435 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:34:55 BoogieIcfgContainer [2023-08-24 05:34:55,435 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:34:55,437 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:34:55,437 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:34:55,440 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:34:55,440 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:34:54" (1/3) ... [2023-08-24 05:34:55,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c73ae7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:34:55, skipping insertion in model container [2023-08-24 05:34:55,441 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:34:54" (2/3) ... [2023-08-24 05:34:55,441 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c73ae7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:34:55, skipping insertion in model container [2023-08-24 05:34:55,442 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:34:55" (3/3) ... [2023-08-24 05:34:55,443 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-08-24 05:34:55,457 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:34:55,457 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:34:55,458 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:34:55,508 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:34:55,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2023-08-24 05:34:55,602 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2023-08-24 05:34:55,602 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:34:55,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-24 05:34:55,609 INFO L82 GeneralOperation]: Start removeDead. Operand has 116 places, 108 transitions, 231 flow [2023-08-24 05:34:55,612 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 105 transitions, 219 flow [2023-08-24 05:34:55,615 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:34:55,628 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-24 05:34:55,630 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 105 transitions, 219 flow [2023-08-24 05:34:55,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 105 transitions, 219 flow [2023-08-24 05:34:55,662 INFO L124 PetriNetUnfolderBase]: 2/105 cut-off events. [2023-08-24 05:34:55,663 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:34:55,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 68. Up to 2 conditions per place. [2023-08-24 05:34:55,665 INFO L119 LiptonReduction]: Number of co-enabled transitions 1790 [2023-08-24 05:34:59,121 INFO L134 LiptonReduction]: Checked pairs total: 4829 [2023-08-24 05:34:59,121 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-24 05:34:59,132 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:34:59,137 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;@3babc208, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:34:59,137 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:34:59,140 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:34:59,140 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-24 05:34:59,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:34:59,140 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:59,141 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:34:59,141 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:59,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:59,145 INFO L85 PathProgramCache]: Analyzing trace with hash 442870472, now seen corresponding path program 1 times [2023-08-24 05:34:59,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:59,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000473355] [2023-08-24 05:34:59,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:59,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:34:59,555 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-24 05:34:59,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:34:59,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000473355] [2023-08-24 05:34:59,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000473355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:34:59,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:34:59,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:34:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529895771] [2023-08-24 05:34:59,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:34:59,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:34:59,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:34:59,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:34:59,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:34:59,589 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 201 [2023-08-24 05:34:59,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-24 05:34:59,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:34:59,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 201 [2023-08-24 05:34:59,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:34:59,859 INFO L124 PetriNetUnfolderBase]: 999/1620 cut-off events. [2023-08-24 05:34:59,859 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-24 05:34:59,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3155 conditions, 1620 events. 999/1620 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8311 event pairs, 165 based on Foata normal form. 64/1552 useless extension candidates. Maximal degree in co-relation 3144. Up to 1195 conditions per place. [2023-08-24 05:34:59,871 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 29 selfloop transitions, 2 changer transitions 4/37 dead transitions. [2023-08-24 05:34:59,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 37 transitions, 156 flow [2023-08-24 05:34:59,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:34:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:34:59,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2023-08-24 05:34:59,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5356550580431177 [2023-08-24 05:34:59,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2023-08-24 05:34:59,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2023-08-24 05:34:59,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:34:59,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2023-08-24 05:34:59,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 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-24 05:34:59,895 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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-24 05:34:59,895 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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-24 05:34:59,897 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 323 transitions. [2023-08-24 05:34:59,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 37 transitions, 156 flow [2023-08-24 05:34:59,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 37 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:34:59,901 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2023-08-24 05:34:59,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2023-08-24 05:34:59,906 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-24 05:34:59,906 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2023-08-24 05:34:59,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 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-24 05:34:59,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:34:59,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:34:59,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:34:59,907 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:34:59,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:34:59,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1811307044, now seen corresponding path program 1 times [2023-08-24 05:34:59,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:34:59,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133510469] [2023-08-24 05:34:59,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:34:59,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:34:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:00,069 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-24 05:35:00,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:00,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133510469] [2023-08-24 05:35:00,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133510469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:00,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:00,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:35:00,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669939735] [2023-08-24 05:35:00,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:00,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:35:00,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:00,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:35:00,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:35:00,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-08-24 05:35:00,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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-24 05:35:00,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:00,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-08-24 05:35:00,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:00,350 INFO L124 PetriNetUnfolderBase]: 773/1237 cut-off events. [2023-08-24 05:35:00,351 INFO L125 PetriNetUnfolderBase]: For 101/101 co-relation queries the response was YES. [2023-08-24 05:35:00,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2575 conditions, 1237 events. 773/1237 cut-off events. For 101/101 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 5809 event pairs, 406 based on Foata normal form. 64/1300 useless extension candidates. Maximal degree in co-relation 2565. Up to 1008 conditions per place. [2023-08-24 05:35:00,358 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 27 selfloop transitions, 3 changer transitions 15/47 dead transitions. [2023-08-24 05:35:00,359 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 204 flow [2023-08-24 05:35:00,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:00,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:00,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-08-24 05:35:00,365 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845771144278607 [2023-08-24 05:35:00,365 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-08-24 05:35:00,365 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-08-24 05:35:00,366 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:00,366 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-08-24 05:35:00,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-24 05:35:00,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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-24 05:35:00,371 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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-24 05:35:00,371 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 487 transitions. [2023-08-24 05:35:00,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 204 flow [2023-08-24 05:35:00,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 47 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:35:00,373 INFO L231 Difference]: Finished difference. Result has 35 places, 23 transitions, 75 flow [2023-08-24 05:35:00,373 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=35, PETRI_TRANSITIONS=23} [2023-08-24 05:35:00,374 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 1 predicate places. [2023-08-24 05:35:00,374 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 23 transitions, 75 flow [2023-08-24 05:35:00,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 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-24 05:35:00,374 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:00,375 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:00,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:35:00,375 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:00,375 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:00,376 INFO L85 PathProgramCache]: Analyzing trace with hash 315936094, now seen corresponding path program 1 times [2023-08-24 05:35:00,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:00,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95330143] [2023-08-24 05:35:00,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:00,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:00,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:00,532 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-24 05:35:00,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:00,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95330143] [2023-08-24 05:35:00,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95330143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:00,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:00,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:00,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767480866] [2023-08-24 05:35:00,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:00,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:00,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:00,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:00,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:00,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-08-24 05:35:00,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 23 transitions, 75 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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-24 05:35:00,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:00,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-08-24 05:35:00,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:00,739 INFO L124 PetriNetUnfolderBase]: 699/1144 cut-off events. [2023-08-24 05:35:00,739 INFO L125 PetriNetUnfolderBase]: For 459/459 co-relation queries the response was YES. [2023-08-24 05:35:00,742 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2709 conditions, 1144 events. 699/1144 cut-off events. For 459/459 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5337 event pairs, 175 based on Foata normal form. 48/1188 useless extension candidates. Maximal degree in co-relation 2696. Up to 761 conditions per place. [2023-08-24 05:35:00,747 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 25 selfloop transitions, 3 changer transitions 14/44 dead transitions. [2023-08-24 05:35:00,747 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 44 transitions, 207 flow [2023-08-24 05:35:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:00,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-08-24 05:35:00,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48059701492537316 [2023-08-24 05:35:00,749 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-08-24 05:35:00,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-08-24 05:35:00,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:00,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-08-24 05:35:00,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 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-24 05:35:00,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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-24 05:35:00,754 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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-24 05:35:00,754 INFO L175 Difference]: Start difference. First operand has 35 places, 23 transitions, 75 flow. Second operand 5 states and 483 transitions. [2023-08-24 05:35:00,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 44 transitions, 207 flow [2023-08-24 05:35:00,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 44 transitions, 198 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-24 05:35:00,759 INFO L231 Difference]: Finished difference. Result has 38 places, 23 transitions, 83 flow [2023-08-24 05:35:00,760 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=38, PETRI_TRANSITIONS=23} [2023-08-24 05:35:00,760 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-08-24 05:35:00,761 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 23 transitions, 83 flow [2023-08-24 05:35:00,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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-24 05:35:00,761 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:00,761 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:00,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:35:00,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:00,762 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:00,762 INFO L85 PathProgramCache]: Analyzing trace with hash 315937055, now seen corresponding path program 1 times [2023-08-24 05:35:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:00,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362602423] [2023-08-24 05:35:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:00,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:00,959 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-24 05:35:00,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:00,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362602423] [2023-08-24 05:35:00,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362602423] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:00,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:00,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:00,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933913729] [2023-08-24 05:35:00,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:00,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:00,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:00,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:00,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:00,965 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 201 [2023-08-24 05:35:00,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 23 transitions, 83 flow. Second operand has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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-24 05:35:00,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:00,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 201 [2023-08-24 05:35:00,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:01,196 INFO L124 PetriNetUnfolderBase]: 641/1038 cut-off events. [2023-08-24 05:35:01,196 INFO L125 PetriNetUnfolderBase]: For 699/699 co-relation queries the response was YES. [2023-08-24 05:35:01,198 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2550 conditions, 1038 events. 641/1038 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4849 event pairs, 231 based on Foata normal form. 48/1082 useless extension candidates. Maximal degree in co-relation 2534. Up to 757 conditions per place. [2023-08-24 05:35:01,203 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 29 selfloop transitions, 3 changer transitions 14/48 dead transitions. [2023-08-24 05:35:01,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 237 flow [2023-08-24 05:35:01,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:01,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-08-24 05:35:01,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845771144278607 [2023-08-24 05:35:01,205 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-08-24 05:35:01,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-08-24 05:35:01,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:01,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-08-24 05:35:01,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 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-24 05:35:01,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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-24 05:35:01,209 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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-24 05:35:01,210 INFO L175 Difference]: Start difference. First operand has 38 places, 23 transitions, 83 flow. Second operand 5 states and 487 transitions. [2023-08-24 05:35:01,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 237 flow [2023-08-24 05:35:01,213 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 223 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 05:35:01,214 INFO L231 Difference]: Finished difference. Result has 39 places, 23 transitions, 86 flow [2023-08-24 05:35:01,214 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=39, PETRI_TRANSITIONS=23} [2023-08-24 05:35:01,214 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-08-24 05:35:01,215 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 23 transitions, 86 flow [2023-08-24 05:35:01,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.2) internal successors, (451), 5 states have internal predecessors, (451), 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-24 05:35:01,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:01,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:01,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:35:01,215 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:01,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:01,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1204077861, now seen corresponding path program 1 times [2023-08-24 05:35:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:01,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818595499] [2023-08-24 05:35:01,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:01,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:01,332 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-24 05:35:01,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818595499] [2023-08-24 05:35:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818595499] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:01,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712159325] [2023-08-24 05:35:01,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:01,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:01,334 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-24 05:35:01,335 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 23 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-24 05:35:01,335 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:01,335 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-24 05:35:01,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:01,725 INFO L124 PetriNetUnfolderBase]: 1155/1815 cut-off events. [2023-08-24 05:35:01,725 INFO L125 PetriNetUnfolderBase]: For 1204/1204 co-relation queries the response was YES. [2023-08-24 05:35:01,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4469 conditions, 1815 events. 1155/1815 cut-off events. For 1204/1204 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 9020 event pairs, 226 based on Foata normal form. 75/1882 useless extension candidates. Maximal degree in co-relation 4452. Up to 721 conditions per place. [2023-08-24 05:35:01,736 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 46 selfloop transitions, 11 changer transitions 26/84 dead transitions. [2023-08-24 05:35:01,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 84 transitions, 427 flow [2023-08-24 05:35:01,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:35:01,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:35:01,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 859 transitions. [2023-08-24 05:35:01,739 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748479823106689 [2023-08-24 05:35:01,740 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 859 transitions. [2023-08-24 05:35:01,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 859 transitions. [2023-08-24 05:35:01,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:01,740 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 859 transitions. [2023-08-24 05:35:01,743 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.44444444444444) internal successors, (859), 9 states have internal predecessors, (859), 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-24 05:35:01,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 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-24 05:35:01,746 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 201.0) internal successors, (2010), 10 states have internal predecessors, (2010), 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-24 05:35:01,746 INFO L175 Difference]: Start difference. First operand has 39 places, 23 transitions, 86 flow. Second operand 9 states and 859 transitions. [2023-08-24 05:35:01,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 84 transitions, 427 flow [2023-08-24 05:35:01,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 84 transitions, 403 flow, removed 6 selfloop flow, removed 5 redundant places. [2023-08-24 05:35:01,757 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 169 flow [2023-08-24 05:35:01,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=169, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-08-24 05:35:01,758 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-08-24 05:35:01,758 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 169 flow [2023-08-24 05:35:01,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 88.4) internal successors, (442), 5 states have internal predecessors, (442), 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-24 05:35:01,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:01,759 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:01,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:35:01,759 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:01,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash -25665789, now seen corresponding path program 2 times [2023-08-24 05:35:01,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:01,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169818588] [2023-08-24 05:35:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:01,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:01,873 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-24 05:35:01,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:01,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169818588] [2023-08-24 05:35:01,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169818588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:01,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:01,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:35:01,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142667977] [2023-08-24 05:35:01,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:01,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:35:01,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:01,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:35:01,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:35:01,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 201 [2023-08-24 05:35:01,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 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-24 05:35:01,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:01,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 201 [2023-08-24 05:35:01,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:02,193 INFO L124 PetriNetUnfolderBase]: 1177/1858 cut-off events. [2023-08-24 05:35:02,193 INFO L125 PetriNetUnfolderBase]: For 2786/2786 co-relation queries the response was YES. [2023-08-24 05:35:02,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5577 conditions, 1858 events. 1177/1858 cut-off events. For 2786/2786 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9261 event pairs, 322 based on Foata normal form. 45/1899 useless extension candidates. Maximal degree in co-relation 5556. Up to 729 conditions per place. [2023-08-24 05:35:02,205 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 31 selfloop transitions, 5 changer transitions 24/61 dead transitions. [2023-08-24 05:35:02,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 406 flow [2023-08-24 05:35:02,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:35:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:35:02,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 571 transitions. [2023-08-24 05:35:02,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4734660033167496 [2023-08-24 05:35:02,207 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 571 transitions. [2023-08-24 05:35:02,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 571 transitions. [2023-08-24 05:35:02,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:02,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 571 transitions. [2023-08-24 05:35:02,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 95.16666666666667) internal successors, (571), 6 states have internal predecessors, (571), 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-24 05:35:02,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 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-24 05:35:02,211 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 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-24 05:35:02,211 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 169 flow. Second operand 6 states and 571 transitions. [2023-08-24 05:35:02,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 406 flow [2023-08-24 05:35:02,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 61 transitions, 390 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-08-24 05:35:02,219 INFO L231 Difference]: Finished difference. Result has 49 places, 25 transitions, 142 flow [2023-08-24 05:35:02,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=49, PETRI_TRANSITIONS=25} [2023-08-24 05:35:02,220 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2023-08-24 05:35:02,220 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 25 transitions, 142 flow [2023-08-24 05:35:02,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 88.0) internal successors, (528), 6 states have internal predecessors, (528), 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-24 05:35:02,221 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:02,221 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:02,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:35:02,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:02,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:02,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1712907669, now seen corresponding path program 1 times [2023-08-24 05:35:02,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:02,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222192512] [2023-08-24 05:35:02,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:02,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:02,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:02,363 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-24 05:35:02,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:02,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222192512] [2023-08-24 05:35:02,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222192512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:02,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:02,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:02,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094925135] [2023-08-24 05:35:02,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:02,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:02,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:02,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:02,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:02,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 201 [2023-08-24 05:35:02,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 25 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 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-24 05:35:02,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:02,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 201 [2023-08-24 05:35:02,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:02,591 INFO L124 PetriNetUnfolderBase]: 755/1176 cut-off events. [2023-08-24 05:35:02,591 INFO L125 PetriNetUnfolderBase]: For 2518/2522 co-relation queries the response was YES. [2023-08-24 05:35:02,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3762 conditions, 1176 events. 755/1176 cut-off events. For 2518/2522 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4646 event pairs, 209 based on Foata normal form. 36/1207 useless extension candidates. Maximal degree in co-relation 3738. Up to 406 conditions per place. [2023-08-24 05:35:02,598 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 27 selfloop transitions, 3 changer transitions 22/53 dead transitions. [2023-08-24 05:35:02,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 53 transitions, 357 flow [2023-08-24 05:35:02,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:35:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:35:02,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2023-08-24 05:35:02,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4842454394693201 [2023-08-24 05:35:02,601 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 584 transitions. [2023-08-24 05:35:02,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 584 transitions. [2023-08-24 05:35:02,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:02,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 584 transitions. [2023-08-24 05:35:02,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 97.33333333333333) internal successors, (584), 6 states have internal predecessors, (584), 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-24 05:35:02,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 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-24 05:35:02,605 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 201.0) internal successors, (1407), 7 states have internal predecessors, (1407), 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-24 05:35:02,605 INFO L175 Difference]: Start difference. First operand has 49 places, 25 transitions, 142 flow. Second operand 6 states and 584 transitions. [2023-08-24 05:35:02,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 53 transitions, 357 flow [2023-08-24 05:35:02,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 53 transitions, 320 flow, removed 9 selfloop flow, removed 8 redundant places. [2023-08-24 05:35:02,610 INFO L231 Difference]: Finished difference. Result has 48 places, 21 transitions, 106 flow [2023-08-24 05:35:02,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=106, PETRI_PLACES=48, PETRI_TRANSITIONS=21} [2023-08-24 05:35:02,611 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2023-08-24 05:35:02,611 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 21 transitions, 106 flow [2023-08-24 05:35:02,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 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-24 05:35:02,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:02,612 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:02,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:35:02,612 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:02,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:02,612 INFO L85 PathProgramCache]: Analyzing trace with hash -747497523, now seen corresponding path program 1 times [2023-08-24 05:35:02,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:02,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418291101] [2023-08-24 05:35:02,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:02,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:02,704 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-24 05:35:02,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:02,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418291101] [2023-08-24 05:35:02,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418291101] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:02,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:02,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:35:02,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487508155] [2023-08-24 05:35:02,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:02,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:35:02,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:02,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:35:02,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:35:02,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 201 [2023-08-24 05:35:02,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 21 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-24 05:35:02,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:02,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 201 [2023-08-24 05:35:02,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:02,781 INFO L124 PetriNetUnfolderBase]: 188/331 cut-off events. [2023-08-24 05:35:02,781 INFO L125 PetriNetUnfolderBase]: For 756/757 co-relation queries the response was YES. [2023-08-24 05:35:02,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1088 conditions, 331 events. 188/331 cut-off events. For 756/757 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1120 event pairs, 49 based on Foata normal form. 15/345 useless extension candidates. Maximal degree in co-relation 1066. Up to 290 conditions per place. [2023-08-24 05:35:02,784 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 25 selfloop transitions, 4 changer transitions 0/31 dead transitions. [2023-08-24 05:35:02,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 31 transitions, 206 flow [2023-08-24 05:35:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:35:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:35:02,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2023-08-24 05:35:02,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5024875621890548 [2023-08-24 05:35:02,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 303 transitions. [2023-08-24 05:35:02,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 303 transitions. [2023-08-24 05:35:02,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:02,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 303 transitions. [2023-08-24 05:35:02,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 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-24 05:35:02,788 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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-24 05:35:02,788 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 201.0) internal successors, (804), 4 states have internal predecessors, (804), 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-24 05:35:02,788 INFO L175 Difference]: Start difference. First operand has 48 places, 21 transitions, 106 flow. Second operand 3 states and 303 transitions. [2023-08-24 05:35:02,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 31 transitions, 206 flow [2023-08-24 05:35:02,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 31 transitions, 159 flow, removed 10 selfloop flow, removed 12 redundant places. [2023-08-24 05:35:02,790 INFO L231 Difference]: Finished difference. Result has 36 places, 24 transitions, 96 flow [2023-08-24 05:35:02,790 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=36, PETRI_TRANSITIONS=24} [2023-08-24 05:35:02,791 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2023-08-24 05:35:02,791 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 24 transitions, 96 flow [2023-08-24 05:35:02,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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-24 05:35:02,791 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:02,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:02,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:35:02,791 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:02,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:02,792 INFO L85 PathProgramCache]: Analyzing trace with hash -20499012, now seen corresponding path program 1 times [2023-08-24 05:35:02,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:02,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048702539] [2023-08-24 05:35:02,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:02,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:02,922 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-24 05:35:02,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:02,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048702539] [2023-08-24 05:35:02,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048702539] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:02,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:02,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:35:02,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972997489] [2023-08-24 05:35:02,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:02,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:35:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:35:02,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:35:02,925 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 201 [2023-08-24 05:35:02,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 24 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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-24 05:35:02,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:02,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 201 [2023-08-24 05:35:02,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:02,999 INFO L124 PetriNetUnfolderBase]: 74/159 cut-off events. [2023-08-24 05:35:02,999 INFO L125 PetriNetUnfolderBase]: For 104/105 co-relation queries the response was YES. [2023-08-24 05:35:02,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 496 conditions, 159 events. 74/159 cut-off events. For 104/105 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 427 event pairs, 18 based on Foata normal form. 17/175 useless extension candidates. Maximal degree in co-relation 482. Up to 78 conditions per place. [2023-08-24 05:35:03,000 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 29 selfloop transitions, 7 changer transitions 0/38 dead transitions. [2023-08-24 05:35:03,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 220 flow [2023-08-24 05:35:03,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:35:03,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:35:03,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 401 transitions. [2023-08-24 05:35:03,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987562189054726 [2023-08-24 05:35:03,002 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 401 transitions. [2023-08-24 05:35:03,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 401 transitions. [2023-08-24 05:35:03,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:03,002 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 401 transitions. [2023-08-24 05:35:03,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 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-24 05:35:03,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 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-24 05:35:03,006 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 201.0) internal successors, (1005), 5 states have internal predecessors, (1005), 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-24 05:35:03,006 INFO L175 Difference]: Start difference. First operand has 36 places, 24 transitions, 96 flow. Second operand 4 states and 401 transitions. [2023-08-24 05:35:03,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 220 flow [2023-08-24 05:35:03,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:35:03,008 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 132 flow [2023-08-24 05:35:03,008 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2023-08-24 05:35:03,009 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-08-24 05:35:03,010 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 132 flow [2023-08-24 05:35:03,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 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-24 05:35:03,011 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:03,011 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:03,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:35:03,011 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:03,011 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:03,011 INFO L85 PathProgramCache]: Analyzing trace with hash 281488133, now seen corresponding path program 1 times [2023-08-24 05:35:03,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:03,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666753666] [2023-08-24 05:35:03,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:03,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:03,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:03,218 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-24 05:35:03,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:03,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666753666] [2023-08-24 05:35:03,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666753666] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:03,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:03,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:35:03,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707889434] [2023-08-24 05:35:03,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:03,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:35:03,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:03,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:35:03,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:35:03,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 201 [2023-08-24 05:35:03,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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-24 05:35:03,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:03,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 201 [2023-08-24 05:35:03,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:03,284 INFO L124 PetriNetUnfolderBase]: 48/107 cut-off events. [2023-08-24 05:35:03,284 INFO L125 PetriNetUnfolderBase]: For 137/138 co-relation queries the response was YES. [2023-08-24 05:35:03,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 107 events. 48/107 cut-off events. For 137/138 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 255 event pairs, 14 based on Foata normal form. 7/113 useless extension candidates. Maximal degree in co-relation 353. Up to 40 conditions per place. [2023-08-24 05:35:03,285 INFO L140 encePairwiseOnDemand]: 196/201 looper letters, 26 selfloop transitions, 10 changer transitions 0/38 dead transitions. [2023-08-24 05:35:03,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 38 transitions, 244 flow [2023-08-24 05:35:03,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:35:03,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:35:03,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 492 transitions. [2023-08-24 05:35:03,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48955223880597015 [2023-08-24 05:35:03,287 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 492 transitions. [2023-08-24 05:35:03,287 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 492 transitions. [2023-08-24 05:35:03,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:03,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 492 transitions. [2023-08-24 05:35:03,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 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-24 05:35:03,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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-24 05:35:03,292 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 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-24 05:35:03,292 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 132 flow. Second operand 5 states and 492 transitions. [2023-08-24 05:35:03,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 38 transitions, 244 flow [2023-08-24 05:35:03,293 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 38 transitions, 195 flow, removed 16 selfloop flow, removed 6 redundant places. [2023-08-24 05:35:03,294 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 126 flow [2023-08-24 05:35:03,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2023-08-24 05:35:03,295 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2023-08-24 05:35:03,295 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 126 flow [2023-08-24 05:35:03,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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-24 05:35:03,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:03,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:03,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:35:03,296 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:03,296 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:03,296 INFO L85 PathProgramCache]: Analyzing trace with hash 739022676, now seen corresponding path program 1 times [2023-08-24 05:35:03,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:03,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647750453] [2023-08-24 05:35:03,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:03,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:03,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:35:04,361 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-24 05:35:04,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:35:04,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647750453] [2023-08-24 05:35:04,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647750453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:35:04,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:35:04,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:35:04,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872894996] [2023-08-24 05:35:04,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:35:04,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:35:04,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:35:04,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:35:04,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:35:04,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 201 [2023-08-24 05:35:04,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 126 flow. Second operand has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 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-24 05:35:04,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:35:04,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 201 [2023-08-24 05:35:04,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:35:04,539 INFO L124 PetriNetUnfolderBase]: 56/130 cut-off events. [2023-08-24 05:35:04,540 INFO L125 PetriNetUnfolderBase]: For 182/182 co-relation queries the response was YES. [2023-08-24 05:35:04,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 425 conditions, 130 events. 56/130 cut-off events. For 182/182 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 343 event pairs, 14 based on Foata normal form. 1/131 useless extension candidates. Maximal degree in co-relation 412. Up to 65 conditions per place. [2023-08-24 05:35:04,541 INFO L140 encePairwiseOnDemand]: 194/201 looper letters, 28 selfloop transitions, 4 changer transitions 18/52 dead transitions. [2023-08-24 05:35:04,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 363 flow [2023-08-24 05:35:04,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:35:04,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:35:04,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 709 transitions. [2023-08-24 05:35:04,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44092039800995025 [2023-08-24 05:35:04,543 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 709 transitions. [2023-08-24 05:35:04,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 709 transitions. [2023-08-24 05:35:04,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:35:04,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 709 transitions. [2023-08-24 05:35:04,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 88.625) internal successors, (709), 8 states have internal predecessors, (709), 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-24 05:35:04,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 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-24 05:35:04,548 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 201.0) internal successors, (1809), 9 states have internal predecessors, (1809), 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-24 05:35:04,548 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 126 flow. Second operand 8 states and 709 transitions. [2023-08-24 05:35:04,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 363 flow [2023-08-24 05:35:04,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 52 transitions, 307 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-08-24 05:35:04,550 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 116 flow [2023-08-24 05:35:04,550 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=116, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-08-24 05:35:04,550 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2023-08-24 05:35:04,550 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 116 flow [2023-08-24 05:35:04,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 86.375) internal successors, (691), 8 states have internal predecessors, (691), 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-24 05:35:04,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:35:04,551 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:04,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:35:04,551 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:35:04,551 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:35:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1938055334, now seen corresponding path program 2 times [2023-08-24 05:35:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:35:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146227987] [2023-08-24 05:35:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:35:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:35:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:35:04,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:35:04,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:35:04,636 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:35:04,636 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:35:04,637 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:35:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:35:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:35:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:35:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:35:04,642 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:35:04,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:35:04,643 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:35:04,648 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:35:04,648 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:35:04,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:35:04 BasicIcfg [2023-08-24 05:35:04,715 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:35:04,715 INFO L158 Benchmark]: Toolchain (without parser) took 10535.17ms. Allocated memory was 325.1MB in the beginning and 474.0MB in the end (delta: 148.9MB). Free memory was 299.9MB in the beginning and 323.6MB in the end (delta: -23.7MB). Peak memory consumption was 127.0MB. Max. memory is 16.0GB. [2023-08-24 05:35:04,715 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 325.1MB. Free memory is still 302.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:35:04,715 INFO L158 Benchmark]: CACSL2BoogieTranslator took 557.70ms. Allocated memory is still 325.1MB. Free memory was 299.9MB in the beginning and 276.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-24 05:35:04,716 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.21ms. Allocated memory is still 325.1MB. Free memory was 276.8MB in the beginning and 274.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:35:04,716 INFO L158 Benchmark]: Boogie Preprocessor took 30.98ms. Allocated memory is still 325.1MB. Free memory was 274.4MB in the beginning and 272.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:35:04,716 INFO L158 Benchmark]: RCFGBuilder took 614.32ms. Allocated memory is still 325.1MB. Free memory was 272.7MB in the beginning and 299.5MB in the end (delta: -26.8MB). Peak memory consumption was 35.8MB. Max. memory is 16.0GB. [2023-08-24 05:35:04,716 INFO L158 Benchmark]: TraceAbstraction took 9277.23ms. Allocated memory was 325.1MB in the beginning and 474.0MB in the end (delta: 148.9MB). Free memory was 298.4MB in the beginning and 323.6MB in the end (delta: -25.2MB). Peak memory consumption was 124.8MB. Max. memory is 16.0GB. [2023-08-24 05:35:04,717 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.16ms. Allocated memory is still 325.1MB. Free memory is still 302.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 557.70ms. Allocated memory is still 325.1MB. Free memory was 299.9MB in the beginning and 276.8MB in the end (delta: 23.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.21ms. Allocated memory is still 325.1MB. Free memory was 276.8MB in the beginning and 274.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.98ms. Allocated memory is still 325.1MB. Free memory was 274.4MB in the beginning and 272.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 614.32ms. Allocated memory is still 325.1MB. Free memory was 272.7MB in the beginning and 299.5MB in the end (delta: -26.8MB). Peak memory consumption was 35.8MB. Max. memory is 16.0GB. * TraceAbstraction took 9277.23ms. Allocated memory was 325.1MB in the beginning and 474.0MB in the end (delta: 148.9MB). Free memory was 298.4MB in the beginning and 323.6MB in the end (delta: -25.2MB). Peak memory consumption was 124.8MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 113 PlacesBefore, 34 PlacesAfterwards, 105 TransitionsBefore, 25 TransitionsAfterwards, 1790 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 93 TotalNumberOfCompositions, 4829 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2298, independent: 2122, independent conditional: 0, independent unconditional: 2122, dependent: 176, dependent conditional: 0, dependent unconditional: 176, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 952, independent: 920, independent conditional: 0, independent unconditional: 920, dependent: 32, dependent conditional: 0, dependent unconditional: 32, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2298, independent: 1202, independent conditional: 0, independent unconditional: 1202, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 952, unknown conditional: 0, unknown unconditional: 952] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2055, ((void *)0), P0, ((void *)0))=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2056, ((void *)0), P1, ((void *)0))=1, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2057, ((void *)0), P2, ((void *)0))=2, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 2 return 0; [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L818] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L849] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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: 836]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 134 locations, 6 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: 9.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 268 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 17 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 837 IncrementalHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 17 mSolverCounterUnsat, 6 mSDtfsCounter, 837 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=5, InterpolantAutomatonStates: 59, 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.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 136 ConstructedInterpolants, 0 QuantifiedInterpolants, 937 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-24 05:35:04,740 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...