/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 23:03:12,771 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 23:03:12,836 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-23 23:03:12,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 23:03:12,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 23:03:12,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 23:03:12,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 23:03:12,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 23:03:12,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 23:03:12,867 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 23:03:12,867 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 23:03:12,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 23:03:12,868 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 23:03:12,868 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 23:03:12,869 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 23:03:12,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 23:03:12,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 23:03:12,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 23:03:12,869 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 23:03:12,869 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 23:03:12,869 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 23:03:12,870 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 23:03:12,870 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 23:03:12,871 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 23:03:12,871 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 23:03:12,871 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 23:03:12,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 23:03:12,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:03:12,871 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 23:03:12,871 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 23:03:12,872 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 23:03:12,872 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 23:03:12,872 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 23:03:12,873 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 23:03:12,873 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 23:03:12,873 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 [2023-08-23 23:03:13,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 23:03:13,129 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 23:03:13,132 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 23:03:13,133 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 23:03:13,133 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 23:03:13,134 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-08-23 23:03:14,252 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 23:03:14,588 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 23:03:14,588 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035_power.opt_rmo.opt.i [2023-08-23 23:03:14,603 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9741ce2/c66181d86d9a4d8b97d5d2c14995b5a8/FLAGe904bab08 [2023-08-23 23:03:14,612 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9741ce2/c66181d86d9a4d8b97d5d2c14995b5a8 [2023-08-23 23:03:14,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 23:03:14,614 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 23:03:14,616 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 23:03:14,616 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 23:03:14,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 23:03:14,619 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:03:14" (1/1) ... [2023-08-23 23:03:14,620 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163f3817 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:14, skipping insertion in model container [2023-08-23 23:03:14,620 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 11:03:14" (1/1) ... [2023-08-23 23:03:14,667 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 23:03:14,795 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/mix035_power.opt_rmo.opt.i[1001,1014] [2023-08-23 23:03:14,956 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:03:14,965 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 23:03:14,972 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/mix035_power.opt_rmo.opt.i[1001,1014] [2023-08-23 23:03:14,986 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:03:14,987 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-23 23:03:15,012 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 23:03:15,039 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:03:15,039 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 23:03:15,043 INFO L206 MainTranslator]: Completed translation [2023-08-23 23:03:15,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15 WrapperNode [2023-08-23 23:03:15,044 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 23:03:15,045 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 23:03:15,045 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 23:03:15,045 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 23:03:15,049 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,076 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,102 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2023-08-23 23:03:15,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 23:03:15,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 23:03:15,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 23:03:15,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 23:03:15,109 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,119 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,133 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 23:03:15,138 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 23:03:15,138 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 23:03:15,139 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 23:03:15,139 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (1/1) ... [2023-08-23 23:03:15,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 23:03:15,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 23:03:15,165 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-23 23:03:15,181 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-23 23:03:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 23:03:15,198 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 23:03:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 23:03:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 23:03:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 23:03:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 23:03:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 23:03:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 23:03:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 23:03:15,199 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 23:03:15,199 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 23:03:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 23:03:15,200 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 23:03:15,201 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 23:03:15,201 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 23:03:15,202 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 23:03:15,327 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 23:03:15,328 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 23:03:15,529 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 23:03:15,630 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 23:03:15,630 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 23:03:15,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:03:15 BoogieIcfgContainer [2023-08-23 23:03:15,632 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 23:03:15,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 23:03:15,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 23:03:15,635 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 23:03:15,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 11:03:14" (1/3) ... [2023-08-23 23:03:15,635 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b2401a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:03:15, skipping insertion in model container [2023-08-23 23:03:15,635 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 11:03:15" (2/3) ... [2023-08-23 23:03:15,636 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b2401a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 11:03:15, skipping insertion in model container [2023-08-23 23:03:15,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 11:03:15" (3/3) ... [2023-08-23 23:03:15,636 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035_power.opt_rmo.opt.i [2023-08-23 23:03:15,647 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 23:03:15,647 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 23:03:15,648 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 23:03:15,702 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 23:03:15,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2023-08-23 23:03:15,762 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-08-23 23:03:15,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:03:15,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-08-23 23:03:15,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2023-08-23 23:03:15,770 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2023-08-23 23:03:15,773 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 23:03:15,788 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 117 places, 109 transitions, 227 flow [2023-08-23 23:03:15,791 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 117 places, 109 transitions, 227 flow [2023-08-23 23:03:15,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 117 places, 109 transitions, 227 flow [2023-08-23 23:03:15,811 INFO L124 PetriNetUnfolderBase]: 2/109 cut-off events. [2023-08-23 23:03:15,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:03:15,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2023-08-23 23:03:15,813 INFO L119 LiptonReduction]: Number of co-enabled transitions 1962 [2023-08-23 23:03:18,659 INFO L134 LiptonReduction]: Checked pairs total: 5282 [2023-08-23 23:03:18,659 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-23 23:03:18,668 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 23:03:18,672 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;@55accc16, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 23:03:18,672 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-23 23:03:18,675 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 23:03:18,675 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-23 23:03:18,675 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 23:03:18,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:18,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-23 23:03:18,676 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-23 23:03:18,679 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:18,679 INFO L85 PathProgramCache]: Analyzing trace with hash 453221755, now seen corresponding path program 1 times [2023-08-23 23:03:18,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:18,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104112626] [2023-08-23 23:03:18,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:18,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:18,918 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-23 23:03:18,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:18,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104112626] [2023-08-23 23:03:18,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104112626] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:18,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:18,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 23:03:18,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543908254] [2023-08-23 23:03:18,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:18,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:03:18,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:18,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:03:18,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:03:18,944 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 206 [2023-08-23 23:03:18,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 61 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-23 23:03:18,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:18,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 206 [2023-08-23 23:03:18,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:19,135 INFO L124 PetriNetUnfolderBase]: 999/1560 cut-off events. [2023-08-23 23:03:19,135 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-23 23:03:19,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3095 conditions, 1560 events. 999/1560 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7390 event pairs, 277 based on Foata normal form. 64/1476 useless extension candidates. Maximal degree in co-relation 3084. Up to 1195 conditions per place. [2023-08-23 23:03:19,144 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 29 selfloop transitions, 2 changer transitions 4/38 dead transitions. [2023-08-23 23:03:19,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 158 flow [2023-08-23 23:03:19,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:03:19,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:03:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-23 23:03:19,155 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5420711974110033 [2023-08-23 23:03:19,156 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-23 23:03:19,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-23 23:03:19,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:19,159 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-23 23:03:19,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:03:19,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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-23 23:03:19,166 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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-23 23:03:19,167 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 61 flow. Second operand 3 states and 335 transitions. [2023-08-23 23:03:19,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 158 flow [2023-08-23 23:03:19,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-23 23:03:19,171 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2023-08-23 23:03:19,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2023-08-23 23:03:19,175 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, -2 predicate places. [2023-08-23 23:03:19,175 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2023-08-23 23:03:19,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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-23 23:03:19,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:19,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:19,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 23:03:19,176 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-23 23:03:19,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:19,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1617800900, now seen corresponding path program 1 times [2023-08-23 23:03:19,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:19,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28023144] [2023-08-23 23:03:19,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:19,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:19,329 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-23 23:03:19,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:19,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28023144] [2023-08-23 23:03:19,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28023144] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:19,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:19,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:03:19,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584524545] [2023-08-23 23:03:19,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:19,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:03:19,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:19,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:03:19,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:03:19,332 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 206 [2023-08-23 23:03:19,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 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-23 23:03:19,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:19,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 206 [2023-08-23 23:03:19,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:19,590 INFO L124 PetriNetUnfolderBase]: 1505/2258 cut-off events. [2023-08-23 23:03:19,590 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-08-23 23:03:19,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 2258 events. 1505/2258 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9844 event pairs, 641 based on Foata normal form. 120/2378 useless extension candidates. Maximal degree in co-relation 4704. Up to 1889 conditions per place. [2023-08-23 23:03:19,601 INFO L140 encePairwiseOnDemand]: 200/206 looper letters, 30 selfloop transitions, 4 changer transitions 19/53 dead transitions. [2023-08-23 23:03:19,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 53 transitions, 232 flow [2023-08-23 23:03:19,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:03:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:03:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2023-08-23 23:03:19,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48058252427184467 [2023-08-23 23:03:19,607 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 495 transitions. [2023-08-23 23:03:19,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 495 transitions. [2023-08-23 23:03:19,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:19,607 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 495 transitions. [2023-08-23 23:03:19,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 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-23 23:03:19,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-23 23:03:19,613 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-23 23:03:19,613 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 495 transitions. [2023-08-23 23:03:19,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 53 transitions, 232 flow [2023-08-23 23:03:19,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 53 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 23:03:19,615 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 86 flow [2023-08-23 23:03:19,616 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-08-23 23:03:19,616 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-08-23 23:03:19,617 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 86 flow [2023-08-23 23:03:19,618 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-23 23:03:19,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:19,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:19,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 23:03:19,623 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-23 23:03:19,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:19,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1384361790, now seen corresponding path program 1 times [2023-08-23 23:03:19,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:19,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691107114] [2023-08-23 23:03:19,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:19,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:19,826 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-23 23:03:19,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:19,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691107114] [2023-08-23 23:03:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691107114] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:19,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:19,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:03:19,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691917402] [2023-08-23 23:03:19,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:19,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:03:19,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:19,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:03:19,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:03:19,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 206 [2023-08-23 23:03:19,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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-23 23:03:19,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:19,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 206 [2023-08-23 23:03:19,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:20,078 INFO L124 PetriNetUnfolderBase]: 1329/1994 cut-off events. [2023-08-23 23:03:20,078 INFO L125 PetriNetUnfolderBase]: For 1055/1055 co-relation queries the response was YES. [2023-08-23 23:03:20,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5037 conditions, 1994 events. 1329/1994 cut-off events. For 1055/1055 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8240 event pairs, 371 based on Foata normal form. 96/2090 useless extension candidates. Maximal degree in co-relation 5024. Up to 1301 conditions per place. [2023-08-23 23:03:20,087 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 31 selfloop transitions, 3 changer transitions 20/54 dead transitions. [2023-08-23 23:03:20,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 282 flow [2023-08-23 23:03:20,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:03:20,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:03:20,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 493 transitions. [2023-08-23 23:03:20,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4786407766990291 [2023-08-23 23:03:20,088 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 493 transitions. [2023-08-23 23:03:20,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 493 transitions. [2023-08-23 23:03:20,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:20,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 493 transitions. [2023-08-23 23:03:20,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 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-23 23:03:20,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-23 23:03:20,091 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-23 23:03:20,091 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 86 flow. Second operand 5 states and 493 transitions. [2023-08-23 23:03:20,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 282 flow [2023-08-23 23:03:20,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 54 transitions, 276 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 23:03:20,096 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 95 flow [2023-08-23 23:03:20,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, 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=5, PETRI_FLOW=95, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2023-08-23 23:03:20,096 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-08-23 23:03:20,097 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 95 flow [2023-08-23 23:03:20,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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-23 23:03:20,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:20,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:20,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 23:03:20,097 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-23 23:03:20,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:20,098 INFO L85 PathProgramCache]: Analyzing trace with hash -500729353, now seen corresponding path program 1 times [2023-08-23 23:03:20,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:20,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190533661] [2023-08-23 23:03:20,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:20,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:20,171 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-23 23:03:20,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:20,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190533661] [2023-08-23 23:03:20,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190533661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:20,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:20,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-23 23:03:20,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832679663] [2023-08-23 23:03:20,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:20,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 23:03:20,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:20,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 23:03:20,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 23:03:20,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-08-23 23:03:20,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 95 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-23 23:03:20,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:20,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-08-23 23:03:20,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:20,258 INFO L124 PetriNetUnfolderBase]: 443/756 cut-off events. [2023-08-23 23:03:20,258 INFO L125 PetriNetUnfolderBase]: For 398/409 co-relation queries the response was YES. [2023-08-23 23:03:20,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1925 conditions, 756 events. 443/756 cut-off events. For 398/409 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3282 event pairs, 110 based on Foata normal form. 33/771 useless extension candidates. Maximal degree in co-relation 1909. Up to 590 conditions per place. [2023-08-23 23:03:20,263 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 29 selfloop transitions, 4 changer transitions 0/38 dead transitions. [2023-08-23 23:03:20,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 38 transitions, 195 flow [2023-08-23 23:03:20,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 23:03:20,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 23:03:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 318 transitions. [2023-08-23 23:03:20,264 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145631067961165 [2023-08-23 23:03:20,264 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 318 transitions. [2023-08-23 23:03:20,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 318 transitions. [2023-08-23 23:03:20,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:20,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 318 transitions. [2023-08-23 23:03:20,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 106.0) internal successors, (318), 3 states have internal predecessors, (318), 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-23 23:03:20,266 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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-23 23:03:20,266 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 206.0) internal successors, (824), 4 states have internal predecessors, (824), 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-23 23:03:20,266 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 95 flow. Second operand 3 states and 318 transitions. [2023-08-23 23:03:20,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 38 transitions, 195 flow [2023-08-23 23:03:20,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 38 transitions, 185 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-23 23:03:20,270 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 111 flow [2023-08-23 23:03:20,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=111, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2023-08-23 23:03:20,272 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 1 predicate places. [2023-08-23 23:03:20,272 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 111 flow [2023-08-23 23:03:20,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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-23 23:03:20,272 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:20,272 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:20,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 23:03:20,272 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-23 23:03:20,273 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1735318176, now seen corresponding path program 1 times [2023-08-23 23:03:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:20,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015610973] [2023-08-23 23:03:20,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:20,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:20,420 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-23 23:03:20,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:20,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015610973] [2023-08-23 23:03:20,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015610973] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:20,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:20,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 23:03:20,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175342273] [2023-08-23 23:03:20,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:20,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 23:03:20,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:20,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 23:03:20,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-23 23:03:20,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-08-23 23:03:20,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 111 flow. Second operand has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 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-23 23:03:20,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:20,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-08-23 23:03:20,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:20,564 INFO L124 PetriNetUnfolderBase]: 205/396 cut-off events. [2023-08-23 23:03:20,565 INFO L125 PetriNetUnfolderBase]: For 158/160 co-relation queries the response was YES. [2023-08-23 23:03:20,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1122 conditions, 396 events. 205/396 cut-off events. For 158/160 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1539 event pairs, 60 based on Foata normal form. 35/425 useless extension candidates. Maximal degree in co-relation 1107. Up to 127 conditions per place. [2023-08-23 23:03:20,567 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 37 selfloop transitions, 7 changer transitions 0/49 dead transitions. [2023-08-23 23:03:20,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 49 transitions, 261 flow [2023-08-23 23:03:20,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 23:03:20,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 23:03:20,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2023-08-23 23:03:20,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5145631067961165 [2023-08-23 23:03:20,569 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2023-08-23 23:03:20,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2023-08-23 23:03:20,569 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:20,569 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2023-08-23 23:03:20,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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-23 23:03:20,571 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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-23 23:03:20,572 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 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-23 23:03:20,572 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 111 flow. Second operand 4 states and 424 transitions. [2023-08-23 23:03:20,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 49 transitions, 261 flow [2023-08-23 23:03:20,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 49 transitions, 257 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 23:03:20,575 INFO L231 Difference]: Finished difference. Result has 39 places, 31 transitions, 147 flow [2023-08-23 23:03:20,575 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=39, PETRI_TRANSITIONS=31} [2023-08-23 23:03:20,576 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2023-08-23 23:03:20,576 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 31 transitions, 147 flow [2023-08-23 23:03:20,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 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-23 23:03:20,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:20,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:20,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 23:03:20,577 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-23 23:03:20,577 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:20,577 INFO L85 PathProgramCache]: Analyzing trace with hash -2062726237, now seen corresponding path program 1 times [2023-08-23 23:03:20,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:20,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789243998] [2023-08-23 23:03:20,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:20,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:20,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:20,734 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-23 23:03:20,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:20,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789243998] [2023-08-23 23:03:20,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789243998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:20,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:20,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:03:20,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436874609] [2023-08-23 23:03:20,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:20,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:03:20,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:20,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:03:20,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:03:20,737 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 206 [2023-08-23 23:03:20,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 31 transitions, 147 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-23 23:03:20,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:20,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 206 [2023-08-23 23:03:20,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:20,890 INFO L124 PetriNetUnfolderBase]: 294/569 cut-off events. [2023-08-23 23:03:20,890 INFO L125 PetriNetUnfolderBase]: For 582/592 co-relation queries the response was YES. [2023-08-23 23:03:20,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1771 conditions, 569 events. 294/569 cut-off events. For 582/592 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2500 event pairs, 45 based on Foata normal form. 13/570 useless extension candidates. Maximal degree in co-relation 1754. Up to 326 conditions per place. [2023-08-23 23:03:20,893 INFO L140 encePairwiseOnDemand]: 202/206 looper letters, 53 selfloop transitions, 2 changer transitions 13/72 dead transitions. [2023-08-23 23:03:20,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 72 transitions, 471 flow [2023-08-23 23:03:20,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:03:20,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:03:20,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2023-08-23 23:03:20,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4941747572815534 [2023-08-23 23:03:20,895 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2023-08-23 23:03:20,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2023-08-23 23:03:20,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:20,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2023-08-23 23:03:20,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 23:03:20,898 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-23 23:03:20,898 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-23 23:03:20,898 INFO L175 Difference]: Start difference. First operand has 39 places, 31 transitions, 147 flow. Second operand 5 states and 509 transitions. [2023-08-23 23:03:20,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 72 transitions, 471 flow [2023-08-23 23:03:20,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 72 transitions, 437 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-23 23:03:20,900 INFO L231 Difference]: Finished difference. Result has 44 places, 32 transitions, 148 flow [2023-08-23 23:03:20,901 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=148, PETRI_PLACES=44, PETRI_TRANSITIONS=32} [2023-08-23 23:03:20,901 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 9 predicate places. [2023-08-23 23:03:20,901 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 32 transitions, 148 flow [2023-08-23 23:03:20,902 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-23 23:03:20,902 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:20,902 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:20,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 23:03:20,902 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-23 23:03:20,902 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:20,902 INFO L85 PathProgramCache]: Analyzing trace with hash 258179215, now seen corresponding path program 2 times [2023-08-23 23:03:20,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:20,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965095927] [2023-08-23 23:03:20,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:20,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:21,015 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-23 23:03:21,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:21,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965095927] [2023-08-23 23:03:21,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965095927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:21,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:21,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:03:21,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303358797] [2023-08-23 23:03:21,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:21,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:03:21,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:21,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:03:21,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:03:21,017 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 206 [2023-08-23 23:03:21,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 32 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 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-23 23:03:21,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:21,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 206 [2023-08-23 23:03:21,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:21,093 INFO L124 PetriNetUnfolderBase]: 214/412 cut-off events. [2023-08-23 23:03:21,093 INFO L125 PetriNetUnfolderBase]: For 405/407 co-relation queries the response was YES. [2023-08-23 23:03:21,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1246 conditions, 412 events. 214/412 cut-off events. For 405/407 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1694 event pairs, 66 based on Foata normal form. 19/426 useless extension candidates. Maximal degree in co-relation 1231. Up to 160 conditions per place. [2023-08-23 23:03:21,095 INFO L140 encePairwiseOnDemand]: 201/206 looper letters, 28 selfloop transitions, 10 changer transitions 7/50 dead transitions. [2023-08-23 23:03:21,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 50 transitions, 292 flow [2023-08-23 23:03:21,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 23:03:21,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 23:03:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 519 transitions. [2023-08-23 23:03:21,096 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.503883495145631 [2023-08-23 23:03:21,096 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 519 transitions. [2023-08-23 23:03:21,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 519 transitions. [2023-08-23 23:03:21,097 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:21,097 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 519 transitions. [2023-08-23 23:03:21,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.8) internal successors, (519), 5 states have internal predecessors, (519), 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-23 23:03:21,099 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-23 23:03:21,099 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 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-23 23:03:21,099 INFO L175 Difference]: Start difference. First operand has 44 places, 32 transitions, 148 flow. Second operand 5 states and 519 transitions. [2023-08-23 23:03:21,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 50 transitions, 292 flow [2023-08-23 23:03:21,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 50 transitions, 278 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-23 23:03:21,101 INFO L231 Difference]: Finished difference. Result has 45 places, 30 transitions, 154 flow [2023-08-23 23:03:21,101 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=154, PETRI_PLACES=45, PETRI_TRANSITIONS=30} [2023-08-23 23:03:21,101 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 10 predicate places. [2023-08-23 23:03:21,101 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 30 transitions, 154 flow [2023-08-23 23:03:21,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.2) internal successors, (491), 5 states have internal predecessors, (491), 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-23 23:03:21,102 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:21,102 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:21,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 23:03:21,102 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-23 23:03:21,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash -206311797, now seen corresponding path program 1 times [2023-08-23 23:03:21,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:21,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241543239] [2023-08-23 23:03:21,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:21,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:21,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:21,610 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-23 23:03:21,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:21,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241543239] [2023-08-23 23:03:21,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241543239] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:21,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:21,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 23:03:21,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637386141] [2023-08-23 23:03:21,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:21,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 23:03:21,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:21,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 23:03:21,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-23 23:03:21,612 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 206 [2023-08-23 23:03:21,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 30 transitions, 154 flow. Second operand has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 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-23 23:03:21,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:21,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 206 [2023-08-23 23:03:21,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:21,798 INFO L124 PetriNetUnfolderBase]: 191/396 cut-off events. [2023-08-23 23:03:21,798 INFO L125 PetriNetUnfolderBase]: For 591/597 co-relation queries the response was YES. [2023-08-23 23:03:21,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1352 conditions, 396 events. 191/396 cut-off events. For 591/597 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1687 event pairs, 23 based on Foata normal form. 1/390 useless extension candidates. Maximal degree in co-relation 1333. Up to 126 conditions per place. [2023-08-23 23:03:21,800 INFO L140 encePairwiseOnDemand]: 199/206 looper letters, 52 selfloop transitions, 4 changer transitions 21/82 dead transitions. [2023-08-23 23:03:21,800 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 604 flow [2023-08-23 23:03:21,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 23:03:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 23:03:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 672 transitions. [2023-08-23 23:03:21,801 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46601941747572817 [2023-08-23 23:03:21,801 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 672 transitions. [2023-08-23 23:03:21,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 672 transitions. [2023-08-23 23:03:21,802 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:21,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 672 transitions. [2023-08-23 23:03:21,803 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.0) internal successors, (672), 7 states have internal predecessors, (672), 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-23 23:03:21,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 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-23 23:03:21,805 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 206.0) internal successors, (1648), 8 states have internal predecessors, (1648), 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-23 23:03:21,805 INFO L175 Difference]: Start difference. First operand has 45 places, 30 transitions, 154 flow. Second operand 7 states and 672 transitions. [2023-08-23 23:03:21,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 604 flow [2023-08-23 23:03:21,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 82 transitions, 500 flow, removed 27 selfloop flow, removed 5 redundant places. [2023-08-23 23:03:21,807 INFO L231 Difference]: Finished difference. Result has 49 places, 32 transitions, 146 flow [2023-08-23 23:03:21,807 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=146, PETRI_PLACES=49, PETRI_TRANSITIONS=32} [2023-08-23 23:03:21,808 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 14 predicate places. [2023-08-23 23:03:21,808 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 32 transitions, 146 flow [2023-08-23 23:03:21,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.71428571428571) internal successors, (635), 7 states have internal predecessors, (635), 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-23 23:03:21,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:21,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:21,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 23:03:21,808 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-23 23:03:21,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:21,809 INFO L85 PathProgramCache]: Analyzing trace with hash -743261763, now seen corresponding path program 2 times [2023-08-23 23:03:21,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:21,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240350535] [2023-08-23 23:03:21,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:21,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:21,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 23:03:21,935 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-23 23:03:21,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 23:03:21,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240350535] [2023-08-23 23:03:21,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240350535] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 23:03:21,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 23:03:21,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 23:03:21,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916548911] [2023-08-23 23:03:21,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 23:03:21,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 23:03:21,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 23:03:21,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 23:03:21,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-23 23:03:21,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 206 [2023-08-23 23:03:21,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 32 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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-23 23:03:21,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 23:03:21,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 206 [2023-08-23 23:03:21,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 23:03:22,060 INFO L124 PetriNetUnfolderBase]: 263/532 cut-off events. [2023-08-23 23:03:22,060 INFO L125 PetriNetUnfolderBase]: For 648/648 co-relation queries the response was YES. [2023-08-23 23:03:22,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1860 conditions, 532 events. 263/532 cut-off events. For 648/648 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2325 event pairs, 74 based on Foata normal form. 2/534 useless extension candidates. Maximal degree in co-relation 1842. Up to 262 conditions per place. [2023-08-23 23:03:22,062 INFO L140 encePairwiseOnDemand]: 198/206 looper letters, 39 selfloop transitions, 9 changer transitions 18/66 dead transitions. [2023-08-23 23:03:22,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 66 transitions, 443 flow [2023-08-23 23:03:22,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 23:03:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 23:03:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-08-23 23:03:22,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4563106796116505 [2023-08-23 23:03:22,064 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-08-23 23:03:22,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-08-23 23:03:22,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 23:03:22,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-08-23 23:03:22,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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-23 23:03:22,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 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-23 23:03:22,067 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 206.0) internal successors, (1442), 7 states have internal predecessors, (1442), 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-23 23:03:22,067 INFO L175 Difference]: Start difference. First operand has 49 places, 32 transitions, 146 flow. Second operand 6 states and 564 transitions. [2023-08-23 23:03:22,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 66 transitions, 443 flow [2023-08-23 23:03:22,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 430 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-23 23:03:22,070 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 197 flow [2023-08-23 23:03:22,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=206, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-23 23:03:22,071 INFO L281 CegarLoopForPetriNet]: 35 programPoint places, 16 predicate places. [2023-08-23 23:03:22,071 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 197 flow [2023-08-23 23:03:22,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 90.4) internal successors, (452), 5 states have internal predecessors, (452), 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-23 23:03:22,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 23:03:22,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 23:03:22,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 23:03:22,071 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-23 23:03:22,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 23:03:22,072 INFO L85 PathProgramCache]: Analyzing trace with hash -891145697, now seen corresponding path program 3 times [2023-08-23 23:03:22,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 23:03:22,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141967539] [2023-08-23 23:03:22,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 23:03:22,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 23:03:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:03:22,108 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 23:03:22,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 23:03:22,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 23:03:22,158 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 23:03:22,159 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-23 23:03:22,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-23 23:03:22,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-23 23:03:22,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-23 23:03:22,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-23 23:03:22,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-23 23:03:22,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 23:03:22,160 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2023-08-23 23:03:22,164 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 23:03:22,164 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 23:03:22,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 11:03:22 BasicIcfg [2023-08-23 23:03:22,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 23:03:22,226 INFO L158 Benchmark]: Toolchain (without parser) took 7610.85ms. Allocated memory was 358.6MB in the beginning and 568.3MB in the end (delta: 209.7MB). Free memory was 333.5MB in the beginning and 262.0MB in the end (delta: 71.5MB). Peak memory consumption was 281.0MB. Max. memory is 16.0GB. [2023-08-23 23:03:22,226 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 358.6MB. Free memory is still 335.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 23:03:22,226 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.98ms. Allocated memory is still 358.6MB. Free memory was 333.5MB in the beginning and 310.2MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:22,226 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.43ms. Allocated memory is still 358.6MB. Free memory was 310.2MB in the beginning and 307.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:22,226 INFO L158 Benchmark]: Boogie Preprocessor took 34.93ms. Allocated memory is still 358.6MB. Free memory was 307.6MB in the beginning and 306.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 23:03:22,227 INFO L158 Benchmark]: RCFGBuilder took 493.26ms. Allocated memory is still 358.6MB. Free memory was 306.0MB in the beginning and 328.0MB in the end (delta: -22.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-23 23:03:22,227 INFO L158 Benchmark]: TraceAbstraction took 6591.50ms. Allocated memory was 358.6MB in the beginning and 568.3MB in the end (delta: 209.7MB). Free memory was 326.9MB in the beginning and 262.0MB in the end (delta: 65.0MB). Peak memory consumption was 274.7MB. Max. memory is 16.0GB. [2023-08-23 23:03:22,228 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.11ms. Allocated memory is still 358.6MB. Free memory is still 335.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 427.98ms. Allocated memory is still 358.6MB. Free memory was 333.5MB in the beginning and 310.2MB in the end (delta: 23.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 57.43ms. Allocated memory is still 358.6MB. Free memory was 310.2MB in the beginning and 307.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 34.93ms. Allocated memory is still 358.6MB. Free memory was 307.6MB in the beginning and 306.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 493.26ms. Allocated memory is still 358.6MB. Free memory was 306.0MB in the beginning and 328.0MB in the end (delta: -22.0MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 6591.50ms. Allocated memory was 358.6MB in the beginning and 568.3MB in the end (delta: 209.7MB). Free memory was 326.9MB in the beginning and 262.0MB in the end (delta: 65.0MB). Peak memory consumption was 274.7MB. 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: 2.9s, 117 PlacesBefore, 35 PlacesAfterwards, 109 TransitionsBefore, 26 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 94 TotalNumberOfCompositions, 5282 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2259, independent: 2072, independent conditional: 0, independent unconditional: 2072, dependent: 187, dependent conditional: 0, dependent unconditional: 187, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1044, independent: 1011, independent conditional: 0, independent unconditional: 1011, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2259, independent: 1061, independent conditional: 0, independent unconditional: 1061, dependent: 154, dependent conditional: 0, dependent unconditional: 154, unknown: 1044, unknown conditional: 0, unknown unconditional: 1044] , Statistics on independence cache: Total cache size (in pairs): 80, Positive cache size: 65, Positive conditional cache size: 0, Positive unconditional cache size: 65, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff1_thd0; [L732] 0 _Bool x$r_buff1_thd1; [L733] 0 _Bool x$r_buff1_thd2; [L734] 0 _Bool x$r_buff1_thd3; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L841] 0 pthread_t t916; [L842] FCALL, FORK 0 pthread_create(&t916, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t916, ((void *)0), P0, ((void *)0))=-3, t916={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] [L843] 0 pthread_t t917; [L844] FCALL, FORK 0 pthread_create(&t917, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t917, ((void *)0), P1, ((void *)0))=-2, t916={5:0}, t917={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] [L845] 0 pthread_t t918; [L778] 2 x$w_buff1 = x$w_buff0 [L779] 2 x$w_buff0 = 1 [L780] 2 x$w_buff1_used = x$w_buff0_used [L781] 2 x$w_buff0_used = (_Bool)1 [L782] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L782] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L783] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L784] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L785] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L786] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L787] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L846] FCALL, FORK 0 pthread_create(&t918, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t918, ((void *)0), P2, ((void *)0))=-1, t916={5:0}, t917={6:0}, t918={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=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] [L790] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L807] 3 y = 1 [L810] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=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] [L813] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L816] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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] [L753] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 1 x$flush_delayed = weak$$choice2 [L756] 1 x$mem_tmp = x [L757] 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) [L758] 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)) [L759] 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)) [L760] 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)) [L761] 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)) [L762] 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)) [L763] 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)) [L764] 1 __unbuffered_p0_EAX = x [L765] 1 x = x$flush_delayed ? x$mem_tmp : x [L766] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L793] 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) [L794] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L797] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L819] 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) [L820] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L821] 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 [L822] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L823] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L800] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L802] 2 return 0; [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L850] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=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=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L850] RET 0 assume_abort_if_not(main$tmp_guard0) [L852] 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) [L853] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L854] 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 [L855] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L856] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t916={5:0}, t917={6:0}, t918={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_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] [L859] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L861] 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=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=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=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: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 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: 6.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 176 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 176 mSDsluCounter, 30 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 781 IncrementalHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 16 mSDtfsCounter, 781 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=197occurred in iteration=9, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 156 NumberOfCodeBlocks, 156 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 874 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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-23 23:03:22,246 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...