/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:31:34,484 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:31:34,560 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:31:34,566 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:31:34,566 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:31:34,595 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:31:34,595 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:31:34,596 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:31:34,596 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:31:34,600 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:31:34,600 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:31:34,600 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:31:34,601 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:31:34,602 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:31:34,602 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:31:34,602 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:31:34,602 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:31:34,602 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:31:34,603 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:31:34,603 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:31:34,603 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:31:34,604 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:31:34,604 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:31:34,605 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:31:34,605 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:31:34,605 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:31:34,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:31:34,606 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:31:34,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:31:34,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:31:34,607 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:31:34,607 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:31:34,608 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:31:34,608 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:31:34,608 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:31:34,608 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:31:34,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:31:34,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:31:34,948 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:31:34,949 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:31:34,949 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:31:34,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-24 05:31:36,061 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:31:36,357 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:31:36,357 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-24 05:31:36,378 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ac8dd0d/4813143a1d5a46588e77c21062a0af85/FLAG47e4dcc71 [2023-08-24 05:31:36,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32ac8dd0d/4813143a1d5a46588e77c21062a0af85 [2023-08-24 05:31:36,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:31:36,393 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:31:36,394 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:31:36,394 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:31:36,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:31:36,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:36,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7780f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36, skipping insertion in model container [2023-08-24 05:31:36,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:36,464 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:31:36,627 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2023-08-24 05:31:36,834 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:31:36,844 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:31:36,856 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/mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i[973,986] [2023-08-24 05:31:36,873 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:31:36,875 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:31:36,910 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:31:36,946 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:31:36,947 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:31:36,953 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:31:36,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36 WrapperNode [2023-08-24 05:31:36,953 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:31:36,954 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:31:36,954 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:31:36,954 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:31:36,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:36,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,025 INFO L138 Inliner]: procedures = 175, calls = 41, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2023-08-24 05:31:37,026 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:31:37,027 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:31:37,027 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:31:37,027 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:31:37,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,052 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,053 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,058 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,060 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:31:37,081 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:31:37,081 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:31:37,081 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:31:37,082 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (1/1) ... [2023-08-24 05:31:37,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:31:37,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:31:37,109 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:31:37,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:31:37,138 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:31:37,139 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:31:37,139 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:31:37,140 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:31:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:31:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:31:37,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:31:37,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:31:37,142 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:31:37,249 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:31:37,251 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:31:37,526 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:31:37,675 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:31:37,675 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:31:37,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:31:37 BoogieIcfgContainer [2023-08-24 05:31:37,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:31:37,680 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:31:37,680 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:31:37,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:31:37,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:31:36" (1/3) ... [2023-08-24 05:31:37,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e4233a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:31:37, skipping insertion in model container [2023-08-24 05:31:37,684 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:31:36" (2/3) ... [2023-08-24 05:31:37,684 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e4233a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:31:37, skipping insertion in model container [2023-08-24 05:31:37,685 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:31:37" (3/3) ... [2023-08-24 05:31:37,686 INFO L112 eAbstractionObserver]: Analyzing ICFG mix054_pso.opt_rmo.opt_tso.oepc_tso.opt.i [2023-08-24 05:31:37,698 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:31:37,698 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:31:37,699 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:31:37,733 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:31:37,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 87 transitions, 184 flow [2023-08-24 05:31:37,792 INFO L124 PetriNetUnfolderBase]: 2/85 cut-off events. [2023-08-24 05:31:37,792 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:31:37,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-24 05:31:37,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 87 transitions, 184 flow [2023-08-24 05:31:37,799 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 85 transitions, 176 flow [2023-08-24 05:31:37,802 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:31:37,809 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 176 flow [2023-08-24 05:31:37,811 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 176 flow [2023-08-24 05:31:37,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 176 flow [2023-08-24 05:31:37,829 INFO L124 PetriNetUnfolderBase]: 2/85 cut-off events. [2023-08-24 05:31:37,829 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:31:37,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 92 conditions, 85 events. 2/85 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 51. Up to 2 conditions per place. [2023-08-24 05:31:37,831 INFO L119 LiptonReduction]: Number of co-enabled transitions 1020 [2023-08-24 05:31:40,715 INFO L134 LiptonReduction]: Checked pairs total: 2481 [2023-08-24 05:31:40,715 INFO L136 LiptonReduction]: Total number of compositions: 76 [2023-08-24 05:31:40,727 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:31:40,732 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;@73f993e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:31:40,732 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 05:31:40,736 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:31:40,736 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-24 05:31:40,736 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:31:40,736 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:40,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-24 05:31:40,737 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:40,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:40,741 INFO L85 PathProgramCache]: Analyzing trace with hash 380399145, now seen corresponding path program 1 times [2023-08-24 05:31:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:40,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756204261] [2023-08-24 05:31:40,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:41,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:31:41,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:41,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756204261] [2023-08-24 05:31:41,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756204261] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:41,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:41,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:31:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225050168] [2023-08-24 05:31:41,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:41,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:31:41,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:41,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:31:41,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:31:41,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 163 [2023-08-24 05:31:41,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 20 transitions, 46 flow. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:41,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:41,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 163 [2023-08-24 05:31:41,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:41,263 INFO L124 PetriNetUnfolderBase]: 159/309 cut-off events. [2023-08-24 05:31:41,264 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-24 05:31:41,266 INFO L83 FinitePrefix]: Finished finitePrefix Result has 603 conditions, 309 events. 159/309 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1350 event pairs, 24 based on Foata normal form. 16/292 useless extension candidates. Maximal degree in co-relation 593. Up to 220 conditions per place. [2023-08-24 05:31:41,269 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 19 selfloop transitions, 2 changer transitions 4/27 dead transitions. [2023-08-24 05:31:41,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 27 transitions, 110 flow [2023-08-24 05:31:41,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:31:41,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:31:41,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 253 transitions. [2023-08-24 05:31:41,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5173824130879345 [2023-08-24 05:31:41,286 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 253 transitions. [2023-08-24 05:31:41,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 253 transitions. [2023-08-24 05:31:41,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:41,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 253 transitions. [2023-08-24 05:31:41,294 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:41,297 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:41,297 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:41,299 INFO L175 Difference]: Start difference. First operand has 26 places, 20 transitions, 46 flow. Second operand 3 states and 253 transitions. [2023-08-24 05:31:41,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 27 transitions, 110 flow [2023-08-24 05:31:41,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 27 transitions, 108 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:31:41,302 INFO L231 Difference]: Finished difference. Result has 25 places, 16 transitions, 40 flow [2023-08-24 05:31:41,304 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=25, PETRI_TRANSITIONS=16} [2023-08-24 05:31:41,308 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -1 predicate places. [2023-08-24 05:31:41,309 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 16 transitions, 40 flow [2023-08-24 05:31:41,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:41,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:41,309 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:41,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:31:41,310 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:41,311 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:41,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1946213016, now seen corresponding path program 1 times [2023-08-24 05:31:41,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:41,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078006107] [2023-08-24 05:31:41,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:41,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:41,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:42,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:31:42,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:42,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078006107] [2023-08-24 05:31:42,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078006107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:42,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:42,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:31:42,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235010189] [2023-08-24 05:31:42,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:42,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:31:42,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:42,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:31:42,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:31:42,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 163 [2023-08-24 05:31:42,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 16 transitions, 40 flow. Second operand has 6 states, 6 states have (on average 59.333333333333336) internal successors, (356), 6 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:42,040 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 163 [2023-08-24 05:31:42,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:42,248 INFO L124 PetriNetUnfolderBase]: 168/305 cut-off events. [2023-08-24 05:31:42,248 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-24 05:31:42,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 640 conditions, 305 events. 168/305 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1051 event pairs, 66 based on Foata normal form. 17/322 useless extension candidates. Maximal degree in co-relation 630. Up to 247 conditions per place. [2023-08-24 05:31:42,254 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 21 selfloop transitions, 4 changer transitions 9/34 dead transitions. [2023-08-24 05:31:42,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 34 transitions, 150 flow [2023-08-24 05:31:42,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:31:42,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:31:42,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 385 transitions. [2023-08-24 05:31:42,261 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3936605316973415 [2023-08-24 05:31:42,261 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 385 transitions. [2023-08-24 05:31:42,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 385 transitions. [2023-08-24 05:31:42,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:42,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 385 transitions. [2023-08-24 05:31:42,264 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,269 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,270 INFO L175 Difference]: Start difference. First operand has 25 places, 16 transitions, 40 flow. Second operand 6 states and 385 transitions. [2023-08-24 05:31:42,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 34 transitions, 150 flow [2023-08-24 05:31:42,270 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 34 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:31:42,271 INFO L231 Difference]: Finished difference. Result has 30 places, 18 transitions, 63 flow [2023-08-24 05:31:42,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=36, PETRI_DIFFERENCE_MINUEND_PLACES=21, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=63, PETRI_PLACES=30, PETRI_TRANSITIONS=18} [2023-08-24 05:31:42,272 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2023-08-24 05:31:42,272 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 18 transitions, 63 flow [2023-08-24 05:31:42,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 59.333333333333336) internal successors, (356), 6 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:42,273 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:42,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:31:42,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:42,274 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:42,274 INFO L85 PathProgramCache]: Analyzing trace with hash -239326656, now seen corresponding path program 1 times [2023-08-24 05:31:42,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:42,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718251072] [2023-08-24 05:31:42,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:42,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:31:42,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:42,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718251072] [2023-08-24 05:31:42,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718251072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:42,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:42,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:31:42,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906588820] [2023-08-24 05:31:42,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:42,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:31:42,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:42,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:31:42,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:31:42,769 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 163 [2023-08-24 05:31:42,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 18 transitions, 63 flow. Second operand has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:42,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 163 [2023-08-24 05:31:42,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:42,911 INFO L124 PetriNetUnfolderBase]: 119/235 cut-off events. [2023-08-24 05:31:42,911 INFO L125 PetriNetUnfolderBase]: For 105/105 co-relation queries the response was YES. [2023-08-24 05:31:42,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 235 events. 119/235 cut-off events. For 105/105 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 855 event pairs, 73 based on Foata normal form. 15/248 useless extension candidates. Maximal degree in co-relation 571. Up to 186 conditions per place. [2023-08-24 05:31:42,914 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 20 selfloop transitions, 5 changer transitions 10/36 dead transitions. [2023-08-24 05:31:42,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 181 flow [2023-08-24 05:31:42,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:31:42,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:31:42,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2023-08-24 05:31:42,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43660531697341515 [2023-08-24 05:31:42,917 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 427 transitions. [2023-08-24 05:31:42,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 427 transitions. [2023-08-24 05:31:42,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:42,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 427 transitions. [2023-08-24 05:31:42,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,920 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,920 INFO L175 Difference]: Start difference. First operand has 30 places, 18 transitions, 63 flow. Second operand 6 states and 427 transitions. [2023-08-24 05:31:42,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 181 flow [2023-08-24 05:31:42,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 36 transitions, 174 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-24 05:31:42,924 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 89 flow [2023-08-24 05:31:42,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=89, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-08-24 05:31:42,925 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 7 predicate places. [2023-08-24 05:31:42,928 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 89 flow [2023-08-24 05:31:42,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.5) internal successors, (399), 6 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:42,928 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:42,928 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:42,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:31:42,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:42,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:42,930 INFO L85 PathProgramCache]: Analyzing trace with hash 6784765, now seen corresponding path program 1 times [2023-08-24 05:31:42,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:42,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014837244] [2023-08-24 05:31:42,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:42,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:43,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:31:43,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:43,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014837244] [2023-08-24 05:31:43,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014837244] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:43,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:43,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:31:43,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712966418] [2023-08-24 05:31:43,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:43,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:31:43,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:43,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:31:43,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:31:43,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 163 [2023-08-24 05:31:43,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 89 flow. Second operand has 8 states, 8 states have (on average 62.375) internal successors, (499), 8 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:43,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:43,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 163 [2023-08-24 05:31:43,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:43,514 INFO L124 PetriNetUnfolderBase]: 111/219 cut-off events. [2023-08-24 05:31:43,514 INFO L125 PetriNetUnfolderBase]: For 191/191 co-relation queries the response was YES. [2023-08-24 05:31:43,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 219 events. 111/219 cut-off events. For 191/191 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 784 event pairs, 42 based on Foata normal form. 11/227 useless extension candidates. Maximal degree in co-relation 619. Up to 178 conditions per place. [2023-08-24 05:31:43,515 INFO L140 encePairwiseOnDemand]: 154/163 looper letters, 23 selfloop transitions, 9 changer transitions 7/40 dead transitions. [2023-08-24 05:31:43,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 40 transitions, 233 flow [2023-08-24 05:31:43,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:31:43,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:31:43,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 467 transitions. [2023-08-24 05:31:43,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4092900964066608 [2023-08-24 05:31:43,518 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 467 transitions. [2023-08-24 05:31:43,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 467 transitions. [2023-08-24 05:31:43,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:43,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 467 transitions. [2023-08-24 05:31:43,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 66.71428571428571) internal successors, (467), 7 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:43,522 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:43,522 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 163.0) internal successors, (1304), 8 states have internal predecessors, (1304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:43,522 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 89 flow. Second operand 7 states and 467 transitions. [2023-08-24 05:31:43,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 40 transitions, 233 flow [2023-08-24 05:31:43,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 40 transitions, 224 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-24 05:31:43,525 INFO L231 Difference]: Finished difference. Result has 39 places, 26 transitions, 150 flow [2023-08-24 05:31:43,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=150, PETRI_PLACES=39, PETRI_TRANSITIONS=26} [2023-08-24 05:31:43,526 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 13 predicate places. [2023-08-24 05:31:43,526 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 26 transitions, 150 flow [2023-08-24 05:31:43,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 62.375) internal successors, (499), 8 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:43,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:43,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:43,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:31:43,527 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:43,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:43,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1064961085, now seen corresponding path program 2 times [2023-08-24 05:31:43,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:43,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134192484] [2023-08-24 05:31:43,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:31:44,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:44,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134192484] [2023-08-24 05:31:44,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134192484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:44,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:44,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:31:44,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228444537] [2023-08-24 05:31:44,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:44,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:31:44,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:44,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:31:44,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:31:44,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 163 [2023-08-24 05:31:44,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 26 transitions, 150 flow. Second operand has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:44,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 163 [2023-08-24 05:31:44,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:44,593 INFO L124 PetriNetUnfolderBase]: 157/293 cut-off events. [2023-08-24 05:31:44,593 INFO L125 PetriNetUnfolderBase]: For 535/535 co-relation queries the response was YES. [2023-08-24 05:31:44,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1025 conditions, 293 events. 157/293 cut-off events. For 535/535 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1039 event pairs, 34 based on Foata normal form. 14/307 useless extension candidates. Maximal degree in co-relation 1005. Up to 197 conditions per place. [2023-08-24 05:31:44,596 INFO L140 encePairwiseOnDemand]: 155/163 looper letters, 31 selfloop transitions, 13 changer transitions 10/54 dead transitions. [2023-08-24 05:31:44,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 54 transitions, 385 flow [2023-08-24 05:31:44,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:31:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:31:44,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 608 transitions. [2023-08-24 05:31:44,598 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41445126107702795 [2023-08-24 05:31:44,599 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 608 transitions. [2023-08-24 05:31:44,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 608 transitions. [2023-08-24 05:31:44,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:44,600 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 608 transitions. [2023-08-24 05:31:44,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 67.55555555555556) internal successors, (608), 9 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,603 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 163.0) internal successors, (1630), 10 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,604 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 163.0) internal successors, (1630), 10 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,604 INFO L175 Difference]: Start difference. First operand has 39 places, 26 transitions, 150 flow. Second operand 9 states and 608 transitions. [2023-08-24 05:31:44,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 54 transitions, 385 flow [2023-08-24 05:31:44,611 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 54 transitions, 365 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-24 05:31:44,612 INFO L231 Difference]: Finished difference. Result has 47 places, 31 transitions, 219 flow [2023-08-24 05:31:44,612 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=219, PETRI_PLACES=47, PETRI_TRANSITIONS=31} [2023-08-24 05:31:44,614 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 21 predicate places. [2023-08-24 05:31:44,614 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 31 transitions, 219 flow [2023-08-24 05:31:44,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.57142857142857) internal successors, (445), 7 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:44,615 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:44,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:31:44,615 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:44,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:44,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1933594913, now seen corresponding path program 1 times [2023-08-24 05:31:44,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:44,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336188892] [2023-08-24 05:31:44,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:44,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:44,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:31:44,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:44,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336188892] [2023-08-24 05:31:44,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336188892] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:44,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:44,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:31:44,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092275027] [2023-08-24 05:31:44,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:44,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:31:44,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:44,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:31:44,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:31:44,784 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 163 [2023-08-24 05:31:44,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 31 transitions, 219 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:44,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 163 [2023-08-24 05:31:44,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:44,835 INFO L124 PetriNetUnfolderBase]: 50/121 cut-off events. [2023-08-24 05:31:44,835 INFO L125 PetriNetUnfolderBase]: For 414/417 co-relation queries the response was YES. [2023-08-24 05:31:44,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 121 events. 50/121 cut-off events. For 414/417 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 363 event pairs, 18 based on Foata normal form. 13/133 useless extension candidates. Maximal degree in co-relation 485. Up to 77 conditions per place. [2023-08-24 05:31:44,836 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 29 selfloop transitions, 4 changer transitions 0/39 dead transitions. [2023-08-24 05:31:44,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 326 flow [2023-08-24 05:31:44,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:31:44,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:31:44,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2023-08-24 05:31:44,838 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4887525562372188 [2023-08-24 05:31:44,838 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 239 transitions. [2023-08-24 05:31:44,839 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 239 transitions. [2023-08-24 05:31:44,839 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:44,839 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 239 transitions. [2023-08-24 05:31:44,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,841 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,841 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 163.0) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,841 INFO L175 Difference]: Start difference. First operand has 47 places, 31 transitions, 219 flow. Second operand 3 states and 239 transitions. [2023-08-24 05:31:44,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 326 flow [2023-08-24 05:31:44,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 39 transitions, 303 flow, removed 7 selfloop flow, removed 4 redundant places. [2023-08-24 05:31:44,845 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 222 flow [2023-08-24 05:31:44,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=222, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-24 05:31:44,847 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 18 predicate places. [2023-08-24 05:31:44,847 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 222 flow [2023-08-24 05:31:44,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:44,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:44,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:44,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:31:44,848 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:44,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:44,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1771465290, now seen corresponding path program 1 times [2023-08-24 05:31:44,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:44,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916144405] [2023-08-24 05:31:44,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:44,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:45,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:31:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:45,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916144405] [2023-08-24 05:31:45,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916144405] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:45,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:45,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:31:45,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376489613] [2023-08-24 05:31:45,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:45,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:31:45,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:45,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:31:45,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:31:45,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 163 [2023-08-24 05:31:45,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 222 flow. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:45,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 163 [2023-08-24 05:31:45,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:45,050 INFO L124 PetriNetUnfolderBase]: 22/63 cut-off events. [2023-08-24 05:31:45,050 INFO L125 PetriNetUnfolderBase]: For 175/176 co-relation queries the response was YES. [2023-08-24 05:31:45,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 272 conditions, 63 events. 22/63 cut-off events. For 175/176 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 151 event pairs, 6 based on Foata normal form. 9/71 useless extension candidates. Maximal degree in co-relation 248. Up to 31 conditions per place. [2023-08-24 05:31:45,051 INFO L140 encePairwiseOnDemand]: 159/163 looper letters, 27 selfloop transitions, 6 changer transitions 0/39 dead transitions. [2023-08-24 05:31:45,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 39 transitions, 321 flow [2023-08-24 05:31:45,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:31:45,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:31:45,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 311 transitions. [2023-08-24 05:31:45,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47699386503067487 [2023-08-24 05:31:45,054 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 311 transitions. [2023-08-24 05:31:45,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 311 transitions. [2023-08-24 05:31:45,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:45,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 311 transitions. [2023-08-24 05:31:45,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 77.75) internal successors, (311), 4 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,056 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 163.0) internal successors, (815), 5 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,057 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 222 flow. Second operand 4 states and 311 transitions. [2023-08-24 05:31:45,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 39 transitions, 321 flow [2023-08-24 05:31:45,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 39 transitions, 276 flow, removed 17 selfloop flow, removed 5 redundant places. [2023-08-24 05:31:45,060 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 202 flow [2023-08-24 05:31:45,060 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-24 05:31:45,064 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 17 predicate places. [2023-08-24 05:31:45,064 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 202 flow [2023-08-24 05:31:45,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:45,070 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:45,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:31:45,070 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:45,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1524379963, now seen corresponding path program 1 times [2023-08-24 05:31:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:45,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764817665] [2023-08-24 05:31:45,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:45,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:45,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:31:45,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:45,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764817665] [2023-08-24 05:31:45,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764817665] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:45,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:45,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-24 05:31:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092879182] [2023-08-24 05:31:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:45,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-24 05:31:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:45,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-24 05:31:45,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-24 05:31:45,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 163 [2023-08-24 05:31:45,549 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 60.77777777777778) internal successors, (547), 9 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:45,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 163 [2023-08-24 05:31:45,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:45,806 INFO L124 PetriNetUnfolderBase]: 33/94 cut-off events. [2023-08-24 05:31:45,806 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2023-08-24 05:31:45,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 94 events. 33/94 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 268 event pairs, 1 based on Foata normal form. 1/95 useless extension candidates. Maximal degree in co-relation 367. Up to 36 conditions per place. [2023-08-24 05:31:45,807 INFO L140 encePairwiseOnDemand]: 156/163 looper letters, 21 selfloop transitions, 3 changer transitions 32/56 dead transitions. [2023-08-24 05:31:45,807 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 56 transitions, 441 flow [2023-08-24 05:31:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 05:31:45,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 05:31:45,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 510 transitions. [2023-08-24 05:31:45,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3911042944785276 [2023-08-24 05:31:45,811 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 510 transitions. [2023-08-24 05:31:45,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 510 transitions. [2023-08-24 05:31:45,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:45,811 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 510 transitions. [2023-08-24 05:31:45,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 63.75) internal successors, (510), 8 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,814 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 163.0) internal successors, (1467), 9 states have internal predecessors, (1467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,815 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 202 flow. Second operand 8 states and 510 transitions. [2023-08-24 05:31:45,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 56 transitions, 441 flow [2023-08-24 05:31:45,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 421 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 05:31:45,817 INFO L231 Difference]: Finished difference. Result has 51 places, 22 transitions, 130 flow [2023-08-24 05:31:45,817 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=130, PETRI_PLACES=51, PETRI_TRANSITIONS=22} [2023-08-24 05:31:45,817 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 25 predicate places. [2023-08-24 05:31:45,818 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 22 transitions, 130 flow [2023-08-24 05:31:45,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 60.77777777777778) internal successors, (547), 9 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:45,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:45,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:45,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:31:45,818 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:45,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1742887647, now seen corresponding path program 2 times [2023-08-24 05:31:45,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:45,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421423660] [2023-08-24 05:31:45,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:45,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:31:46,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:31:46,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:31:46,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421423660] [2023-08-24 05:31:46,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421423660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:31:46,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:31:46,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-24 05:31:46,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022076495] [2023-08-24 05:31:46,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:31:46,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-24 05:31:46,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:31:46,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-24 05:31:46,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-08-24 05:31:46,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 163 [2023-08-24 05:31:46,466 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 22 transitions, 130 flow. Second operand has 8 states, 8 states have (on average 62.0) internal successors, (496), 8 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:46,466 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:31:46,466 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 163 [2023-08-24 05:31:46,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:31:46,585 INFO L124 PetriNetUnfolderBase]: 9/43 cut-off events. [2023-08-24 05:31:46,585 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2023-08-24 05:31:46,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 43 events. 9/43 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 69 event pairs, 3 based on Foata normal form. 1/44 useless extension candidates. Maximal degree in co-relation 166. Up to 22 conditions per place. [2023-08-24 05:31:46,586 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 16 selfloop transitions, 5 changer transitions 9/30 dead transitions. [2023-08-24 05:31:46,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 30 transitions, 231 flow [2023-08-24 05:31:46,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:31:46,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:31:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 385 transitions. [2023-08-24 05:31:46,587 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3936605316973415 [2023-08-24 05:31:46,588 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 385 transitions. [2023-08-24 05:31:46,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 385 transitions. [2023-08-24 05:31:46,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:31:46,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 385 transitions. [2023-08-24 05:31:46,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 64.16666666666667) internal successors, (385), 6 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:46,590 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:46,591 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 163.0) internal successors, (1141), 7 states have internal predecessors, (1141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:46,591 INFO L175 Difference]: Start difference. First operand has 51 places, 22 transitions, 130 flow. Second operand 6 states and 385 transitions. [2023-08-24 05:31:46,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 30 transitions, 231 flow [2023-08-24 05:31:46,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 30 transitions, 201 flow, removed 8 selfloop flow, removed 10 redundant places. [2023-08-24 05:31:46,592 INFO L231 Difference]: Finished difference. Result has 41 places, 20 transitions, 110 flow [2023-08-24 05:31:46,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=110, PETRI_PLACES=41, PETRI_TRANSITIONS=20} [2023-08-24 05:31:46,593 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 15 predicate places. [2023-08-24 05:31:46,593 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 20 transitions, 110 flow [2023-08-24 05:31:46,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 62.0) internal successors, (496), 8 states have internal predecessors, (496), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:31:46,593 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:31:46,593 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:31:46,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:31:46,594 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 05:31:46,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:31:46,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1635844257, now seen corresponding path program 3 times [2023-08-24 05:31:46,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:31:46,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071003383] [2023-08-24 05:31:46,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:31:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:31:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:31:46,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:31:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:31:46,664 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:31:46,664 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:31:46,665 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 05:31:46,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-24 05:31:46,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 05:31:46,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 05:31:46,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-24 05:31:46,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:31:46,668 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1] [2023-08-24 05:31:46,672 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:31:46,672 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:31:46,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:31:46 BasicIcfg [2023-08-24 05:31:46,719 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:31:46,719 INFO L158 Benchmark]: Toolchain (without parser) took 10326.63ms. Allocated memory was 392.2MB in the beginning and 616.6MB in the end (delta: 224.4MB). Free memory was 366.9MB in the beginning and 385.5MB in the end (delta: -18.6MB). Peak memory consumption was 207.4MB. Max. memory is 16.0GB. [2023-08-24 05:31:46,720 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 392.2MB. Free memory is still 368.8MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:31:46,720 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.64ms. Allocated memory is still 392.2MB. Free memory was 366.9MB in the beginning and 344.1MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:31:46,720 INFO L158 Benchmark]: Boogie Procedure Inliner took 71.87ms. Allocated memory is still 392.2MB. Free memory was 344.1MB in the beginning and 341.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:31:46,720 INFO L158 Benchmark]: Boogie Preprocessor took 53.49ms. Allocated memory is still 392.2MB. Free memory was 341.4MB in the beginning and 339.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:31:46,720 INFO L158 Benchmark]: RCFGBuilder took 596.26ms. Allocated memory is still 392.2MB. Free memory was 339.6MB in the beginning and 355.5MB in the end (delta: -15.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. [2023-08-24 05:31:46,721 INFO L158 Benchmark]: TraceAbstraction took 9039.36ms. Allocated memory was 392.2MB in the beginning and 616.6MB in the end (delta: 224.4MB). Free memory was 355.0MB in the beginning and 385.5MB in the end (delta: -30.5MB). Peak memory consumption was 194.9MB. Max. memory is 16.0GB. [2023-08-24 05:31:46,722 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.13ms. Allocated memory is still 392.2MB. Free memory is still 368.8MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 559.64ms. Allocated memory is still 392.2MB. Free memory was 366.9MB in the beginning and 344.1MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 71.87ms. Allocated memory is still 392.2MB. Free memory was 344.1MB in the beginning and 341.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 53.49ms. Allocated memory is still 392.2MB. Free memory was 341.4MB in the beginning and 339.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 596.26ms. Allocated memory is still 392.2MB. Free memory was 339.6MB in the beginning and 355.5MB in the end (delta: -15.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. * TraceAbstraction took 9039.36ms. Allocated memory was 392.2MB in the beginning and 616.6MB in the end (delta: 224.4MB). Free memory was 355.0MB in the beginning and 385.5MB in the end (delta: -30.5MB). Peak memory consumption was 194.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 90 PlacesBefore, 26 PlacesAfterwards, 85 TransitionsBefore, 20 TransitionsAfterwards, 1020 CoEnabledTransitionPairs, 6 FixpointIterations, 34 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 76 TotalNumberOfCompositions, 2481 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1053, independent: 933, independent conditional: 0, independent unconditional: 933, dependent: 120, dependent conditional: 0, dependent unconditional: 120, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 556, independent: 535, independent conditional: 0, independent unconditional: 535, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1053, independent: 398, independent conditional: 0, independent unconditional: 398, dependent: 99, dependent conditional: 0, dependent unconditional: 99, unknown: 556, unknown conditional: 0, unknown unconditional: 556] , Statistics on independence cache: Total cache size (in pairs): 37, Positive cache size: 27, Positive conditional cache size: 0, Positive unconditional cache size: 27, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p1_EAX = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff1_thd0; [L721] 0 _Bool x$r_buff1_thd1; [L722] 0 _Bool x$r_buff1_thd2; [L723] 0 _Bool x$read_delayed; [L724] 0 int *x$read_delayed_var; [L725] 0 int x$w_buff0; [L726] 0 _Bool x$w_buff0_used; [L727] 0 int x$w_buff1; [L728] 0 _Bool x$w_buff1_used; [L730] 0 int y = 0; [L731] 0 _Bool weak$$choice0; [L732] 0 _Bool weak$$choice2; [L792] 0 pthread_t t1447; [L793] FCALL, FORK 0 pthread_create(&t1447, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1447, ((void *)0), P0, ((void *)0))=-2, t1447={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L794] 0 pthread_t t1448; [L795] FCALL, FORK 0 pthread_create(&t1448, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1448, ((void *)0), P1, ((void *)0))=-1, t1447={5:0}, t1448={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=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] [L756] 2 x$w_buff1 = x$w_buff0 [L757] 2 x$w_buff0 = 2 [L758] 2 x$w_buff1_used = x$w_buff0_used [L759] 2 x$w_buff0_used = (_Bool)1 [L760] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L760] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L761] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L762] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L763] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L764] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L767] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L736] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L770] 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) [L771] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L772] 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 [L773] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L774] 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_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L742] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L743] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L744] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L745] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L746] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L751] 1 return 0; [L797] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L799] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, 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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L799] RET 0 assume_abort_if_not(main$tmp_guard0) [L801] 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) [L802] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L803] 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 [L804] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L805] 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}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1447={5:0}, t1448={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_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] [L808] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L809] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L810] 0 x$flush_delayed = weak$$choice2 [L811] 0 x$mem_tmp = x [L812] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L813] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L814] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L815] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L816] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L817] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L818] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L819] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) [L820] 0 x = x$flush_delayed ? x$mem_tmp : x [L821] 0 x$flush_delayed = (_Bool)0 [L823] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1] - UnprovableResult [Line: 18]: 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: 793]: 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: 795]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 105 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 8.9s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 135 mSDsluCounter, 46 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 30 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 713 IncrementalHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 16 mSDtfsCounter, 713 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 115 NumberOfCodeBlocks, 115 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 90 ConstructedInterpolants, 0 QuantifiedInterpolants, 1164 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-24 05:31:46,745 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...