/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-24 05:28:58,631 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-24 05:28:58,705 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-24 05:28:58,710 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-24 05:28:58,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-24 05:28:58,747 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-24 05:28:58,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-24 05:28:58,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-24 05:28:58,750 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-24 05:28:58,753 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-24 05:28:58,754 INFO L153 SettingsManager]: * Use SBE=true [2023-08-24 05:28:58,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-24 05:28:58,754 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-24 05:28:58,755 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-24 05:28:58,756 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-24 05:28:58,756 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-24 05:28:58,756 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-24 05:28:58,756 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-24 05:28:58,756 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-24 05:28:58,757 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-24 05:28:58,757 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-24 05:28:58,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-24 05:28:58,758 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-24 05:28:58,758 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-24 05:28:58,758 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-24 05:28:58,759 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-24 05:28:58,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-24 05:28:58,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:28:58,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-24 05:28:58,760 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-24 05:28:58,761 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-24 05:28:58,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-24 05:28:58,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-24 05:28:58,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-24 05:28:58,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-24 05:28:58,762 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST [2023-08-24 05:28:59,070 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-24 05:28:59,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-24 05:28:59,087 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-24 05:28:59,088 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-24 05:28:59,088 INFO L274 PluginConnector]: CDTParser initialized [2023-08-24 05:28:59,089 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2023-08-24 05:28:59,672 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-24 05:29:00,933 INFO L384 CDTParser]: Found 1 translation units. [2023-08-24 05:29:00,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i [2023-08-24 05:29:00,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f14ac9317/3368b33eb1bb4775af9fba85b84db55d/FLAG205f191c9 [2023-08-24 05:29:00,963 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f14ac9317/3368b33eb1bb4775af9fba85b84db55d [2023-08-24 05:29:00,965 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-24 05:29:00,966 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-24 05:29:00,967 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:00,967 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-24 05:29:00,970 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-24 05:29:00,970 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:00" (1/1) ... [2023-08-24 05:29:00,971 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb94dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:00, skipping insertion in model container [2023-08-24 05:29:00,971 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.08 05:29:00" (1/1) ... [2023-08-24 05:29:01,037 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-24 05:29:01,203 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i[945,958] [2023-08-24 05:29:01,421 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:01,435 INFO L201 MainTranslator]: Completed pre-run [2023-08-24 05:29:01,446 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix035.oepc.i[945,958] [2023-08-24 05:29:01,462 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:01,464 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-24 05:29:01,499 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-24 05:29:01,537 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:01,537 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-24 05:29:01,543 INFO L206 MainTranslator]: Completed translation [2023-08-24 05:29:01,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01 WrapperNode [2023-08-24 05:29:01,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-24 05:29:01,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:01,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-24 05:29:01,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-24 05:29:01,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,615 INFO L138 Inliner]: procedures = 176, calls = 58, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 131 [2023-08-24 05:29:01,615 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-24 05:29:01,616 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-24 05:29:01,616 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-24 05:29:01,616 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-24 05:29:01,624 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,624 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,636 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,636 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,646 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,648 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,650 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,651 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,660 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-24 05:29:01,660 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-24 05:29:01,661 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-24 05:29:01,661 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-24 05:29:01,661 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (1/1) ... [2023-08-24 05:29:01,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-24 05:29:01,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-24 05:29:01,694 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-24 05:29:01,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-24 05:29:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-24 05:29:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-24 05:29:01,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-24 05:29:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-24 05:29:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-24 05:29:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-24 05:29:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-24 05:29:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-24 05:29:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-24 05:29:01,725 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-24 05:29:01,725 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-24 05:29:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-24 05:29:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-24 05:29:01,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-24 05:29:01,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-24 05:29:01,727 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-24 05:29:01,837 INFO L236 CfgBuilder]: Building ICFG [2023-08-24 05:29:01,839 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-24 05:29:02,089 INFO L277 CfgBuilder]: Performing block encoding [2023-08-24 05:29:02,234 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-24 05:29:02,235 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-24 05:29:02,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:02 BoogieIcfgContainer [2023-08-24 05:29:02,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-24 05:29:02,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-24 05:29:02,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-24 05:29:02,245 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-24 05:29:02,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.08 05:29:00" (1/3) ... [2023-08-24 05:29:02,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1714111d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:02, skipping insertion in model container [2023-08-24 05:29:02,246 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.08 05:29:01" (2/3) ... [2023-08-24 05:29:02,246 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1714111d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.08 05:29:02, skipping insertion in model container [2023-08-24 05:29:02,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.08 05:29:02" (3/3) ... [2023-08-24 05:29:02,248 INFO L112 eAbstractionObserver]: Analyzing ICFG mix035.oepc.i [2023-08-24 05:29:02,265 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-24 05:29:02,265 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2023-08-24 05:29:02,267 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-24 05:29:02,336 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-24 05:29:02,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2023-08-24 05:29:02,446 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2023-08-24 05:29:02,446 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:02,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-08-24 05:29:02,453 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2023-08-24 05:29:02,458 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2023-08-24 05:29:02,461 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-24 05:29:02,469 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2023-08-24 05:29:02,473 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2023-08-24 05:29:02,473 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2023-08-24 05:29:02,528 INFO L124 PetriNetUnfolderBase]: 2/110 cut-off events. [2023-08-24 05:29:02,528 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:02,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 60 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 71. Up to 2 conditions per place. [2023-08-24 05:29:02,532 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2023-08-24 05:29:06,199 INFO L134 LiptonReduction]: Checked pairs total: 5817 [2023-08-24 05:29:06,199 INFO L136 LiptonReduction]: Total number of compositions: 99 [2023-08-24 05:29:06,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-24 05:29:06,216 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;@463b4c29, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-24 05:29:06,216 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2023-08-24 05:29:06,218 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-24 05:29:06,218 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-24 05:29:06,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-24 05:29:06,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:06,219 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-24 05:29:06,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:06,223 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:06,224 INFO L85 PathProgramCache]: Analyzing trace with hash 488338, now seen corresponding path program 1 times [2023-08-24 05:29:06,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:06,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557128271] [2023-08-24 05:29:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:06,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:06,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557128271] [2023-08-24 05:29:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557128271] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:06,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:06,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:29:06,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505690410] [2023-08-24 05:29:06,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:06,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:29:06,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:06,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:29:06,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:29:06,599 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 212 [2023-08-24 05:29:06,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 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 05:29:06,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:06,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 212 [2023-08-24 05:29:06,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:06,853 INFO L124 PetriNetUnfolderBase]: 895/1366 cut-off events. [2023-08-24 05:29:06,854 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-08-24 05:29:06,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2749 conditions, 1366 events. 895/1366 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 6061 event pairs, 400 based on Foata normal form. 0/1281 useless extension candidates. Maximal degree in co-relation 2738. Up to 1084 conditions per place. [2023-08-24 05:29:06,869 INFO L140 encePairwiseOnDemand]: 208/212 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2023-08-24 05:29:06,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 161 flow [2023-08-24 05:29:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:06,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2023-08-24 05:29:06,886 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5267295597484277 [2023-08-24 05:29:06,886 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 335 transitions. [2023-08-24 05:29:06,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 335 transitions. [2023-08-24 05:29:06,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:06,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 335 transitions. [2023-08-24 05:29:06,896 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:06,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:06,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:06,901 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 335 transitions. [2023-08-24 05:29:06,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 161 flow [2023-08-24 05:29:06,904 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 38 transitions, 156 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-24 05:29:06,905 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2023-08-24 05:29:06,907 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2023-08-24 05:29:06,911 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-24 05:29:06,911 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2023-08-24 05:29:06,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 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 05:29:06,912 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:06,912 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:06,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-24 05:29:06,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:06,914 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:06,914 INFO L85 PathProgramCache]: Analyzing trace with hash 369847308, now seen corresponding path program 1 times [2023-08-24 05:29:06,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:06,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960239747] [2023-08-24 05:29:06,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:06,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:07,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:07,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960239747] [2023-08-24 05:29:07,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960239747] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:07,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:07,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-24 05:29:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131813042] [2023-08-24 05:29:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:07,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-24 05:29:07,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:07,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-24 05:29:07,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-24 05:29:07,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 212 [2023-08-24 05:29:07,171 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,171 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:07,172 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 212 [2023-08-24 05:29:07,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:07,451 INFO L124 PetriNetUnfolderBase]: 1375/2028 cut-off events. [2023-08-24 05:29:07,452 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-08-24 05:29:07,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4250 conditions, 2028 events. 1375/2028 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8356 event pairs, 597 based on Foata normal form. 8/2036 useless extension candidates. Maximal degree in co-relation 4240. Up to 1953 conditions per place. [2023-08-24 05:29:07,463 INFO L140 encePairwiseOnDemand]: 207/212 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2023-08-24 05:29:07,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 152 flow [2023-08-24 05:29:07,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:07,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:07,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 311 transitions. [2023-08-24 05:29:07,467 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4889937106918239 [2023-08-24 05:29:07,467 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 311 transitions. [2023-08-24 05:29:07,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 311 transitions. [2023-08-24 05:29:07,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:07,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 311 transitions. [2023-08-24 05:29:07,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,471 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,471 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,471 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 311 transitions. [2023-08-24 05:29:07,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 152 flow [2023-08-24 05:29:07,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 34 transitions, 146 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:07,473 INFO L231 Difference]: Finished difference. Result has 32 places, 25 transitions, 76 flow [2023-08-24 05:29:07,474 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=32, PETRI_TRANSITIONS=25} [2023-08-24 05:29:07,475 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2023-08-24 05:29:07,476 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 25 transitions, 76 flow [2023-08-24 05:29:07,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,479 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:07,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:07,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-24 05:29:07,484 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:07,486 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:07,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1979267323, now seen corresponding path program 1 times [2023-08-24 05:29:07,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:07,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949849355] [2023-08-24 05:29:07,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:07,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:07,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:07,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:07,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:07,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949849355] [2023-08-24 05:29:07,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949849355] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:07,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-24 05:29:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706097721] [2023-08-24 05:29:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:07,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:07,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:07,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:07,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:07,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 212 [2023-08-24 05:29:07,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 25 transitions, 76 flow. Second operand has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:07,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 212 [2023-08-24 05:29:07,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:07,944 INFO L124 PetriNetUnfolderBase]: 1269/1880 cut-off events. [2023-08-24 05:29:07,944 INFO L125 PetriNetUnfolderBase]: For 305/305 co-relation queries the response was YES. [2023-08-24 05:29:07,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4290 conditions, 1880 events. 1269/1880 cut-off events. For 305/305 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 7469 event pairs, 405 based on Foata normal form. 42/1922 useless extension candidates. Maximal degree in co-relation 4279. Up to 1316 conditions per place. [2023-08-24 05:29:07,954 INFO L140 encePairwiseOnDemand]: 209/212 looper letters, 32 selfloop transitions, 3 changer transitions 0/35 dead transitions. [2023-08-24 05:29:07,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 35 transitions, 170 flow [2023-08-24 05:29:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-24 05:29:07,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-24 05:29:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-24 05:29:07,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4858490566037736 [2023-08-24 05:29:07,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-24 05:29:07,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-24 05:29:07,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:07,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-24 05:29:07,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 212.0) internal successors, (848), 4 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,960 INFO L175 Difference]: Start difference. First operand has 32 places, 25 transitions, 76 flow. Second operand 3 states and 309 transitions. [2023-08-24 05:29:07,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 35 transitions, 170 flow [2023-08-24 05:29:07,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 35 transitions, 166 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:29:07,962 INFO L231 Difference]: Finished difference. Result has 34 places, 25 transitions, 83 flow [2023-08-24 05:29:07,962 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=34, PETRI_TRANSITIONS=25} [2023-08-24 05:29:07,963 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 0 predicate places. [2023-08-24 05:29:07,963 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 25 transitions, 83 flow [2023-08-24 05:29:07,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.75) internal successors, (379), 4 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:07,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:07,963 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:07,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-24 05:29:07,963 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:07,964 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:07,964 INFO L85 PathProgramCache]: Analyzing trace with hash -1079657249, now seen corresponding path program 1 times [2023-08-24 05:29:07,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:07,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64509135] [2023-08-24 05:29:07,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:07,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:08,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:08,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:08,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64509135] [2023-08-24 05:29:08,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64509135] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:08,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:08,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:08,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325769333] [2023-08-24 05:29:08,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:08,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:08,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:08,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:08,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:08,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2023-08-24 05:29:08,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:08,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2023-08-24 05:29:08,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:08,306 INFO L124 PetriNetUnfolderBase]: 625/1074 cut-off events. [2023-08-24 05:29:08,306 INFO L125 PetriNetUnfolderBase]: For 86/91 co-relation queries the response was YES. [2023-08-24 05:29:08,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2337 conditions, 1074 events. 625/1074 cut-off events. For 86/91 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 5335 event pairs, 129 based on Foata normal form. 108/1161 useless extension candidates. Maximal degree in co-relation 2324. Up to 595 conditions per place. [2023-08-24 05:29:08,312 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 46 selfloop transitions, 8 changer transitions 0/60 dead transitions. [2023-08-24 05:29:08,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 60 transitions, 265 flow [2023-08-24 05:29:08,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-24 05:29:08,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-24 05:29:08,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2023-08-24 05:29:08,315 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49150943396226415 [2023-08-24 05:29:08,315 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 521 transitions. [2023-08-24 05:29:08,315 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 521 transitions. [2023-08-24 05:29:08,315 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:08,315 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 521 transitions. [2023-08-24 05:29:08,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,319 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 212.0) internal successors, (1272), 6 states have internal predecessors, (1272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,319 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 83 flow. Second operand 5 states and 521 transitions. [2023-08-24 05:29:08,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 60 transitions, 265 flow [2023-08-24 05:29:08,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 60 transitions, 259 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:08,321 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 137 flow [2023-08-24 05:29:08,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-24 05:29:08,322 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2023-08-24 05:29:08,322 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 137 flow [2023-08-24 05:29:08,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:08,323 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:08,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-24 05:29:08,323 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:08,324 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:08,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1926249609, now seen corresponding path program 1 times [2023-08-24 05:29:08,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:08,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174889698] [2023-08-24 05:29:08,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:08,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:08,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:08,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:08,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174889698] [2023-08-24 05:29:08,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174889698] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:08,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:08,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:29:08,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44897310] [2023-08-24 05:29:08,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:08,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:08,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:08,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:08,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:08,503 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2023-08-24 05:29:08,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 137 flow. Second operand has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:08,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2023-08-24 05:29:08,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:08,724 INFO L124 PetriNetUnfolderBase]: 470/847 cut-off events. [2023-08-24 05:29:08,725 INFO L125 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2023-08-24 05:29:08,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2374 conditions, 847 events. 470/847 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4227 event pairs, 86 based on Foata normal form. 58/891 useless extension candidates. Maximal degree in co-relation 2358. Up to 264 conditions per place. [2023-08-24 05:29:08,730 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 54 selfloop transitions, 15 changer transitions 8/83 dead transitions. [2023-08-24 05:29:08,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 437 flow [2023-08-24 05:29:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:08,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:08,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 730 transitions. [2023-08-24 05:29:08,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4919137466307278 [2023-08-24 05:29:08,732 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 730 transitions. [2023-08-24 05:29:08,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 730 transitions. [2023-08-24 05:29:08,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:08,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 730 transitions. [2023-08-24 05:29:08,735 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 104.28571428571429) internal successors, (730), 7 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,738 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,738 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 137 flow. Second operand 7 states and 730 transitions. [2023-08-24 05:29:08,739 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 437 flow [2023-08-24 05:29:08,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 83 transitions, 433 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-24 05:29:08,745 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 232 flow [2023-08-24 05:29:08,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=232, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-24 05:29:08,747 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2023-08-24 05:29:08,747 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 232 flow [2023-08-24 05:29:08,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:08,749 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:08,749 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 05:29:08,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-24 05:29:08,749 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:08,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:08,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1222500975, now seen corresponding path program 1 times [2023-08-24 05:29:08,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:08,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579769427] [2023-08-24 05:29:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:08,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:09,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:09,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:09,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579769427] [2023-08-24 05:29:09,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579769427] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:09,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:09,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:29:09,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631355364] [2023-08-24 05:29:09,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:09,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:09,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:09,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:09,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:09,187 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 212 [2023-08-24 05:29:09,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:09,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:09,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 212 [2023-08-24 05:29:09,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:09,529 INFO L124 PetriNetUnfolderBase]: 836/1587 cut-off events. [2023-08-24 05:29:09,529 INFO L125 PetriNetUnfolderBase]: For 3008/3009 co-relation queries the response was YES. [2023-08-24 05:29:09,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5336 conditions, 1587 events. 836/1587 cut-off events. For 3008/3009 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9601 event pairs, 233 based on Foata normal form. 8/1583 useless extension candidates. Maximal degree in co-relation 5316. Up to 760 conditions per place. [2023-08-24 05:29:09,538 INFO L140 encePairwiseOnDemand]: 205/212 looper letters, 81 selfloop transitions, 11 changer transitions 30/128 dead transitions. [2023-08-24 05:29:09,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 128 transitions, 1072 flow [2023-08-24 05:29:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:29:09,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:29:09,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2023-08-24 05:29:09,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4944968553459119 [2023-08-24 05:29:09,540 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 629 transitions. [2023-08-24 05:29:09,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 629 transitions. [2023-08-24 05:29:09,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:09,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 629 transitions. [2023-08-24 05:29:09,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.83333333333333) internal successors, (629), 6 states have internal predecessors, (629), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:09,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:09,544 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:09,544 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 232 flow. Second operand 6 states and 629 transitions. [2023-08-24 05:29:09,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 128 transitions, 1072 flow [2023-08-24 05:29:09,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 128 transitions, 921 flow, removed 57 selfloop flow, removed 2 redundant places. [2023-08-24 05:29:09,572 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 271 flow [2023-08-24 05:29:09,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2023-08-24 05:29:09,574 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2023-08-24 05:29:09,574 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 271 flow [2023-08-24 05:29:09,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.2) internal successors, (486), 5 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:09,575 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:09,575 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 05:29:09,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-24 05:29:09,575 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:09,575 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:09,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1062810443, now seen corresponding path program 2 times [2023-08-24 05:29:09,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:09,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818592028] [2023-08-24 05:29:09,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:09,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:09,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:09,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:09,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818592028] [2023-08-24 05:29:09,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818592028] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:09,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:09,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:29:09,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392635838] [2023-08-24 05:29:09,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:09,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-24 05:29:09,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-24 05:29:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-24 05:29:09,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2023-08-24 05:29:09,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:09,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:09,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2023-08-24 05:29:09,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:10,111 INFO L124 PetriNetUnfolderBase]: 667/1270 cut-off events. [2023-08-24 05:29:10,111 INFO L125 PetriNetUnfolderBase]: For 2215/2215 co-relation queries the response was YES. [2023-08-24 05:29:10,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4465 conditions, 1270 events. 667/1270 cut-off events. For 2215/2215 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7538 event pairs, 72 based on Foata normal form. 32/1287 useless extension candidates. Maximal degree in co-relation 4441. Up to 302 conditions per place. [2023-08-24 05:29:10,118 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 76 selfloop transitions, 17 changer transitions 26/125 dead transitions. [2023-08-24 05:29:10,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 125 transitions, 854 flow [2023-08-24 05:29:10,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-24 05:29:10,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-24 05:29:10,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 915 transitions. [2023-08-24 05:29:10,121 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47955974842767296 [2023-08-24 05:29:10,122 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 915 transitions. [2023-08-24 05:29:10,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 915 transitions. [2023-08-24 05:29:10,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:10,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 915 transitions. [2023-08-24 05:29:10,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 101.66666666666667) internal successors, (915), 9 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,127 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,127 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 212.0) internal successors, (2120), 10 states have internal predecessors, (2120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,127 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 271 flow. Second operand 9 states and 915 transitions. [2023-08-24 05:29:10,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 125 transitions, 854 flow [2023-08-24 05:29:10,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 125 transitions, 847 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-24 05:29:10,141 INFO L231 Difference]: Finished difference. Result has 64 places, 45 transitions, 299 flow [2023-08-24 05:29:10,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=299, PETRI_PLACES=64, PETRI_TRANSITIONS=45} [2023-08-24 05:29:10,142 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2023-08-24 05:29:10,143 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 45 transitions, 299 flow [2023-08-24 05:29:10,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.66666666666667) internal successors, (574), 6 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:10,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:10,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-24 05:29:10,143 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:10,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:10,144 INFO L85 PathProgramCache]: Analyzing trace with hash -558304891, now seen corresponding path program 1 times [2023-08-24 05:29:10,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:10,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095291120] [2023-08-24 05:29:10,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:10,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:10,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:10,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:10,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:10,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095291120] [2023-08-24 05:29:10,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095291120] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:10,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:10,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-24 05:29:10,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992956282] [2023-08-24 05:29:10,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:10,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-24 05:29:10,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:10,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-24 05:29:10,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-24 05:29:10,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 212 [2023-08-24 05:29:10,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 45 transitions, 299 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:10,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 212 [2023-08-24 05:29:10,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:10,773 INFO L124 PetriNetUnfolderBase]: 1356/2351 cut-off events. [2023-08-24 05:29:10,774 INFO L125 PetriNetUnfolderBase]: For 5487/5487 co-relation queries the response was YES. [2023-08-24 05:29:10,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9133 conditions, 2351 events. 1356/2351 cut-off events. For 5487/5487 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 13379 event pairs, 173 based on Foata normal form. 1/2352 useless extension candidates. Maximal degree in co-relation 9111. Up to 1183 conditions per place. [2023-08-24 05:29:10,784 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 50 selfloop transitions, 4 changer transitions 54/108 dead transitions. [2023-08-24 05:29:10,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 108 transitions, 933 flow [2023-08-24 05:29:10,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:29:10,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:29:10,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 600 transitions. [2023-08-24 05:29:10,786 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4716981132075472 [2023-08-24 05:29:10,786 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 600 transitions. [2023-08-24 05:29:10,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 600 transitions. [2023-08-24 05:29:10,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:10,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 600 transitions. [2023-08-24 05:29:10,788 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,790 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,790 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,790 INFO L175 Difference]: Start difference. First operand has 64 places, 45 transitions, 299 flow. Second operand 6 states and 600 transitions. [2023-08-24 05:29:10,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 108 transitions, 933 flow [2023-08-24 05:29:10,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 108 transitions, 786 flow, removed 35 selfloop flow, removed 10 redundant places. [2023-08-24 05:29:10,815 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 196 flow [2023-08-24 05:29:10,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=196, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-08-24 05:29:10,815 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2023-08-24 05:29:10,815 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 196 flow [2023-08-24 05:29:10,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:10,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:10,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-24 05:29:10,816 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:10,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1420107805, now seen corresponding path program 2 times [2023-08-24 05:29:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133284719] [2023-08-24 05:29:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:10,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:10,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:10,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133284719] [2023-08-24 05:29:10,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133284719] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:10,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:10,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-24 05:29:10,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615056508] [2023-08-24 05:29:10,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:10,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-24 05:29:10,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:10,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-24 05:29:10,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-24 05:29:10,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 212 [2023-08-24 05:29:10,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:10,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:10,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 212 [2023-08-24 05:29:10,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:11,133 INFO L124 PetriNetUnfolderBase]: 361/713 cut-off events. [2023-08-24 05:29:11,133 INFO L125 PetriNetUnfolderBase]: For 834/839 co-relation queries the response was YES. [2023-08-24 05:29:11,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2433 conditions, 713 events. 361/713 cut-off events. For 834/839 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3492 event pairs, 72 based on Foata normal form. 1/714 useless extension candidates. Maximal degree in co-relation 2414. Up to 318 conditions per place. [2023-08-24 05:29:11,137 INFO L140 encePairwiseOnDemand]: 209/212 looper letters, 33 selfloop transitions, 1 changer transitions 37/73 dead transitions. [2023-08-24 05:29:11,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 73 transitions, 524 flow [2023-08-24 05:29:11,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-24 05:29:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-24 05:29:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2023-08-24 05:29:11,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4988207547169811 [2023-08-24 05:29:11,138 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2023-08-24 05:29:11,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2023-08-24 05:29:11,139 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:11,139 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2023-08-24 05:29:11,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,141 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,141 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,141 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 196 flow. Second operand 4 states and 423 transitions. [2023-08-24 05:29:11,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 73 transitions, 524 flow [2023-08-24 05:29:11,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 490 flow, removed 15 selfloop flow, removed 6 redundant places. [2023-08-24 05:29:11,145 INFO L231 Difference]: Finished difference. Result has 50 places, 32 transitions, 156 flow [2023-08-24 05:29:11,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=50, PETRI_TRANSITIONS=32} [2023-08-24 05:29:11,146 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2023-08-24 05:29:11,146 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 32 transitions, 156 flow [2023-08-24 05:29:11,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.0) internal successors, (400), 4 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,146 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:11,146 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:11,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-24 05:29:11,146 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:11,147 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:11,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1604724067, now seen corresponding path program 3 times [2023-08-24 05:29:11,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:11,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348011997] [2023-08-24 05:29:11,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:11,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:11,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:11,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:11,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348011997] [2023-08-24 05:29:11,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348011997] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:11,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:11,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:29:11,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539304923] [2023-08-24 05:29:11,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:11,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:29:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:11,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:29:11,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:29:11,789 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 212 [2023-08-24 05:29:11,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 32 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:11,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 212 [2023-08-24 05:29:11,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:11,943 INFO L124 PetriNetUnfolderBase]: 149/307 cut-off events. [2023-08-24 05:29:11,943 INFO L125 PetriNetUnfolderBase]: For 408/420 co-relation queries the response was YES. [2023-08-24 05:29:11,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 307 events. 149/307 cut-off events. For 408/420 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1136 event pairs, 34 based on Foata normal form. 13/319 useless extension candidates. Maximal degree in co-relation 1048. Up to 150 conditions per place. [2023-08-24 05:29:11,945 INFO L140 encePairwiseOnDemand]: 206/212 looper letters, 30 selfloop transitions, 4 changer transitions 27/64 dead transitions. [2023-08-24 05:29:11,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 425 flow [2023-08-24 05:29:11,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-24 05:29:11,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-24 05:29:11,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 606 transitions. [2023-08-24 05:29:11,947 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47641509433962265 [2023-08-24 05:29:11,947 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 606 transitions. [2023-08-24 05:29:11,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 606 transitions. [2023-08-24 05:29:11,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:11,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 606 transitions. [2023-08-24 05:29:11,949 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.0) internal successors, (606), 6 states have internal predecessors, (606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,951 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 212.0) internal successors, (1484), 7 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,952 INFO L175 Difference]: Start difference. First operand has 50 places, 32 transitions, 156 flow. Second operand 6 states and 606 transitions. [2023-08-24 05:29:11,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 425 flow [2023-08-24 05:29:11,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 64 transitions, 409 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-08-24 05:29:11,954 INFO L231 Difference]: Finished difference. Result has 52 places, 30 transitions, 148 flow [2023-08-24 05:29:11,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=148, PETRI_PLACES=52, PETRI_TRANSITIONS=30} [2023-08-24 05:29:11,955 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2023-08-24 05:29:11,955 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 30 transitions, 148 flow [2023-08-24 05:29:11,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 95.71428571428571) internal successors, (670), 7 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:11,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:11,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:11,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-24 05:29:11,956 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:11,956 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:11,956 INFO L85 PathProgramCache]: Analyzing trace with hash -207534853, now seen corresponding path program 4 times [2023-08-24 05:29:11,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:11,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015086727] [2023-08-24 05:29:11,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-24 05:29:12,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-24 05:29:12,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-24 05:29:12,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015086727] [2023-08-24 05:29:12,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015086727] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-24 05:29:12,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-24 05:29:12,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-24 05:29:12,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782741897] [2023-08-24 05:29:12,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-24 05:29:12,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-24 05:29:12,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-24 05:29:12,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-24 05:29:12,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-24 05:29:12,723 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 212 [2023-08-24 05:29:12,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 30 transitions, 148 flow. Second operand has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-24 05:29:12,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 212 [2023-08-24 05:29:12,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-24 05:29:12,961 INFO L124 PetriNetUnfolderBase]: 116/261 cut-off events. [2023-08-24 05:29:12,961 INFO L125 PetriNetUnfolderBase]: For 340/342 co-relation queries the response was YES. [2023-08-24 05:29:12,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 261 events. 116/261 cut-off events. For 340/342 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 980 event pairs, 12 based on Foata normal form. 1/262 useless extension candidates. Maximal degree in co-relation 906. Up to 89 conditions per place. [2023-08-24 05:29:12,963 INFO L140 encePairwiseOnDemand]: 204/212 looper letters, 44 selfloop transitions, 6 changer transitions 22/75 dead transitions. [2023-08-24 05:29:12,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 75 transitions, 513 flow [2023-08-24 05:29:12,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-24 05:29:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-24 05:29:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 686 transitions. [2023-08-24 05:29:12,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46226415094339623 [2023-08-24 05:29:12,965 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 686 transitions. [2023-08-24 05:29:12,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 686 transitions. [2023-08-24 05:29:12,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-24 05:29:12,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 686 transitions. [2023-08-24 05:29:12,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 98.0) internal successors, (686), 7 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,970 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 212.0) internal successors, (1696), 8 states have internal predecessors, (1696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,970 INFO L175 Difference]: Start difference. First operand has 52 places, 30 transitions, 148 flow. Second operand 7 states and 686 transitions. [2023-08-24 05:29:12,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 75 transitions, 513 flow [2023-08-24 05:29:12,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 75 transitions, 499 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-08-24 05:29:12,972 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 174 flow [2023-08-24 05:29:12,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=212, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=174, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2023-08-24 05:29:12,973 INFO L281 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2023-08-24 05:29:12,973 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 174 flow [2023-08-24 05:29:12,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.71428571428571) internal successors, (656), 7 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-24 05:29:12,974 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-24 05:29:12,974 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-24 05:29:12,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-24 05:29:12,974 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2023-08-24 05:29:12,974 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-24 05:29:12,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1477460039, now seen corresponding path program 5 times [2023-08-24 05:29:12,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-24 05:29:12,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742843823] [2023-08-24 05:29:12,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-24 05:29:12,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-24 05:29:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:29:13,037 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-24 05:29:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-24 05:29:13,121 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-24 05:29:13,121 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-24 05:29:13,122 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2023-08-24 05:29:13,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2023-08-24 05:29:13,126 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2023-08-24 05:29:13,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2023-08-24 05:29:13,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2023-08-24 05:29:13,128 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2023-08-24 05:29:13,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-24 05:29:13,128 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1] [2023-08-24 05:29:13,133 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-24 05:29:13,133 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-24 05:29:13,191 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.08 05:29:13 BasicIcfg [2023-08-24 05:29:13,192 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-24 05:29:13,192 INFO L158 Benchmark]: Toolchain (without parser) took 12225.75ms. Allocated memory was 346.0MB in the beginning and 599.8MB in the end (delta: 253.8MB). Free memory was 320.5MB in the beginning and 357.2MB in the end (delta: -36.7MB). Peak memory consumption was 219.3MB. Max. memory is 16.0GB. [2023-08-24 05:29:13,192 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 346.0MB. Free memory was 323.7MB in the beginning and 323.6MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-24 05:29:13,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 576.66ms. Allocated memory is still 346.0MB. Free memory was 320.5MB in the beginning and 296.8MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-24 05:29:13,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.27ms. Allocated memory is still 346.0MB. Free memory was 296.8MB in the beginning and 294.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:29:13,193 INFO L158 Benchmark]: Boogie Preprocessor took 44.24ms. Allocated memory is still 346.0MB. Free memory was 294.5MB in the beginning and 292.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-24 05:29:13,193 INFO L158 Benchmark]: RCFGBuilder took 580.43ms. Allocated memory is still 346.0MB. Free memory was 292.6MB in the beginning and 255.8MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. [2023-08-24 05:29:13,194 INFO L158 Benchmark]: TraceAbstraction took 10949.13ms. Allocated memory was 346.0MB in the beginning and 599.8MB in the end (delta: 253.8MB). Free memory was 254.9MB in the beginning and 357.2MB in the end (delta: -102.3MB). Peak memory consumption was 154.3MB. Max. memory is 16.0GB. [2023-08-24 05:29:13,195 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 346.0MB. Free memory was 323.7MB in the beginning and 323.6MB in the end (delta: 157.4kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 576.66ms. Allocated memory is still 346.0MB. Free memory was 320.5MB in the beginning and 296.8MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 70.27ms. Allocated memory is still 346.0MB. Free memory was 296.8MB in the beginning and 294.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 44.24ms. Allocated memory is still 346.0MB. Free memory was 294.5MB in the beginning and 292.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 580.43ms. Allocated memory is still 346.0MB. Free memory was 292.6MB in the beginning and 255.8MB in the end (delta: 36.8MB). Peak memory consumption was 37.7MB. Max. memory is 16.0GB. * TraceAbstraction took 10949.13ms. Allocated memory was 346.0MB in the beginning and 599.8MB in the end (delta: 253.8MB). Free memory was 254.9MB in the beginning and 357.2MB in the end (delta: -102.3MB). Peak memory consumption was 154.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.7s, 118 PlacesBefore, 34 PlacesAfterwards, 110 TransitionsBefore, 25 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 99 TotalNumberOfCompositions, 5817 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2639, independent: 2442, independent conditional: 0, independent unconditional: 2442, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1167, independent: 1129, independent conditional: 0, independent unconditional: 1129, dependent: 38, dependent conditional: 0, dependent unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2639, independent: 1313, independent conditional: 0, independent unconditional: 1313, dependent: 159, dependent conditional: 0, dependent unconditional: 159, unknown: 1167, unknown conditional: 0, unknown unconditional: 1167] , Statistics on independence cache: Total cache size (in pairs): 88, Positive cache size: 72, Positive conditional cache size: 0, Positive unconditional cache size: 72, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L719] 0 int a = 0; [L720] 0 _Bool a$flush_delayed; [L721] 0 int a$mem_tmp; [L722] 0 _Bool a$r_buff0_thd0; [L723] 0 _Bool a$r_buff0_thd1; [L724] 0 _Bool a$r_buff0_thd2; [L725] 0 _Bool a$r_buff0_thd3; [L726] 0 _Bool a$r_buff1_thd0; [L727] 0 _Bool a$r_buff1_thd1; [L728] 0 _Bool a$r_buff1_thd2; [L729] 0 _Bool a$r_buff1_thd3; [L730] 0 _Bool a$read_delayed; [L731] 0 int *a$read_delayed_var; [L732] 0 int a$w_buff0; [L733] 0 _Bool a$w_buff0_used; [L734] 0 int a$w_buff1; [L735] 0 _Bool a$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L743] 0 int z = 0; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t913; [L846] FCALL, FORK 0 pthread_create(&t913, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t913, ((void *)0), P0, ((void *)0))=-3, t913={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t914; [L848] FCALL, FORK 0 pthread_create(&t914, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t914, ((void *)0), P1, ((void *)0))=-2, t913={5:0}, t914={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L849] 0 pthread_t t915; [L850] FCALL, FORK 0 pthread_create(&t915, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t915, ((void *)0), P2, ((void *)0))=-1, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L749] 1 a$w_buff1 = a$w_buff0 [L750] 1 a$w_buff0 = 1 [L751] 1 a$w_buff1_used = a$w_buff0_used [L752] 1 a$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L754] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L755] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L756] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L757] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L781] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L798] 3 y = 1 [L801] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L804] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 2 return 0; [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 a$flush_delayed = weak$$choice2 [L810] 3 a$mem_tmp = a [L811] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L812] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L813] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L814] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L815] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L817] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = a [L819] 3 a = a$flush_delayed ? a$mem_tmp : a [L820] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1] [L823] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L824] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L825] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L826] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L827] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L857] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L858] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L859] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L860] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t913={5:0}, t914={6:0}, t915={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, 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: 850]: 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: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 142 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 299 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 299 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1027 IncrementalHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 13 mSDtfsCounter, 1027 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=299occurred in iteration=7, InterpolantAutomatonStates: 59, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 1331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-24 05:29:13,219 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...