/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 11:35:22,407 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 11:35:22,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 11:35:22,478 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 11:35:22,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 11:35:22,501 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 11:35:22,501 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 11:35:22,501 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 11:35:22,502 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 11:35:22,504 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 11:35:22,505 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 11:35:22,505 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 11:35:22,505 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 11:35:22,506 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 11:35:22,506 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 11:35:22,506 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 11:35:22,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 11:35:22,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 11:35:22,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 11:35:22,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 11:35:22,507 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 11:35:22,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 11:35:22,508 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 11:35:22,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 11:35:22,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 11:35:22,508 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 11:35:22,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 11:35:22,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:35:22,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 11:35:22,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 11:35:22,510 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 11:35:22,510 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 11:35:22,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 11:35:22,510 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 11:35:22,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 11:35:22,510 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST [2023-08-24 11:35:22,737 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 11:35:22,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 11:35:22,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 11:35:22,755 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 11:35:22,755 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 11:35:22,756 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2023-08-24 11:35:23,600 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 11:35:23,818 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 11:35:23,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009.oepc.i [2023-08-24 11:35:23,833 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8132bff97/093aa9294edd47a08d4e1f7518ca0119/FLAG48d86f755 [2023-08-24 11:35:23,845 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8132bff97/093aa9294edd47a08d4e1f7518ca0119 [2023-08-24 11:35:23,848 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 11:35:23,849 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 11:35:23,851 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 11:35:23,851 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 11:35:23,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 11:35:23,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:35:23" (1/1) ... [2023-08-24 11:35:23,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8388461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:23, skipping insertion in model container [2023-08-24 11:35:23,855 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 11:35:23" (1/1) ... [2023-08-24 11:35:23,896 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 11:35:24,029 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/mix009.oepc.i[945,958] [2023-08-24 11:35:24,171 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:35:24,178 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 11:35:24,186 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/mix009.oepc.i[945,958] [2023-08-24 11:35:24,209 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:35:24,210 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 11:35:24,249 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 11:35:24,271 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:35:24,271 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 11:35:24,276 INFO L206 MainTranslator]: Completed translation [2023-08-24 11:35:24,277 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24 WrapperNode [2023-08-24 11:35:24,277 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 11:35:24,278 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 11:35:24,278 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 11:35:24,278 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 11:35:24,282 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,307 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,333 INFO L138 Inliner]: procedures = 175, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 122 [2023-08-24 11:35:24,334 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 11:35:24,335 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 11:35:24,335 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 11:35:24,335 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 11:35:24,341 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,364 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 11:35:24,366 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 11:35:24,367 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 11:35:24,367 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 11:35:24,367 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (1/1) ... [2023-08-24 11:35:24,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 11:35:24,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 11:35:24,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 11:35:24,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 11:35:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 11:35:24,418 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 11:35:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 11:35:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 11:35:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 11:35:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 11:35:24,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 11:35:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 11:35:24,419 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 11:35:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 11:35:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 11:35:24,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 11:35:24,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 11:35:24,420 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 11:35:24,531 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 11:35:24,533 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 11:35:24,782 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 11:35:24,888 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 11:35:24,888 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 11:35:24,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:35:24 BoogieIcfgContainer [2023-08-24 11:35:24,890 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 11:35:24,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 11:35:24,892 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 11:35:24,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 11:35:24,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 11:35:23" (1/3) ... [2023-08-24 11:35:24,894 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc2f730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:35:24, skipping insertion in model container [2023-08-24 11:35:24,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 11:35:24" (2/3) ... [2023-08-24 11:35:24,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bc2f730 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 11:35:24, skipping insertion in model container [2023-08-24 11:35:24,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 11:35:24" (3/3) ... [2023-08-24 11:35:24,896 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009.oepc.i [2023-08-24 11:35:24,907 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 11:35:24,908 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 11:35:24,908 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 11:35:24,944 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 11:35:24,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 99 places, 94 transitions, 198 flow [2023-08-24 11:35:25,007 INFO L124 PetriNetUnfolderBase]: 2/92 cut-off events. [2023-08-24 11:35:25,007 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:35:25,010 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-08-24 11:35:25,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 94 transitions, 198 flow [2023-08-24 11:35:25,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 97 places, 92 transitions, 190 flow [2023-08-24 11:35:25,016 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 11:35:25,026 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 97 places, 92 transitions, 190 flow [2023-08-24 11:35:25,028 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 97 places, 92 transitions, 190 flow [2023-08-24 11:35:25,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 97 places, 92 transitions, 190 flow [2023-08-24 11:35:25,054 INFO L124 PetriNetUnfolderBase]: 2/92 cut-off events. [2023-08-24 11:35:25,054 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:35:25,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 92 events. 2/92 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 52 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 54. Up to 2 conditions per place. [2023-08-24 11:35:25,055 INFO L119 LiptonReduction]: Number of co-enabled transitions 1272 [2023-08-24 11:35:27,603 INFO L134 LiptonReduction]: Checked pairs total: 3709 [2023-08-24 11:35:27,604 INFO L136 LiptonReduction]: Total number of compositions: 82 [2023-08-24 11:35:27,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 11:35:27,617 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;@15e96009, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 11:35:27,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-08-24 11:35:27,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 11:35:27,618 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-24 11:35:27,618 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 11:35:27,618 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:35:27,619 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 11:35:27,619 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:35:27,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:35:27,622 INFO L85 PathProgramCache]: Analyzing trace with hash 418379, now seen corresponding path program 1 times [2023-08-24 11:35:27,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:35:27,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889738485] [2023-08-24 11:35:27,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:35:27,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:35:27,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:35:27,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:35:27,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:35:27,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889738485] [2023-08-24 11:35:27,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889738485] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:35:27,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:35:27,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 11:35:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489630924] [2023-08-24 11:35:27,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:35:27,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:35:27,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:35:27,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:35:27,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:35:27,930 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 176 [2023-08-24 11:35:27,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 22 transitions, 50 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:27,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:35:27,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 176 [2023-08-24 11:35:27,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:35:28,045 INFO L124 PetriNetUnfolderBase]: 264/488 cut-off events. [2023-08-24 11:35:28,045 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-08-24 11:35:28,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 954 conditions, 488 events. 264/488 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2301 event pairs, 24 based on Foata normal form. 25/461 useless extension candidates. Maximal degree in co-relation 944. Up to 389 conditions per place. [2023-08-24 11:35:28,048 INFO L140 encePairwiseOnDemand]: 172/176 looper letters, 24 selfloop transitions, 2 changer transitions 4/32 dead transitions. [2023-08-24 11:35:28,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 32 transitions, 133 flow [2023-08-24 11:35:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:35:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:35:28,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 279 transitions. [2023-08-24 11:35:28,057 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5284090909090909 [2023-08-24 11:35:28,057 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 279 transitions. [2023-08-24 11:35:28,057 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 279 transitions. [2023-08-24 11:35:28,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:35:28,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 279 transitions. [2023-08-24 11:35:28,061 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,065 INFO L175 Difference]: Start difference. First operand has 28 places, 22 transitions, 50 flow. Second operand 3 states and 279 transitions. [2023-08-24 11:35:28,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 32 transitions, 133 flow [2023-08-24 11:35:28,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:35:28,067 INFO L231 Difference]: Finished difference. Result has 27 places, 18 transitions, 44 flow [2023-08-24 11:35:28,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=44, PETRI_PLACES=27, PETRI_TRANSITIONS=18} [2023-08-24 11:35:28,070 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, -1 predicate places. [2023-08-24 11:35:28,070 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 18 transitions, 44 flow [2023-08-24 11:35:28,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:35:28,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:35:28,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 11:35:28,071 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:35:28,071 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:35:28,071 INFO L85 PathProgramCache]: Analyzing trace with hash 387664530, now seen corresponding path program 1 times [2023-08-24 11:35:28,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:35:28,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805970637] [2023-08-24 11:35:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:35:28,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:35:28,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:35:28,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:35:28,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:35:28,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805970637] [2023-08-24 11:35:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805970637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:35:28,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:35:28,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:35:28,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868928541] [2023-08-24 11:35:28,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:35:28,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:35:28,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:35:28,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:35:28,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:35:28,309 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 176 [2023-08-24 11:35:28,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 18 transitions, 44 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:35:28,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 176 [2023-08-24 11:35:28,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:35:28,417 INFO L124 PetriNetUnfolderBase]: 287/508 cut-off events. [2023-08-24 11:35:28,417 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2023-08-24 11:35:28,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1068 conditions, 508 events. 287/508 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1976 event pairs, 139 based on Foata normal form. 36/544 useless extension candidates. Maximal degree in co-relation 1058. Up to 417 conditions per place. [2023-08-24 11:35:28,423 INFO L140 encePairwiseOnDemand]: 171/176 looper letters, 23 selfloop transitions, 3 changer transitions 15/41 dead transitions. [2023-08-24 11:35:28,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 41 transitions, 180 flow [2023-08-24 11:35:28,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:35:28,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:35:28,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2023-08-24 11:35:28,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2023-08-24 11:35:28,428 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 408 transitions. [2023-08-24 11:35:28,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 408 transitions. [2023-08-24 11:35:28,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:35:28,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 408 transitions. [2023-08-24 11:35:28,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,433 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,433 INFO L175 Difference]: Start difference. First operand has 27 places, 18 transitions, 44 flow. Second operand 5 states and 408 transitions. [2023-08-24 11:35:28,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 41 transitions, 180 flow [2023-08-24 11:35:28,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 41 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 11:35:28,434 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 67 flow [2023-08-24 11:35:28,434 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=40, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=67, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-24 11:35:28,435 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2023-08-24 11:35:28,435 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 67 flow [2023-08-24 11:35:28,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,436 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:35:28,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:35:28,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 11:35:28,442 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:35:28,444 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:35:28,444 INFO L85 PathProgramCache]: Analyzing trace with hash -213506422, now seen corresponding path program 1 times [2023-08-24 11:35:28,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:35:28,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243911730] [2023-08-24 11:35:28,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:35:28,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:35:28,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:35:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:35:28,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:35:28,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243911730] [2023-08-24 11:35:28,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243911730] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:35:28,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:35:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:35:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061302718] [2023-08-24 11:35:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:35:28,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:35:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:35:28,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:35:28,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:35:28,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 176 [2023-08-24 11:35:28,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 67 flow. Second operand has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:35:28,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 176 [2023-08-24 11:35:28,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:35:28,661 INFO L124 PetriNetUnfolderBase]: 203/364 cut-off events. [2023-08-24 11:35:28,661 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2023-08-24 11:35:28,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 903 conditions, 364 events. 203/364 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1364 event pairs, 68 based on Foata normal form. 18/381 useless extension candidates. Maximal degree in co-relation 890. Up to 251 conditions per place. [2023-08-24 11:35:28,663 INFO L140 encePairwiseOnDemand]: 172/176 looper letters, 21 selfloop transitions, 3 changer transitions 10/35 dead transitions. [2023-08-24 11:35:28,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 35 transitions, 171 flow [2023-08-24 11:35:28,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:35:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:35:28,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 425 transitions. [2023-08-24 11:35:28,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48295454545454547 [2023-08-24 11:35:28,665 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 425 transitions. [2023-08-24 11:35:28,665 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 425 transitions. [2023-08-24 11:35:28,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:35:28,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 425 transitions. [2023-08-24 11:35:28,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,667 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,667 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 67 flow. Second operand 5 states and 425 transitions. [2023-08-24 11:35:28,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 35 transitions, 171 flow [2023-08-24 11:35:28,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 35 transitions, 162 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-24 11:35:28,670 INFO L231 Difference]: Finished difference. Result has 33 places, 20 transitions, 75 flow [2023-08-24 11:35:28,670 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=75, PETRI_PLACES=33, PETRI_TRANSITIONS=20} [2023-08-24 11:35:28,671 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 5 predicate places. [2023-08-24 11:35:28,673 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 20 transitions, 75 flow [2023-08-24 11:35:28,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.5) internal successors, (322), 4 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:35:28,674 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:35:28,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 11:35:28,674 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:35:28,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:35:28,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1709128803, now seen corresponding path program 1 times [2023-08-24 11:35:28,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:35:28,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074815658] [2023-08-24 11:35:28,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:35:28,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:35:28,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:35:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:35:28,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:35:28,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074815658] [2023-08-24 11:35:28,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074815658] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:35:28,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:35:28,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:35:28,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78606734] [2023-08-24 11:35:28,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:35:28,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:35:28,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:35:28,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:35:28,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:35:28,760 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 176 [2023-08-24 11:35:28,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 20 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:35:28,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 176 [2023-08-24 11:35:28,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:35:28,830 INFO L124 PetriNetUnfolderBase]: 160/307 cut-off events. [2023-08-24 11:35:28,831 INFO L125 PetriNetUnfolderBase]: For 231/233 co-relation queries the response was YES. [2023-08-24 11:35:28,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 750 conditions, 307 events. 160/307 cut-off events. For 231/233 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1172 event pairs, 84 based on Foata normal form. 20/324 useless extension candidates. Maximal degree in co-relation 734. Up to 185 conditions per place. [2023-08-24 11:35:28,832 INFO L140 encePairwiseOnDemand]: 172/176 looper letters, 22 selfloop transitions, 3 changer transitions 11/39 dead transitions. [2023-08-24 11:35:28,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 195 flow [2023-08-24 11:35:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:35:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:35:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 427 transitions. [2023-08-24 11:35:28,833 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48522727272727273 [2023-08-24 11:35:28,833 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 427 transitions. [2023-08-24 11:35:28,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 427 transitions. [2023-08-24 11:35:28,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:35:28,834 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 427 transitions. [2023-08-24 11:35:28,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,836 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,836 INFO L175 Difference]: Start difference. First operand has 33 places, 20 transitions, 75 flow. Second operand 5 states and 427 transitions. [2023-08-24 11:35:28,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 195 flow [2023-08-24 11:35:28,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 39 transitions, 181 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 11:35:28,837 INFO L231 Difference]: Finished difference. Result has 34 places, 20 transitions, 78 flow [2023-08-24 11:35:28,837 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=78, PETRI_PLACES=34, PETRI_TRANSITIONS=20} [2023-08-24 11:35:28,838 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 6 predicate places. [2023-08-24 11:35:28,838 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 20 transitions, 78 flow [2023-08-24 11:35:28,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,838 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:35:28,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:35:28,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 11:35:28,839 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:35:28,839 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:35:28,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1622310235, now seen corresponding path program 1 times [2023-08-24 11:35:28,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:35:28,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336022808] [2023-08-24 11:35:28,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:35:28,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:35:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:35:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:35:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:35:28,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336022808] [2023-08-24 11:35:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336022808] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:35:28,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:35:28,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 11:35:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588968511] [2023-08-24 11:35:28,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:35:28,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 11:35:28,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:35:28,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 11:35:28,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 11:35:28,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 176 [2023-08-24 11:35:28,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 20 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:35:28,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 176 [2023-08-24 11:35:28,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:35:28,965 INFO L124 PetriNetUnfolderBase]: 51/123 cut-off events. [2023-08-24 11:35:28,965 INFO L125 PetriNetUnfolderBase]: For 70/71 co-relation queries the response was YES. [2023-08-24 11:35:28,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 337 conditions, 123 events. 51/123 cut-off events. For 70/71 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 363 event pairs, 17 based on Foata normal form. 16/138 useless extension candidates. Maximal degree in co-relation 320. Up to 77 conditions per place. [2023-08-24 11:35:28,966 INFO L140 encePairwiseOnDemand]: 172/176 looper letters, 24 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2023-08-24 11:35:28,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 30 transitions, 159 flow [2023-08-24 11:35:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 11:35:28,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 11:35:28,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 264 transitions. [2023-08-24 11:35:28,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-24 11:35:28,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 264 transitions. [2023-08-24 11:35:28,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 264 transitions. [2023-08-24 11:35:28,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:35:28,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 264 transitions. [2023-08-24 11:35:28,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 176.0) internal successors, (704), 4 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,970 INFO L175 Difference]: Start difference. First operand has 34 places, 20 transitions, 78 flow. Second operand 3 states and 264 transitions. [2023-08-24 11:35:28,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 30 transitions, 159 flow [2023-08-24 11:35:28,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 30 transitions, 145 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-24 11:35:28,972 INFO L231 Difference]: Finished difference. Result has 30 places, 22 transitions, 85 flow [2023-08-24 11:35:28,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=30, PETRI_TRANSITIONS=22} [2023-08-24 11:35:28,973 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 2 predicate places. [2023-08-24 11:35:28,973 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 22 transitions, 85 flow [2023-08-24 11:35:28,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:28,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:35:28,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:35:28,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 11:35:28,974 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:35:28,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:35:28,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1125892647, now seen corresponding path program 1 times [2023-08-24 11:35:28,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:35:28,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258258827] [2023-08-24 11:35:28,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:35:28,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:35:29,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:35:29,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:35:29,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:35:29,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258258827] [2023-08-24 11:35:29,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258258827] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:35:29,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:35:29,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 11:35:29,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485000887] [2023-08-24 11:35:29,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:35:29,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 11:35:29,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:35:29,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 11:35:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 11:35:29,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 176 [2023-08-24 11:35:29,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 22 transitions, 85 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:35:29,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 176 [2023-08-24 11:35:29,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:35:29,160 INFO L124 PetriNetUnfolderBase]: 25/71 cut-off events. [2023-08-24 11:35:29,160 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-24 11:35:29,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 71 events. 25/71 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 169 event pairs, 13 based on Foata normal form. 8/78 useless extension candidates. Maximal degree in co-relation 192. Up to 41 conditions per place. [2023-08-24 11:35:29,160 INFO L140 encePairwiseOnDemand]: 172/176 looper letters, 22 selfloop transitions, 5 changer transitions 0/30 dead transitions. [2023-08-24 11:35:29,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 30 transitions, 160 flow [2023-08-24 11:35:29,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 11:35:29,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 11:35:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2023-08-24 11:35:29,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4872159090909091 [2023-08-24 11:35:29,162 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 343 transitions. [2023-08-24 11:35:29,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 343 transitions. [2023-08-24 11:35:29,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:35:29,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 343 transitions. [2023-08-24 11:35:29,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,163 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 176.0) internal successors, (880), 5 states have internal predecessors, (880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,163 INFO L175 Difference]: Start difference. First operand has 30 places, 22 transitions, 85 flow. Second operand 4 states and 343 transitions. [2023-08-24 11:35:29,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 30 transitions, 160 flow [2023-08-24 11:35:29,165 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 144 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-08-24 11:35:29,166 INFO L231 Difference]: Finished difference. Result has 31 places, 22 transitions, 86 flow [2023-08-24 11:35:29,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=86, PETRI_PLACES=31, PETRI_TRANSITIONS=22} [2023-08-24 11:35:29,167 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 3 predicate places. [2023-08-24 11:35:29,168 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 22 transitions, 86 flow [2023-08-24 11:35:29,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:35:29,169 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:35:29,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 11:35:29,169 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:35:29,169 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:35:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -398716347, now seen corresponding path program 1 times [2023-08-24 11:35:29,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:35:29,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591907766] [2023-08-24 11:35:29,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:35:29,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:35:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:35:29,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:35:29,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:35:29,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591907766] [2023-08-24 11:35:29,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591907766] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:35:29,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:35:29,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 11:35:29,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976284561] [2023-08-24 11:35:29,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:35:29,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 11:35:29,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:35:29,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 11:35:29,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 11:35:29,535 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 176 [2023-08-24 11:35:29,535 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 22 transitions, 86 flow. Second operand has 7 states, 7 states have (on average 75.28571428571429) internal successors, (527), 7 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:35:29,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 176 [2023-08-24 11:35:29,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:35:29,640 INFO L124 PetriNetUnfolderBase]: 26/81 cut-off events. [2023-08-24 11:35:29,640 INFO L125 PetriNetUnfolderBase]: For 54/55 co-relation queries the response was YES. [2023-08-24 11:35:29,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 229 conditions, 81 events. 26/81 cut-off events. For 54/55 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 218 event pairs, 0 based on Foata normal form. 2/83 useless extension candidates. Maximal degree in co-relation 214. Up to 27 conditions per place. [2023-08-24 11:35:29,640 INFO L140 encePairwiseOnDemand]: 169/176 looper letters, 23 selfloop transitions, 4 changer transitions 12/42 dead transitions. [2023-08-24 11:35:29,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 42 transitions, 242 flow [2023-08-24 11:35:29,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-24 11:35:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-24 11:35:29,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 619 transitions. [2023-08-24 11:35:29,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4396306818181818 [2023-08-24 11:35:29,642 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 619 transitions. [2023-08-24 11:35:29,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 619 transitions. [2023-08-24 11:35:29,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:35:29,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 619 transitions. [2023-08-24 11:35:29,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 77.375) internal successors, (619), 8 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,645 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,645 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 176.0) internal successors, (1584), 9 states have internal predecessors, (1584), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,645 INFO L175 Difference]: Start difference. First operand has 31 places, 22 transitions, 86 flow. Second operand 8 states and 619 transitions. [2023-08-24 11:35:29,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 42 transitions, 242 flow [2023-08-24 11:35:29,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 42 transitions, 222 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-24 11:35:29,647 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 92 flow [2023-08-24 11:35:29,647 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2023-08-24 11:35:29,647 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 11 predicate places. [2023-08-24 11:35:29,647 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 92 flow [2023-08-24 11:35:29,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 75.28571428571429) internal successors, (527), 7 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,648 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:35:29,648 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:35:29,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 11:35:29,648 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:35:29,648 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:35:29,648 INFO L85 PathProgramCache]: Analyzing trace with hash -842376775, now seen corresponding path program 2 times [2023-08-24 11:35:29,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:35:29,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054737456] [2023-08-24 11:35:29,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:35:29,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:35:29,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 11:35:29,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 11:35:29,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 11:35:29,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054737456] [2023-08-24 11:35:29,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054737456] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 11:35:29,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 11:35:29,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 11:35:29,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19683296] [2023-08-24 11:35:29,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 11:35:29,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 11:35:29,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 11:35:29,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 11:35:29,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 11:35:29,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 176 [2023-08-24 11:35:29,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 11:35:29,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 176 [2023-08-24 11:35:29,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 11:35:29,838 INFO L124 PetriNetUnfolderBase]: 38/109 cut-off events. [2023-08-24 11:35:29,838 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-08-24 11:35:29,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 338 conditions, 109 events. 38/109 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 313 event pairs, 13 based on Foata normal form. 1/110 useless extension candidates. Maximal degree in co-relation 326. Up to 52 conditions per place. [2023-08-24 11:35:29,838 INFO L140 encePairwiseOnDemand]: 172/176 looper letters, 19 selfloop transitions, 1 changer transitions 18/38 dead transitions. [2023-08-24 11:35:29,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 239 flow [2023-08-24 11:35:29,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 11:35:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 11:35:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2023-08-24 11:35:29,840 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4636363636363636 [2023-08-24 11:35:29,840 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 408 transitions. [2023-08-24 11:35:29,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 408 transitions. [2023-08-24 11:35:29,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 11:35:29,840 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 408 transitions. [2023-08-24 11:35:29,841 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,842 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,842 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 176.0) internal successors, (1056), 6 states have internal predecessors, (1056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,842 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 92 flow. Second operand 5 states and 408 transitions. [2023-08-24 11:35:29,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 239 flow [2023-08-24 11:35:29,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 217 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-24 11:35:29,843 INFO L231 Difference]: Finished difference. Result has 37 places, 20 transitions, 81 flow [2023-08-24 11:35:29,843 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=176, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=81, PETRI_PLACES=37, PETRI_TRANSITIONS=20} [2023-08-24 11:35:29,845 INFO L281 CegarLoopForPetriNet]: 28 programPoint places, 9 predicate places. [2023-08-24 11:35:29,845 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 20 transitions, 81 flow [2023-08-24 11:35:29,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.6) internal successors, (393), 5 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 11:35:29,845 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 11:35:29,845 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 11:35:29,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 11:35:29,845 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-08-24 11:35:29,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 11:35:29,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1224486683, now seen corresponding path program 3 times [2023-08-24 11:35:29,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 11:35:29,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762484345] [2023-08-24 11:35:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 11:35:29,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 11:35:29,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:35:29,912 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 11:35:29,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 11:35:29,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 11:35:29,971 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 11:35:29,972 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-08-24 11:35:29,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2023-08-24 11:35:29,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-08-24 11:35:29,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-08-24 11:35:29,973 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2023-08-24 11:35:29,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 11:35:29,974 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1] [2023-08-24 11:35:29,977 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 11:35:29,977 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 11:35:30,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 11:35:30 BasicIcfg [2023-08-24 11:35:30,017 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 11:35:30,017 INFO L158 Benchmark]: Toolchain (without parser) took 6168.60ms. Allocated memory was 350.2MB in the beginning and 562.0MB in the end (delta: 211.8MB). Free memory was 324.4MB in the beginning and 515.0MB in the end (delta: -190.7MB). Peak memory consumption was 22.0MB. Max. memory is 16.0GB. [2023-08-24 11:35:30,018 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 350.2MB. Free memory is still 327.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 11:35:30,018 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.37ms. Allocated memory is still 350.2MB. Free memory was 323.8MB in the beginning and 301.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 11:35:30,018 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.06ms. Allocated memory is still 350.2MB. Free memory was 301.0MB in the beginning and 298.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:35:30,018 INFO L158 Benchmark]: Boogie Preprocessor took 31.37ms. Allocated memory is still 350.2MB. Free memory was 298.9MB in the beginning and 296.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 11:35:30,019 INFO L158 Benchmark]: RCFGBuilder took 523.59ms. Allocated memory is still 350.2MB. Free memory was 296.8MB in the beginning and 316.1MB in the end (delta: -19.3MB). Peak memory consumption was 29.0MB. Max. memory is 16.0GB. [2023-08-24 11:35:30,019 INFO L158 Benchmark]: TraceAbstraction took 5125.36ms. Allocated memory was 350.2MB in the beginning and 562.0MB in the end (delta: 211.8MB). Free memory was 315.1MB in the beginning and 515.0MB in the end (delta: -199.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.0GB. [2023-08-24 11:35:30,020 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 350.2MB. Free memory is still 327.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 426.37ms. Allocated memory is still 350.2MB. Free memory was 323.8MB in the beginning and 301.0MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.06ms. Allocated memory is still 350.2MB. Free memory was 301.0MB in the beginning and 298.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.37ms. Allocated memory is still 350.2MB. Free memory was 298.9MB in the beginning and 296.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 523.59ms. Allocated memory is still 350.2MB. Free memory was 296.8MB in the beginning and 316.1MB in the end (delta: -19.3MB). Peak memory consumption was 29.0MB. Max. memory is 16.0GB. * TraceAbstraction took 5125.36ms. Allocated memory was 350.2MB in the beginning and 562.0MB in the end (delta: 211.8MB). Free memory was 315.1MB in the beginning and 515.0MB in the end (delta: -199.9MB). Peak memory consumption was 11.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 97 PlacesBefore, 28 PlacesAfterwards, 92 TransitionsBefore, 22 TransitionsAfterwards, 1272 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 82 TotalNumberOfCompositions, 3709 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1689, independent: 1518, independent conditional: 0, independent unconditional: 1518, dependent: 171, dependent conditional: 0, dependent unconditional: 171, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 707, independent: 686, independent conditional: 0, independent unconditional: 686, dependent: 21, dependent conditional: 0, dependent unconditional: 21, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1689, independent: 832, independent conditional: 0, independent unconditional: 832, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 707, unknown conditional: 0, unknown unconditional: 707] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 64, Positive conditional cache size: 0, Positive unconditional cache size: 64, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L708] 0 int __unbuffered_cnt = 0; [L710] 0 int __unbuffered_p0_EAX = 0; [L712] 0 int __unbuffered_p0_EBX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff1_thd0; [L731] 0 _Bool z$r_buff1_thd1; [L732] 0 _Bool z$r_buff1_thd2; [L733] 0 _Bool z$read_delayed; [L734] 0 int *z$read_delayed_var; [L735] 0 int z$w_buff0; [L736] 0 _Bool z$w_buff0_used; [L737] 0 int z$w_buff1; [L738] 0 _Bool z$w_buff1_used; [L739] 0 _Bool weak$$choice0; [L740] 0 _Bool weak$$choice2; [L822] 0 pthread_t t241; [L823] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t241, ((void *)0), P0, ((void *)0))=-2, t241={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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L744] 1 z$w_buff1 = z$w_buff0 [L745] 1 z$w_buff0 = 1 [L746] 1 z$w_buff1_used = z$w_buff0_used [L747] 1 z$w_buff0_used = (_Bool)1 [L748] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L748] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L749] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L750] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L751] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L824] 0 pthread_t t242; [L755] 1 x = 1 [L758] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t242, ((void *)0), P1, ((void *)0))=-1, t241={5:0}, t242={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L761] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L778] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L785] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L786] 2 z$flush_delayed = weak$$choice2 [L787] 2 z$mem_tmp = z [L788] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L789] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L790] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L791] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L792] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L794] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 __unbuffered_p1_EBX = z [L796] 2 z = z$flush_delayed ? z$mem_tmp : z [L797] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L800] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L801] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L802] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L803] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L804] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L807] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L809] 2 return 0; [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 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) [L832] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L834] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L835] 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}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t241={5:0}, t242={3: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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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] [L838] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L840] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, 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=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=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: 823]: 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: 825]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 115 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 5.0s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 97 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 97 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 513 IncrementalHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 7 mSDtfsCounter, 513 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=7, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 429 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 11:35:30,040 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...