/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-23 22:59:47,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-23 22:59:47,764 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-23 22:59:47,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-23 22:59:47,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-23 22:59:47,782 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-23 22:59:47,782 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-23 22:59:47,783 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-23 22:59:47,783 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-23 22:59:47,786 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-23 22:59:47,787 INFO L153 SettingsManager]: * Use SBE=true [2023-08-23 22:59:47,787 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-23 22:59:47,787 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-23 22:59:47,788 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-23 22:59:47,788 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-23 22:59:47,788 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-23 22:59:47,789 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-23 22:59:47,789 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-23 22:59:47,789 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-23 22:59:47,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-23 22:59:47,789 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-23 22:59:47,789 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-23 22:59:47,790 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-23 22:59:47,790 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-23 22:59:47,790 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-23 22:59:47,790 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-23 22:59:47,790 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-23 22:59:47,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:59:47,791 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-23 22:59:47,791 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-23 22:59:47,792 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-23 22:59:47,792 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-23 22:59:47,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-23 22:59:47,792 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-23 22:59:47,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-23 22:59:47,793 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-08-23 22:59:48,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-23 22:59:48,068 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-23 22:59:48,070 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-23 22:59:48,071 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-23 22:59:48,071 INFO L274 PluginConnector]: CDTParser initialized [2023-08-23 22:59:48,072 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-08-23 22:59:49,135 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-23 22:59:49,365 INFO L384 CDTParser]: Found 1 translation units. [2023-08-23 22:59:49,366 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-08-23 22:59:49,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c373f9a/90bb3f4bb19d4ba6a129d8eb6ebbd488/FLAG20934dd81 [2023-08-23 22:59:49,391 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a6c373f9a/90bb3f4bb19d4ba6a129d8eb6ebbd488 [2023-08-23 22:59:49,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-23 22:59:49,396 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-23 22:59:49,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-23 22:59:49,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-23 22:59:49,401 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-23 22:59:49,402 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,402 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb8511e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49, skipping insertion in model container [2023-08-23 22:59:49,403 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,443 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-23 22:59:49,576 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/mix017_pso.opt_tso.opt.i[956,969] [2023-08-23 22:59:49,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:59:49,754 INFO L201 MainTranslator]: Completed pre-run [2023-08-23 22:59:49,763 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/mix017_pso.opt_tso.opt.i[956,969] [2023-08-23 22:59:49,769 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:59:49,770 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-23 22:59:49,792 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-23 22:59:49,815 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:59:49,815 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-23 22:59:49,820 INFO L206 MainTranslator]: Completed translation [2023-08-23 22:59:49,822 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49 WrapperNode [2023-08-23 22:59:49,822 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-23 22:59:49,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-23 22:59:49,823 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-23 22:59:49,823 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-23 22:59:49,827 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,843 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,861 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 166 [2023-08-23 22:59:49,861 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-23 22:59:49,861 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-23 22:59:49,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-23 22:59:49,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-23 22:59:49,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,876 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,885 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,886 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,888 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-23 22:59:49,889 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-23 22:59:49,889 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-23 22:59:49,889 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-23 22:59:49,889 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (1/1) ... [2023-08-23 22:59:49,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-23 22:59:49,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-23 22:59:49,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-23 22:59:49,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-23 22:59:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-23 22:59:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-23 22:59:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-23 22:59:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-23 22:59:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-23 22:59:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-23 22:59:49,964 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-23 22:59:49,964 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-23 22:59:49,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-23 22:59:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-23 22:59:49,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-23 22:59:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-23 22:59:49,965 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-23 22:59:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-23 22:59:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-23 22:59:49,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-23 22:59:49,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-23 22:59:49,966 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-23 22:59:50,106 INFO L236 CfgBuilder]: Building ICFG [2023-08-23 22:59:50,108 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-23 22:59:50,407 INFO L277 CfgBuilder]: Performing block encoding [2023-08-23 22:59:50,513 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-23 22:59:50,514 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-23 22:59:50,516 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:59:50 BoogieIcfgContainer [2023-08-23 22:59:50,516 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-23 22:59:50,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-23 22:59:50,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-23 22:59:50,521 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-23 22:59:50,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.08 10:59:49" (1/3) ... [2023-08-23 22:59:50,521 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7830dd01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:59:50, skipping insertion in model container [2023-08-23 22:59:50,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.08 10:59:49" (2/3) ... [2023-08-23 22:59:50,522 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7830dd01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.08 10:59:50, skipping insertion in model container [2023-08-23 22:59:50,522 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.08 10:59:50" (3/3) ... [2023-08-23 22:59:50,523 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2023-08-23 22:59:50,535 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-23 22:59:50,535 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-23 22:59:50,535 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-23 22:59:50,574 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-23 22:59:50,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2023-08-23 22:59:50,634 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-23 22:59:50,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:59:50,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-23 22:59:50,638 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 129 transitions, 278 flow [2023-08-23 22:59:50,641 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 125 transitions, 262 flow [2023-08-23 22:59:50,643 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-23 22:59:50,649 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-23 22:59:50,651 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 136 places, 125 transitions, 262 flow [2023-08-23 22:59:50,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 136 places, 125 transitions, 262 flow [2023-08-23 22:59:50,674 INFO L124 PetriNetUnfolderBase]: 2/125 cut-off events. [2023-08-23 22:59:50,674 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:59:50,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 65 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 85. Up to 2 conditions per place. [2023-08-23 22:59:50,676 INFO L119 LiptonReduction]: Number of co-enabled transitions 2718 [2023-08-23 22:59:53,683 INFO L134 LiptonReduction]: Checked pairs total: 6245 [2023-08-23 22:59:53,683 INFO L136 LiptonReduction]: Total number of compositions: 108 [2023-08-23 22:59:53,693 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-23 22:59:53,699 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;@11c59fe7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-23 22:59:53,699 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-08-23 22:59:53,703 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-23 22:59:53,703 INFO L124 PetriNetUnfolderBase]: 0/17 cut-off events. [2023-08-23 22:59:53,703 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-23 22:59:53,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:53,704 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:53,704 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:53,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash 316636311, now seen corresponding path program 1 times [2023-08-23 22:59:53,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:53,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329139528] [2023-08-23 22:59:53,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:53,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:53,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:54,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329139528] [2023-08-23 22:59:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329139528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:54,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:54,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 22:59:54,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357931750] [2023-08-23 22:59:54,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:54,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:59:54,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:59:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:59:54,085 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 237 [2023-08-23 22:59:54,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:54,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 237 [2023-08-23 22:59:54,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:54,584 INFO L124 PetriNetUnfolderBase]: 2594/3775 cut-off events. [2023-08-23 22:59:54,584 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-08-23 22:59:54,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7470 conditions, 3775 events. 2594/3775 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19440 event pairs, 518 based on Foata normal form. 0/3591 useless extension candidates. Maximal degree in co-relation 7458. Up to 2797 conditions per place. [2023-08-23 22:59:54,601 INFO L140 encePairwiseOnDemand]: 233/237 looper letters, 30 selfloop transitions, 2 changer transitions 2/37 dead transitions. [2023-08-23 22:59:54,602 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 154 flow [2023-08-23 22:59:54,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:59:54,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:59:54,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-23 22:59:54,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5372714486638537 [2023-08-23 22:59:54,612 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-23 22:59:54,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-23 22:59:54,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:54,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-23 22:59:54,617 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,620 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,621 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,622 INFO L175 Difference]: Start difference. First operand has 40 places, 28 transitions, 68 flow. Second operand 3 states and 382 transitions. [2023-08-23 22:59:54,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 154 flow [2023-08-23 22:59:54,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 37 transitions, 150 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-23 22:59:54,627 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 62 flow [2023-08-23 22:59:54,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-23 22:59:54,630 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-23 22:59:54,631 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 62 flow [2023-08-23 22:59:54,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:54,631 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:54,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-23 22:59:54,631 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:54,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:54,632 INFO L85 PathProgramCache]: Analyzing trace with hash -655096605, now seen corresponding path program 1 times [2023-08-23 22:59:54,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:54,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561520630] [2023-08-23 22:59:54,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:54,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:54,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:54,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:54,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:54,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561520630] [2023-08-23 22:59:54,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561520630] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:54,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:54,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-23 22:59:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792955314] [2023-08-23 22:59:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:54,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-23 22:59:54,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:54,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-23 22:59:54,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-23 22:59:54,754 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 237 [2023-08-23 22:59:54,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:54,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 237 [2023-08-23 22:59:54,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:54,963 INFO L124 PetriNetUnfolderBase]: 1853/2710 cut-off events. [2023-08-23 22:59:54,963 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-08-23 22:59:54,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5518 conditions, 2710 events. 1853/2710 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12984 event pairs, 737 based on Foata normal form. 72/2778 useless extension candidates. Maximal degree in co-relation 5508. Up to 1621 conditions per place. [2023-08-23 22:59:54,977 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 29 selfloop transitions, 2 changer transitions 0/34 dead transitions. [2023-08-23 22:59:54,977 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 34 transitions, 142 flow [2023-08-23 22:59:54,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-23 22:59:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-23 22:59:54,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-23 22:59:54,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5260196905766527 [2023-08-23 22:59:54,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-23 22:59:54,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-23 22:59:54,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:54,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-23 22:59:54,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,982 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,983 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 237.0) internal successors, (948), 4 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,983 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 62 flow. Second operand 3 states and 374 transitions. [2023-08-23 22:59:54,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 34 transitions, 142 flow [2023-08-23 22:59:54,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 22:59:54,985 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 66 flow [2023-08-23 22:59:54,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=66, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-23 22:59:54,985 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2023-08-23 22:59:54,986 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 66 flow [2023-08-23 22:59:54,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:54,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:54,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:54,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-23 22:59:54,986 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:54,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:54,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1810101240, now seen corresponding path program 1 times [2023-08-23 22:59:54,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:54,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362846348] [2023-08-23 22:59:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:54,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:55,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:55,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:55,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362846348] [2023-08-23 22:59:55,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362846348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:55,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:55,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:59:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761380772] [2023-08-23 22:59:55,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:55,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:59:55,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:55,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:59:55,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:59:55,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-23 22:59:55,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 66 flow. Second operand has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:55,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-23 22:59:55,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:55,501 INFO L124 PetriNetUnfolderBase]: 1760/2580 cut-off events. [2023-08-23 22:59:55,501 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-08-23 22:59:55,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5572 conditions, 2580 events. 1760/2580 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12320 event pairs, 336 based on Foata normal form. 180/2757 useless extension candidates. Maximal degree in co-relation 5561. Up to 1795 conditions per place. [2023-08-23 22:59:55,514 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 34 selfloop transitions, 5 changer transitions 23/65 dead transitions. [2023-08-23 22:59:55,514 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 65 transitions, 285 flow [2023-08-23 22:59:55,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-23 22:59:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-23 22:59:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 594 transitions. [2023-08-23 22:59:55,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5012658227848101 [2023-08-23 22:59:55,516 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 594 transitions. [2023-08-23 22:59:55,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 594 transitions. [2023-08-23 22:59:55,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:55,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 594 transitions. [2023-08-23 22:59:55,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,519 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 237.0) internal successors, (1422), 6 states have internal predecessors, (1422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,520 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 66 flow. Second operand 5 states and 594 transitions. [2023-08-23 22:59:55,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 65 transitions, 285 flow [2023-08-23 22:59:55,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 65 transitions, 275 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-23 22:59:55,523 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 107 flow [2023-08-23 22:59:55,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=107, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2023-08-23 22:59:55,524 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2023-08-23 22:59:55,527 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 107 flow [2023-08-23 22:59:55,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.25) internal successors, (437), 4 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:55,528 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:55,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-23 22:59:55,528 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:55,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:55,528 INFO L85 PathProgramCache]: Analyzing trace with hash -1876552203, now seen corresponding path program 1 times [2023-08-23 22:59:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:55,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567708003] [2023-08-23 22:59:55,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:55,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:55,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:55,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:55,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567708003] [2023-08-23 22:59:55,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567708003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:55,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:55,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-23 22:59:55,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929803523] [2023-08-23 22:59:55,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:55,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-23 22:59:55,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:55,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-23 22:59:55,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-23 22:59:55,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-23 22:59:55,711 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 107 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:55,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-23 22:59:55,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:55,941 INFO L124 PetriNetUnfolderBase]: 1056/1632 cut-off events. [2023-08-23 22:59:55,941 INFO L125 PetriNetUnfolderBase]: For 663/663 co-relation queries the response was YES. [2023-08-23 22:59:55,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4737 conditions, 1632 events. 1056/1632 cut-off events. For 663/663 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 7450 event pairs, 158 based on Foata normal form. 132/1761 useless extension candidates. Maximal degree in co-relation 4723. Up to 671 conditions per place. [2023-08-23 22:59:55,947 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 45 selfloop transitions, 9 changer transitions 23/80 dead transitions. [2023-08-23 22:59:55,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 80 transitions, 427 flow [2023-08-23 22:59:55,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-23 22:59:55,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-23 22:59:55,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 715 transitions. [2023-08-23 22:59:55,949 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5028129395218003 [2023-08-23 22:59:55,949 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 715 transitions. [2023-08-23 22:59:55,949 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 715 transitions. [2023-08-23 22:59:55,950 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:55,950 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 715 transitions. [2023-08-23 22:59:55,951 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.16666666666667) internal successors, (715), 6 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,953 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 237.0) internal successors, (1659), 7 states have internal predecessors, (1659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,953 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 107 flow. Second operand 6 states and 715 transitions. [2023-08-23 22:59:55,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 80 transitions, 427 flow [2023-08-23 22:59:55,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 80 transitions, 420 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 22:59:55,958 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 172 flow [2023-08-23 22:59:55,958 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=172, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2023-08-23 22:59:55,958 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2023-08-23 22:59:55,958 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 172 flow [2023-08-23 22:59:55,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:55,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:55,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:55,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-23 22:59:55,959 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:55,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:55,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1842371021, now seen corresponding path program 1 times [2023-08-23 22:59:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565118024] [2023-08-23 22:59:55,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:55,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:56,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:56,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:56,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565118024] [2023-08-23 22:59:56,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565118024] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:56,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:56,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:59:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944391953] [2023-08-23 22:59:56,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:56,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:59:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:56,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:59:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:59:56,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-08-23 22:59:56,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,097 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:56,097 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-08-23 22:59:56,097 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:56,302 INFO L124 PetriNetUnfolderBase]: 1360/2220 cut-off events. [2023-08-23 22:59:56,303 INFO L125 PetriNetUnfolderBase]: For 3386/3386 co-relation queries the response was YES. [2023-08-23 22:59:56,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7553 conditions, 2220 events. 1360/2220 cut-off events. For 3386/3386 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 11585 event pairs, 272 based on Foata normal form. 25/2245 useless extension candidates. Maximal degree in co-relation 7536. Up to 1152 conditions per place. [2023-08-23 22:59:56,312 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 59 selfloop transitions, 2 changer transitions 16/79 dead transitions. [2023-08-23 22:59:56,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 79 transitions, 590 flow [2023-08-23 22:59:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 22:59:56,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 22:59:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-08-23 22:59:56,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5274261603375527 [2023-08-23 22:59:56,313 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-08-23 22:59:56,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-08-23 22:59:56,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:56,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-08-23 22:59:56,315 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,316 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,316 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 172 flow. Second operand 4 states and 500 transitions. [2023-08-23 22:59:56,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 79 transitions, 590 flow [2023-08-23 22:59:56,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 79 transitions, 488 flow, removed 39 selfloop flow, removed 4 redundant places. [2023-08-23 22:59:56,331 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 147 flow [2023-08-23 22:59:56,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-23 22:59:56,332 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-23 22:59:56,332 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 147 flow [2023-08-23 22:59:56,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,332 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:56,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:56,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-23 22:59:56,333 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:56,333 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:56,333 INFO L85 PathProgramCache]: Analyzing trace with hash 520124223, now seen corresponding path program 2 times [2023-08-23 22:59:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:56,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406297180] [2023-08-23 22:59:56,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:56,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:56,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:56,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:56,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406297180] [2023-08-23 22:59:56,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406297180] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:56,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:56,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:59:56,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713357950] [2023-08-23 22:59:56,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:56,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-23 22:59:56,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:56,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-23 22:59:56,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-23 22:59:56,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-23 22:59:56,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 147 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:56,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-23 22:59:56,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:56,676 INFO L124 PetriNetUnfolderBase]: 926/1493 cut-off events. [2023-08-23 22:59:56,676 INFO L125 PetriNetUnfolderBase]: For 1243/1249 co-relation queries the response was YES. [2023-08-23 22:59:56,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4591 conditions, 1493 events. 926/1493 cut-off events. For 1243/1249 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7128 event pairs, 153 based on Foata normal form. 97/1553 useless extension candidates. Maximal degree in co-relation 4575. Up to 463 conditions per place. [2023-08-23 22:59:56,682 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 54 selfloop transitions, 13 changer transitions 23/94 dead transitions. [2023-08-23 22:59:56,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 94 transitions, 555 flow [2023-08-23 22:59:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-23 22:59:56,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-23 22:59:56,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 834 transitions. [2023-08-23 22:59:56,684 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027124773960217 [2023-08-23 22:59:56,684 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 834 transitions. [2023-08-23 22:59:56,684 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 834 transitions. [2023-08-23 22:59:56,684 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:56,684 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 834 transitions. [2023-08-23 22:59:56,685 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.14285714285714) internal successors, (834), 7 states have internal predecessors, (834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,687 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 237.0) internal successors, (1896), 8 states have internal predecessors, (1896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,687 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 147 flow. Second operand 7 states and 834 transitions. [2023-08-23 22:59:56,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 94 transitions, 555 flow [2023-08-23 22:59:56,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 549 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-23 22:59:56,690 INFO L231 Difference]: Finished difference. Result has 53 places, 38 transitions, 234 flow [2023-08-23 22:59:56,690 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=53, PETRI_TRANSITIONS=38} [2023-08-23 22:59:56,691 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2023-08-23 22:59:56,691 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 38 transitions, 234 flow [2023-08-23 22:59:56,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,691 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:56,692 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:56,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-23 22:59:56,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:56,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:56,692 INFO L85 PathProgramCache]: Analyzing trace with hash 234773590, now seen corresponding path program 1 times [2023-08-23 22:59:56,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:56,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521155652] [2023-08-23 22:59:56,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:56,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:56,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:56,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521155652] [2023-08-23 22:59:56,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521155652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:56,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:56,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:59:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459254161] [2023-08-23 22:59:56,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:56,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:59:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:56,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:59:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:59:56,801 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-08-23 22:59:56,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 38 transitions, 234 flow. Second operand has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:56,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:56,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-08-23 22:59:56,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:57,004 INFO L124 PetriNetUnfolderBase]: 1489/2368 cut-off events. [2023-08-23 22:59:57,004 INFO L125 PetriNetUnfolderBase]: For 4206/4206 co-relation queries the response was YES. [2023-08-23 22:59:57,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8174 conditions, 2368 events. 1489/2368 cut-off events. For 4206/4206 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 12524 event pairs, 198 based on Foata normal form. 9/2344 useless extension candidates. Maximal degree in co-relation 8154. Up to 1227 conditions per place. [2023-08-23 22:59:57,013 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 54 selfloop transitions, 2 changer transitions 24/83 dead transitions. [2023-08-23 22:59:57,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 83 transitions, 700 flow [2023-08-23 22:59:57,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 22:59:57,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 22:59:57,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 495 transitions. [2023-08-23 22:59:57,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221518987341772 [2023-08-23 22:59:57,014 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 495 transitions. [2023-08-23 22:59:57,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 495 transitions. [2023-08-23 22:59:57,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:57,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 495 transitions. [2023-08-23 22:59:57,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.75) internal successors, (495), 4 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,017 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,017 INFO L175 Difference]: Start difference. First operand has 53 places, 38 transitions, 234 flow. Second operand 4 states and 495 transitions. [2023-08-23 22:59:57,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 83 transitions, 700 flow [2023-08-23 22:59:57,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 83 transitions, 560 flow, removed 47 selfloop flow, removed 5 redundant places. [2023-08-23 22:59:57,031 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 193 flow [2023-08-23 22:59:57,031 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=193, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2023-08-23 22:59:57,032 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-08-23 22:59:57,032 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 193 flow [2023-08-23 22:59:57,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.25) internal successors, (465), 4 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,032 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:57,032 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:57,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-23 22:59:57,032 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:57,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:57,033 INFO L85 PathProgramCache]: Analyzing trace with hash 936519902, now seen corresponding path program 2 times [2023-08-23 22:59:57,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:57,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004632938] [2023-08-23 22:59:57,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:57,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004632938] [2023-08-23 22:59:57,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004632938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:57,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-23 22:59:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719776752] [2023-08-23 22:59:57,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:57,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 22:59:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:57,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 22:59:57,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-23 22:59:57,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-23 22:59:57,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 193 flow. Second operand has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:57,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-23 22:59:57,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:57,379 INFO L124 PetriNetUnfolderBase]: 1145/1834 cut-off events. [2023-08-23 22:59:57,380 INFO L125 PetriNetUnfolderBase]: For 1723/1743 co-relation queries the response was YES. [2023-08-23 22:59:57,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5759 conditions, 1834 events. 1145/1834 cut-off events. For 1723/1743 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 9402 event pairs, 190 based on Foata normal form. 53/1802 useless extension candidates. Maximal degree in co-relation 5740. Up to 680 conditions per place. [2023-08-23 22:59:57,385 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 47 selfloop transitions, 17 changer transitions 17/84 dead transitions. [2023-08-23 22:59:57,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 515 flow [2023-08-23 22:59:57,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-23 22:59:57,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-23 22:59:57,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 929 transitions. [2023-08-23 22:59:57,387 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4899789029535865 [2023-08-23 22:59:57,387 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 929 transitions. [2023-08-23 22:59:57,387 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 929 transitions. [2023-08-23 22:59:57,388 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:57,388 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 929 transitions. [2023-08-23 22:59:57,389 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.125) internal successors, (929), 8 states have internal predecessors, (929), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,391 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 237.0) internal successors, (2133), 9 states have internal predecessors, (2133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,391 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 193 flow. Second operand 8 states and 929 transitions. [2023-08-23 22:59:57,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 515 flow [2023-08-23 22:59:57,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 486 flow, removed 9 selfloop flow, removed 2 redundant places. [2023-08-23 22:59:57,408 INFO L231 Difference]: Finished difference. Result has 59 places, 37 transitions, 216 flow [2023-08-23 22:59:57,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=216, PETRI_PLACES=59, PETRI_TRANSITIONS=37} [2023-08-23 22:59:57,410 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2023-08-23 22:59:57,410 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 37 transitions, 216 flow [2023-08-23 22:59:57,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:57,411 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:57,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-23 22:59:57,411 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:57,411 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1558616144, now seen corresponding path program 1 times [2023-08-23 22:59:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:57,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142393646] [2023-08-23 22:59:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:57,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:57,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:57,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:57,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142393646] [2023-08-23 22:59:57,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142393646] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:57,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:57,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-23 22:59:57,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666809784] [2023-08-23 22:59:57,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:57,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-23 22:59:57,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:57,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-23 22:59:57,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-23 22:59:57,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 237 [2023-08-23 22:59:57,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 37 transitions, 216 flow. Second operand has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 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-23 22:59:57,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:57,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 237 [2023-08-23 22:59:57,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:57,727 INFO L124 PetriNetUnfolderBase]: 1008/1668 cut-off events. [2023-08-23 22:59:57,727 INFO L125 PetriNetUnfolderBase]: For 2942/2942 co-relation queries the response was YES. [2023-08-23 22:59:57,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5558 conditions, 1668 events. 1008/1668 cut-off events. For 2942/2942 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 8490 event pairs, 218 based on Foata normal form. 1/1629 useless extension candidates. Maximal degree in co-relation 5540. Up to 993 conditions per place. [2023-08-23 22:59:57,753 INFO L140 encePairwiseOnDemand]: 234/237 looper letters, 36 selfloop transitions, 1 changer transitions 42/81 dead transitions. [2023-08-23 22:59:57,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 81 transitions, 645 flow [2023-08-23 22:59:57,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-23 22:59:57,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-23 22:59:57,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2023-08-23 22:59:57,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210970464135021 [2023-08-23 22:59:57,755 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2023-08-23 22:59:57,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2023-08-23 22:59:57,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:57,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2023-08-23 22:59:57,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,757 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,757 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 237.0) internal successors, (1185), 5 states have internal predecessors, (1185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:57,757 INFO L175 Difference]: Start difference. First operand has 59 places, 37 transitions, 216 flow. Second operand 4 states and 494 transitions. [2023-08-23 22:59:57,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 81 transitions, 645 flow [2023-08-23 22:59:57,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 81 transitions, 516 flow, removed 32 selfloop flow, removed 9 redundant places. [2023-08-23 22:59:57,764 INFO L231 Difference]: Finished difference. Result has 51 places, 37 transitions, 163 flow [2023-08-23 22:59:57,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=163, PETRI_PLACES=51, PETRI_TRANSITIONS=37} [2023-08-23 22:59:57,765 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 11 predicate places. [2023-08-23 22:59:57,765 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 37 transitions, 163 flow [2023-08-23 22:59:57,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.75) internal successors, (467), 4 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-23 22:59:57,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:57,766 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:57,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-23 22:59:57,766 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:57,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:57,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1663546158, now seen corresponding path program 2 times [2023-08-23 22:59:57,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:57,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574299844] [2023-08-23 22:59:57,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:57,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-23 22:59:58,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-23 22:59:58,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-23 22:59:58,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574299844] [2023-08-23 22:59:58,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574299844] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-23 22:59:58,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-23 22:59:58,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-23 22:59:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122579120] [2023-08-23 22:59:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-23 22:59:58,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-23 22:59:58,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-23 22:59:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-23 22:59:58,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-23 22:59:58,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 237 [2023-08-23 22:59:58,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 37 transitions, 163 flow. Second operand has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-23 22:59:58,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 237 [2023-08-23 22:59:58,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-23 22:59:58,536 INFO L124 PetriNetUnfolderBase]: 983/1653 cut-off events. [2023-08-23 22:59:58,536 INFO L125 PetriNetUnfolderBase]: For 2114/2114 co-relation queries the response was YES. [2023-08-23 22:59:58,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5265 conditions, 1653 events. 983/1653 cut-off events. For 2114/2114 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 8559 event pairs, 156 based on Foata normal form. 1/1567 useless extension candidates. Maximal degree in co-relation 5251. Up to 362 conditions per place. [2023-08-23 22:59:58,540 INFO L140 encePairwiseOnDemand]: 230/237 looper letters, 34 selfloop transitions, 4 changer transitions 87/128 dead transitions. [2023-08-23 22:59:58,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 128 transitions, 890 flow [2023-08-23 22:59:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-23 22:59:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-23 22:59:58,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1132 transitions. [2023-08-23 22:59:58,543 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47763713080168774 [2023-08-23 22:59:58,543 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1132 transitions. [2023-08-23 22:59:58,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1132 transitions. [2023-08-23 22:59:58,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-23 22:59:58,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1132 transitions. [2023-08-23 22:59:58,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 113.2) internal successors, (1132), 10 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 237.0) internal successors, (2607), 11 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,548 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 237.0) internal successors, (2607), 11 states have internal predecessors, (2607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,548 INFO L175 Difference]: Start difference. First operand has 51 places, 37 transitions, 163 flow. Second operand 10 states and 1132 transitions. [2023-08-23 22:59:58,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 128 transitions, 890 flow [2023-08-23 22:59:58,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 128 transitions, 880 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-23 22:59:58,559 INFO L231 Difference]: Finished difference. Result has 60 places, 37 transitions, 176 flow [2023-08-23 22:59:58,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=237, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=176, PETRI_PLACES=60, PETRI_TRANSITIONS=37} [2023-08-23 22:59:58,560 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2023-08-23 22:59:58,560 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 37 transitions, 176 flow [2023-08-23 22:59:58,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 109.14285714285714) internal successors, (764), 7 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-23 22:59:58,560 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-23 22:59:58,560 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-23 22:59:58,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-23 22:59:58,561 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2023-08-23 22:59:58,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-23 22:59:58,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1931052258, now seen corresponding path program 3 times [2023-08-23 22:59:58,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-23 22:59:58,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833823583] [2023-08-23 22:59:58,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-23 22:59:58,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-23 22:59:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:59:58,604 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-23 22:59:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-23 22:59:58,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-23 22:59:58,674 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-23 22:59:58,674 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2023-08-23 22:59:58,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2023-08-23 22:59:58,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2023-08-23 22:59:58,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2023-08-23 22:59:58,675 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2023-08-23 22:59:58,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2023-08-23 22:59:58,676 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2023-08-23 22:59:58,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-23 22:59:58,676 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1] [2023-08-23 22:59:58,679 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-23 22:59:58,679 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-23 22:59:58,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.08 10:59:58 BasicIcfg [2023-08-23 22:59:58,742 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-23 22:59:58,742 INFO L158 Benchmark]: Toolchain (without parser) took 9346.26ms. Allocated memory was 375.4MB in the beginning and 648.0MB in the end (delta: 272.6MB). Free memory was 331.2MB in the beginning and 546.2MB in the end (delta: -215.0MB). Peak memory consumption was 59.7MB. Max. memory is 16.0GB. [2023-08-23 22:59:58,742 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 375.4MB. Free memory is still 353.0MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 22:59:58,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 422.91ms. Allocated memory is still 375.4MB. Free memory was 331.2MB in the beginning and 307.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-23 22:59:58,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.67ms. Allocated memory is still 375.4MB. Free memory was 307.1MB in the beginning and 303.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-23 22:59:58,743 INFO L158 Benchmark]: Boogie Preprocessor took 26.84ms. Allocated memory is still 375.4MB. Free memory was 303.9MB in the beginning and 301.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-23 22:59:58,743 INFO L158 Benchmark]: RCFGBuilder took 627.08ms. Allocated memory is still 375.4MB. Free memory was 301.8MB in the beginning and 262.0MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. [2023-08-23 22:59:58,743 INFO L158 Benchmark]: TraceAbstraction took 8224.10ms. Allocated memory was 375.4MB in the beginning and 648.0MB in the end (delta: 272.6MB). Free memory was 260.9MB in the beginning and 546.2MB in the end (delta: -285.2MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-23 22:59:58,744 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.10ms. Allocated memory is still 375.4MB. Free memory is still 353.0MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 422.91ms. Allocated memory is still 375.4MB. Free memory was 331.2MB in the beginning and 307.1MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 38.67ms. Allocated memory is still 375.4MB. Free memory was 307.1MB in the beginning and 303.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.84ms. Allocated memory is still 375.4MB. Free memory was 303.9MB in the beginning and 301.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 627.08ms. Allocated memory is still 375.4MB. Free memory was 301.8MB in the beginning and 262.0MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.0GB. * TraceAbstraction took 8224.10ms. Allocated memory was 375.4MB in the beginning and 648.0MB in the end (delta: 272.6MB). Free memory was 260.9MB in the beginning and 546.2MB in the end (delta: -285.2MB). There was no memory consumed. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 136 PlacesBefore, 40 PlacesAfterwards, 125 TransitionsBefore, 28 TransitionsAfterwards, 2718 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 6245 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2952, independent: 2761, independent conditional: 0, independent unconditional: 2761, dependent: 191, dependent conditional: 0, dependent unconditional: 191, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1480, independent: 1439, independent conditional: 0, independent unconditional: 1439, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2952, independent: 1322, independent conditional: 0, independent unconditional: 1322, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 1480, unknown conditional: 0, unknown unconditional: 1480] , Statistics on independence cache: Total cache size (in pairs): 137, Positive cache size: 118, Positive conditional cache size: 0, Positive unconditional cache size: 118, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t445, ((void *)0), P0, ((void *)0))=-3, t445={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t446, ((void *)0), P1, ((void *)0))=-2, t445={5:0}, t446={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t447, ((void *)0), P2, ((void *)0))=-1, t445={5:0}, t446={6:0}, t447={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t448, ((void *)0), P3, ((void *)0))=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L764] 1 return 0; [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 2 return 0; [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L792] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L793] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L794] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L795] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L797] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L844] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L853] 4 return 0; [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L888] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 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: 873]: 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: 869]: 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: 867]: 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: 871]: 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 9 procedures, 163 locations, 7 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.1s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 290 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 3 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1049 IncrementalHoareTripleChecker+Invalid, 1074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 3 mSDtfsCounter, 1049 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=234occurred in iteration=6, InterpolantAutomatonStates: 54, 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, 1.7s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 171 ConstructedInterpolants, 0 QuantifiedInterpolants, 760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-23 22:59:58,765 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...