/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:26:14,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:26:14,314 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-26 21:26:14,319 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:26:14,319 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:26:14,349 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:26:14,350 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:26:14,350 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:26:14,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:26:14,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:26:14,353 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:26:14,354 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:26:14,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:26:14,355 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:26:14,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:26:14,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:26:14,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:26:14,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:26:14,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:26:14,356 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:26:14,356 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:26:14,357 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:26:14,357 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:26:14,357 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:26:14,358 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:26:14,358 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:26:14,358 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:26:14,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:26:14,358 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:26:14,358 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:26:14,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:26:14,359 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:26:14,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:26:14,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:26:14,360 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:26:14,360 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.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:26:14,632 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:26:14,653 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:26:14,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:26:14,656 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:26:14,656 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:26:14,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i [2023-08-26 21:26:15,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:26:15,963 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:26:15,964 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe016_power.opt.i [2023-08-26 21:26:15,973 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61e8ae37/7a0b902424ff4f07bde4e841d3eaf07e/FLAG413b12340 [2023-08-26 21:26:15,982 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a61e8ae37/7a0b902424ff4f07bde4e841d3eaf07e [2023-08-26 21:26:15,983 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:26:15,984 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:26:15,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:26:15,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:26:15,986 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:26:15,987 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:26:15" (1/1) ... [2023-08-26 21:26:15,987 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b052b88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:15, skipping insertion in model container [2023-08-26 21:26:15,987 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:26:15" (1/1) ... [2023-08-26 21:26:16,028 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:26:16,305 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:26:16,318 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:26:16,343 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:26:16,344 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-26 21:26:16,385 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:26:16,418 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:26:16,418 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:26:16,423 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:26:16,423 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16 WrapperNode [2023-08-26 21:26:16,423 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:26:16,424 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:26:16,424 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:26:16,424 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:26:16,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,455 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,481 INFO L138 Inliner]: procedures = 177, calls = 92, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 187 [2023-08-26 21:26:16,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:26:16,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:26:16,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:26:16,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:26:16,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,501 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,511 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,513 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,515 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,531 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:26:16,531 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:26:16,531 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:26:16,531 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:26:16,532 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (1/1) ... [2023-08-26 21:26:16,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:26:16,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:26:16,556 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-26 21:26:16,584 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-26 21:26:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 21:26:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:26:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:26:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:26:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:26:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:26:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:26:16,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:26:16,606 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:26:16,606 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:26:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:26:16,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:26:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:26:16,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:26:16,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:26:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:26:16,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:26:16,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:26:16,609 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:26:16,754 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:26:16,755 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:26:17,069 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:26:17,273 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:26:17,274 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:26:17,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:26:17 BoogieIcfgContainer [2023-08-26 21:26:17,275 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:26:17,277 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:26:17,277 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:26:17,279 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:26:17,279 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:26:15" (1/3) ... [2023-08-26 21:26:17,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d421043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:26:17, skipping insertion in model container [2023-08-26 21:26:17,280 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:16" (2/3) ... [2023-08-26 21:26:17,280 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d421043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:26:17, skipping insertion in model container [2023-08-26 21:26:17,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:26:17" (3/3) ... [2023-08-26 21:26:17,281 INFO L112 eAbstractionObserver]: Analyzing ICFG safe016_power.opt.i [2023-08-26 21:26:17,293 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:26:17,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-26 21:26:17,294 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:26:17,381 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:26:17,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 156 transitions, 332 flow [2023-08-26 21:26:17,453 INFO L124 PetriNetUnfolderBase]: 3/152 cut-off events. [2023-08-26 21:26:17,453 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:26:17,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 152 events. 3/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 101 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 21:26:17,458 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 156 transitions, 332 flow [2023-08-26 21:26:17,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 152 transitions, 316 flow [2023-08-26 21:26:17,463 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:26:17,468 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 152 transitions, 316 flow [2023-08-26 21:26:17,470 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 152 transitions, 316 flow [2023-08-26 21:26:17,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 152 transitions, 316 flow [2023-08-26 21:26:17,495 INFO L124 PetriNetUnfolderBase]: 3/152 cut-off events. [2023-08-26 21:26:17,495 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:26:17,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 152 events. 3/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 100 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-08-26 21:26:17,498 INFO L119 LiptonReduction]: Number of co-enabled transitions 3974 [2023-08-26 21:26:24,223 INFO L134 LiptonReduction]: Checked pairs total: 16268 [2023-08-26 21:26:24,223 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-08-26 21:26:24,238 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:26:24,242 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;@26ee4a61, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:26:24,242 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-26 21:26:24,245 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:26:24,245 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2023-08-26 21:26:24,245 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:26:24,245 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:24,245 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-26 21:26:24,245 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:26:24,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:24,248 INFO L85 PathProgramCache]: Analyzing trace with hash 248123560, now seen corresponding path program 1 times [2023-08-26 21:26:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:24,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832556987] [2023-08-26 21:26:24,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:24,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-26 21:26:24,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:24,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832556987] [2023-08-26 21:26:24,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832556987] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:24,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:24,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:26:24,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800271715] [2023-08-26 21:26:24,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:24,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:26:24,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:24,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:26:24,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:26:24,533 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-08-26 21:26:24,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-26 21:26:24,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:24,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-08-26 21:26:24,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:26,898 INFO L124 PetriNetUnfolderBase]: 14811/20379 cut-off events. [2023-08-26 21:26:26,899 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2023-08-26 21:26:26,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41031 conditions, 20379 events. 14811/20379 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 114561 event pairs, 4112 based on Foata normal form. 752/14379 useless extension candidates. Maximal degree in co-relation 41019. Up to 18147 conditions per place. [2023-08-26 21:26:27,019 INFO L140 encePairwiseOnDemand]: 276/290 looper letters, 53 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2023-08-26 21:26:27,019 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 60 transitions, 257 flow [2023-08-26 21:26:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:26:27,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:26:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-26 21:26:27,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160919540229885 [2023-08-26 21:26:27,033 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-26 21:26:27,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-26 21:26:27,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:27,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-26 21:26:27,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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-26 21:26:27,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 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-26 21:26:27,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 290.0) internal successors, (1160), 4 states have internal predecessors, (1160), 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-26 21:26:27,046 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 449 transitions. [2023-08-26 21:26:27,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 60 transitions, 257 flow [2023-08-26 21:26:27,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 250 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:26:27,051 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 127 flow [2023-08-26 21:26:27,052 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 21:26:27,054 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-26 21:26:27,055 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 127 flow [2023-08-26 21:26:27,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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-26 21:26:27,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:27,055 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:27,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:26:27,056 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:26:27,061 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:27,061 INFO L85 PathProgramCache]: Analyzing trace with hash 988101278, now seen corresponding path program 1 times [2023-08-26 21:26:27,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:27,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616222793] [2023-08-26 21:26:27,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:27,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:27,180 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-26 21:26:27,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:27,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616222793] [2023-08-26 21:26:27,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616222793] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:27,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:27,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:26:27,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400794854] [2023-08-26 21:26:27,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:27,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:27,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:27,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:27,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:27,183 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-08-26 21:26:27,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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-26 21:26:27,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:27,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-08-26 21:26:27,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:28,707 INFO L124 PetriNetUnfolderBase]: 9087/12477 cut-off events. [2023-08-26 21:26:28,708 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2023-08-26 21:26:28,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30342 conditions, 12477 events. 9087/12477 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 65878 event pairs, 2380 based on Foata normal form. 0/9799 useless extension candidates. Maximal degree in co-relation 30331. Up to 10244 conditions per place. [2023-08-26 21:26:28,806 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 49 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-26 21:26:28,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 56 transitions, 265 flow [2023-08-26 21:26:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:26:28,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:26:28,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-26 21:26:28,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879310344827586 [2023-08-26 21:26:28,808 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-26 21:26:28,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-26 21:26:28,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:28,809 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-26 21:26:28,810 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 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-26 21:26:28,812 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 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-26 21:26:28,812 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 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-26 21:26:28,812 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 127 flow. Second operand 4 states and 566 transitions. [2023-08-26 21:26:28,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 56 transitions, 265 flow [2023-08-26 21:26:28,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 56 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:28,815 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 116 flow [2023-08-26 21:26:28,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-26 21:26:28,816 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2023-08-26 21:26:28,816 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 116 flow [2023-08-26 21:26:28,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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-26 21:26:28,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:28,816 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:28,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:26:28,816 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:26:28,817 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:28,817 INFO L85 PathProgramCache]: Analyzing trace with hash 988101279, now seen corresponding path program 1 times [2023-08-26 21:26:28,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:28,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505032359] [2023-08-26 21:26:28,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:28,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:28,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:28,860 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-26 21:26:28,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:28,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505032359] [2023-08-26 21:26:28,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505032359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:28,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:28,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:26:28,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925384829] [2023-08-26 21:26:28,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:28,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:28,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:28,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:28,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:28,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-08-26 21:26:28,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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-26 21:26:28,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:28,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-08-26 21:26:28,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:29,781 INFO L124 PetriNetUnfolderBase]: 6039/8347 cut-off events. [2023-08-26 21:26:29,781 INFO L125 PetriNetUnfolderBase]: For 2200/2200 co-relation queries the response was YES. [2023-08-26 21:26:29,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20041 conditions, 8347 events. 6039/8347 cut-off events. For 2200/2200 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 42397 event pairs, 1645 based on Foata normal form. 0/7361 useless extension candidates. Maximal degree in co-relation 20029. Up to 3132 conditions per place. [2023-08-26 21:26:29,808 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 67 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2023-08-26 21:26:29,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 370 flow [2023-08-26 21:26:29,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:26:29,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:26:29,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2023-08-26 21:26:29,810 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.506896551724138 [2023-08-26 21:26:29,810 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 588 transitions. [2023-08-26 21:26:29,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 588 transitions. [2023-08-26 21:26:29,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:29,810 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 588 transitions. [2023-08-26 21:26:29,811 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 147.0) internal successors, (588), 4 states have internal predecessors, (588), 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-26 21:26:29,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 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-26 21:26:29,813 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 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-26 21:26:29,814 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 116 flow. Second operand 4 states and 588 transitions. [2023-08-26 21:26:29,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 370 flow [2023-08-26 21:26:29,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 78 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:26:29,816 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 168 flow [2023-08-26 21:26:29,816 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-26 21:26:29,817 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-26 21:26:29,817 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 168 flow [2023-08-26 21:26:29,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 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-26 21:26:29,817 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:29,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:29,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:26:29,818 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:26:29,818 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:29,818 INFO L85 PathProgramCache]: Analyzing trace with hash 945735384, now seen corresponding path program 1 times [2023-08-26 21:26:29,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:29,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551234950] [2023-08-26 21:26:29,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:29,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:30,070 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-26 21:26:30,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:30,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551234950] [2023-08-26 21:26:30,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551234950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:30,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:30,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:26:30,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683882496] [2023-08-26 21:26:30,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:30,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:30,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:30,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:30,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:30,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 290 [2023-08-26 21:26:30,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 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-26 21:26:30,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:30,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 290 [2023-08-26 21:26:30,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:31,285 INFO L124 PetriNetUnfolderBase]: 6874/9860 cut-off events. [2023-08-26 21:26:31,285 INFO L125 PetriNetUnfolderBase]: For 6820/6820 co-relation queries the response was YES. [2023-08-26 21:26:31,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27220 conditions, 9860 events. 6874/9860 cut-off events. For 6820/6820 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 53822 event pairs, 1624 based on Foata normal form. 0/8853 useless extension candidates. Maximal degree in co-relation 27207. Up to 6599 conditions per place. [2023-08-26 21:26:31,329 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 106 selfloop transitions, 4 changer transitions 0/112 dead transitions. [2023-08-26 21:26:31,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 112 transitions, 728 flow [2023-08-26 21:26:31,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:26:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:26:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 729 transitions. [2023-08-26 21:26:31,331 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5027586206896552 [2023-08-26 21:26:31,332 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 729 transitions. [2023-08-26 21:26:31,332 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 729 transitions. [2023-08-26 21:26:31,332 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:31,332 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 729 transitions. [2023-08-26 21:26:31,334 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.8) internal successors, (729), 5 states have internal predecessors, (729), 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-26 21:26:31,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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-26 21:26:31,336 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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-26 21:26:31,336 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 168 flow. Second operand 5 states and 729 transitions. [2023-08-26 21:26:31,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 112 transitions, 728 flow [2023-08-26 21:26:31,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 112 transitions, 670 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-26 21:26:31,342 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 174 flow [2023-08-26 21:26:31,343 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=174, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-08-26 21:26:31,343 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-08-26 21:26:31,343 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 174 flow [2023-08-26 21:26:31,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 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-26 21:26:31,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:31,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:31,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:26:31,344 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:26:31,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:31,344 INFO L85 PathProgramCache]: Analyzing trace with hash -746998250, now seen corresponding path program 1 times [2023-08-26 21:26:31,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:31,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459734462] [2023-08-26 21:26:31,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:31,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:31,514 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-26 21:26:31,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459734462] [2023-08-26 21:26:31,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459734462] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:31,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:31,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:26:31,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118568743] [2023-08-26 21:26:31,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:31,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:26:31,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:31,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:26:31,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:26:31,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 290 [2023-08-26 21:26:31,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 174 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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-26 21:26:31,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:31,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 290 [2023-08-26 21:26:31,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:33,812 INFO L124 PetriNetUnfolderBase]: 13888/19800 cut-off events. [2023-08-26 21:26:33,813 INFO L125 PetriNetUnfolderBase]: For 9336/9336 co-relation queries the response was YES. [2023-08-26 21:26:33,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53223 conditions, 19800 events. 13888/19800 cut-off events. For 9336/9336 co-relation queries the response was YES. Maximal size of possible extension queue 796. Compared 116826 event pairs, 1579 based on Foata normal form. 286/18540 useless extension candidates. Maximal degree in co-relation 53207. Up to 7157 conditions per place. [2023-08-26 21:26:33,876 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 140 selfloop transitions, 11 changer transitions 0/152 dead transitions. [2023-08-26 21:26:33,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 152 transitions, 923 flow [2023-08-26 21:26:33,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:26:33,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:26:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 997 transitions. [2023-08-26 21:26:33,878 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4911330049261084 [2023-08-26 21:26:33,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 997 transitions. [2023-08-26 21:26:33,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 997 transitions. [2023-08-26 21:26:33,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:33,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 997 transitions. [2023-08-26 21:26:33,881 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.42857142857142) internal successors, (997), 7 states have internal predecessors, (997), 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-26 21:26:33,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 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-26 21:26:33,883 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 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-26 21:26:33,883 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 174 flow. Second operand 7 states and 997 transitions. [2023-08-26 21:26:33,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 152 transitions, 923 flow [2023-08-26 21:26:33,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 152 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:33,904 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 263 flow [2023-08-26 21:26:33,904 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=263, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-08-26 21:26:33,905 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-26 21:26:33,905 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 263 flow [2023-08-26 21:26:33,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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-26 21:26:33,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:33,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:33,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:26:33,905 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:26:33,906 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:33,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1681805651, now seen corresponding path program 1 times [2023-08-26 21:26:33,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:33,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849052224] [2023-08-26 21:26:33,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:33,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:33,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:34,054 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-26 21:26:34,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:34,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849052224] [2023-08-26 21:26:34,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849052224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:34,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:34,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:26:34,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434123492] [2023-08-26 21:26:34,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:34,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:34,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:34,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:34,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:34,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 290 [2023-08-26 21:26:34,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 263 flow. Second operand has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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-26 21:26:34,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:34,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 290 [2023-08-26 21:26:34,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:36,576 INFO L124 PetriNetUnfolderBase]: 16126/23653 cut-off events. [2023-08-26 21:26:36,577 INFO L125 PetriNetUnfolderBase]: For 22554/22554 co-relation queries the response was YES. [2023-08-26 21:26:36,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70057 conditions, 23653 events. 16126/23653 cut-off events. For 22554/22554 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 153721 event pairs, 4291 based on Foata normal form. 223/21996 useless extension candidates. Maximal degree in co-relation 70036. Up to 14851 conditions per place. [2023-08-26 21:26:36,691 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 115 selfloop transitions, 8 changer transitions 0/127 dead transitions. [2023-08-26 21:26:36,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 127 transitions, 896 flow [2023-08-26 21:26:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:26:36,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:26:36,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 725 transitions. [2023-08-26 21:26:36,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-26 21:26:36,693 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 725 transitions. [2023-08-26 21:26:36,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 725 transitions. [2023-08-26 21:26:36,693 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:36,693 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 725 transitions. [2023-08-26 21:26:36,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.0) internal successors, (725), 5 states have internal predecessors, (725), 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-26 21:26:36,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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-26 21:26:36,697 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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-26 21:26:36,697 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 263 flow. Second operand 5 states and 725 transitions. [2023-08-26 21:26:36,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 127 transitions, 896 flow [2023-08-26 21:26:36,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 127 transitions, 892 flow, removed 2 selfloop flow, removed 0 redundant places. [2023-08-26 21:26:36,729 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 347 flow [2023-08-26 21:26:36,729 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=347, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2023-08-26 21:26:36,731 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 20 predicate places. [2023-08-26 21:26:36,733 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 347 flow [2023-08-26 21:26:36,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.5) internal successors, (530), 4 states have internal predecessors, (530), 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-26 21:26:36,734 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:36,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:36,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:26:36,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:26:36,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash -607563336, now seen corresponding path program 1 times [2023-08-26 21:26:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235211757] [2023-08-26 21:26:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:36,939 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-26 21:26:36,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:36,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235211757] [2023-08-26 21:26:36,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235211757] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:36,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:36,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:26:36,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459796791] [2023-08-26 21:26:36,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:36,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:36,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:36,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:36,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:36,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-08-26 21:26:36,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 347 flow. Second operand has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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-26 21:26:36,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:36,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-08-26 21:26:36,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:41,329 INFO L124 PetriNetUnfolderBase]: 30544/44012 cut-off events. [2023-08-26 21:26:41,329 INFO L125 PetriNetUnfolderBase]: For 48894/48894 co-relation queries the response was YES. [2023-08-26 21:26:41,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133766 conditions, 44012 events. 30544/44012 cut-off events. For 48894/48894 co-relation queries the response was YES. Maximal size of possible extension queue 2016. Compared 305545 event pairs, 10540 based on Foata normal form. 329/40527 useless extension candidates. Maximal degree in co-relation 133740. Up to 19725 conditions per place. [2023-08-26 21:26:41,597 INFO L140 encePairwiseOnDemand]: 286/290 looper letters, 128 selfloop transitions, 8 changer transitions 0/137 dead transitions. [2023-08-26 21:26:41,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 137 transitions, 1025 flow [2023-08-26 21:26:41,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:26:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:26:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2023-08-26 21:26:41,599 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4979310344827586 [2023-08-26 21:26:41,599 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2023-08-26 21:26:41,599 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2023-08-26 21:26:41,599 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:41,599 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2023-08-26 21:26:41,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 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-26 21:26:41,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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-26 21:26:41,602 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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-26 21:26:41,602 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 347 flow. Second operand 5 states and 722 transitions. [2023-08-26 21:26:41,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 137 transitions, 1025 flow [2023-08-26 21:26:41,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 137 transitions, 1023 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:41,716 INFO L231 Difference]: Finished difference. Result has 75 places, 61 transitions, 417 flow [2023-08-26 21:26:41,716 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=417, PETRI_PLACES=75, PETRI_TRANSITIONS=61} [2023-08-26 21:26:41,717 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2023-08-26 21:26:41,717 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 61 transitions, 417 flow [2023-08-26 21:26:41,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 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-26 21:26:41,717 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:41,717 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:41,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:26:41,717 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:26:41,718 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:41,718 INFO L85 PathProgramCache]: Analyzing trace with hash -8273206, now seen corresponding path program 1 times [2023-08-26 21:26:41,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:41,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459223209] [2023-08-26 21:26:41,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:41,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:42,906 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-26 21:26:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459223209] [2023-08-26 21:26:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459223209] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:42,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:42,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:26:42,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706427090] [2023-08-26 21:26:42,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:42,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:26:42,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:42,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:26:42,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:26:42,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 290 [2023-08-26 21:26:42,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 61 transitions, 417 flow. Second operand has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 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-26 21:26:42,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:42,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 290 [2023-08-26 21:26:42,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:51,853 INFO L124 PetriNetUnfolderBase]: 53677/76979 cut-off events. [2023-08-26 21:26:51,853 INFO L125 PetriNetUnfolderBase]: For 101470/101526 co-relation queries the response was YES. [2023-08-26 21:26:52,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 234066 conditions, 76979 events. 53677/76979 cut-off events. For 101470/101526 co-relation queries the response was YES. Maximal size of possible extension queue 3352. Compared 556173 event pairs, 20923 based on Foata normal form. 412/71225 useless extension candidates. Maximal degree in co-relation 234037. Up to 44321 conditions per place. [2023-08-26 21:26:52,532 INFO L140 encePairwiseOnDemand]: 284/290 looper letters, 130 selfloop transitions, 21 changer transitions 0/154 dead transitions. [2023-08-26 21:26:52,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 154 transitions, 1273 flow [2023-08-26 21:26:52,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:26:52,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:26:52,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 719 transitions. [2023-08-26 21:26:52,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132183908045977 [2023-08-26 21:26:52,534 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 719 transitions. [2023-08-26 21:26:52,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 719 transitions. [2023-08-26 21:26:52,535 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:52,535 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 719 transitions. [2023-08-26 21:26:52,536 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 119.83333333333333) internal successors, (719), 6 states have internal predecessors, (719), 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-26 21:26:52,538 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:26:52,538 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:26:52,538 INFO L175 Difference]: Start difference. First operand has 75 places, 61 transitions, 417 flow. Second operand 6 states and 719 transitions. [2023-08-26 21:26:52,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 154 transitions, 1273 flow [2023-08-26 21:26:52,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 154 transitions, 1227 flow, removed 19 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:52,722 INFO L231 Difference]: Finished difference. Result has 82 places, 83 transitions, 687 flow [2023-08-26 21:26:52,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=687, PETRI_PLACES=82, PETRI_TRANSITIONS=83} [2023-08-26 21:26:52,723 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 33 predicate places. [2023-08-26 21:26:52,723 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 83 transitions, 687 flow [2023-08-26 21:26:52,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 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-26 21:26:52,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:52,724 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:52,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:26:52,724 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:26:52,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:52,724 INFO L85 PathProgramCache]: Analyzing trace with hash -314664720, now seen corresponding path program 1 times [2023-08-26 21:26:52,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:52,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824909041] [2023-08-26 21:26:52,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:52,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:53,163 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-26 21:26:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:53,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824909041] [2023-08-26 21:26:53,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824909041] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:53,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:53,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:26:53,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605669423] [2023-08-26 21:26:53,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:53,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:26:53,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:53,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:26:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:26:53,168 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 290 [2023-08-26 21:26:53,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 83 transitions, 687 flow. Second operand has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 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-26 21:26:53,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:53,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 290 [2023-08-26 21:26:53,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:06,141 INFO L124 PetriNetUnfolderBase]: 74217/106226 cut-off events. [2023-08-26 21:27:06,141 INFO L125 PetriNetUnfolderBase]: For 151978/152118 co-relation queries the response was YES. [2023-08-26 21:27:06,609 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336789 conditions, 106226 events. 74217/106226 cut-off events. For 151978/152118 co-relation queries the response was YES. Maximal size of possible extension queue 4882. Compared 801113 event pairs, 38090 based on Foata normal form. 404/98825 useless extension candidates. Maximal degree in co-relation 336756. Up to 80831 conditions per place. [2023-08-26 21:27:06,900 INFO L140 encePairwiseOnDemand]: 277/290 looper letters, 140 selfloop transitions, 31 changer transitions 0/174 dead transitions. [2023-08-26 21:27:06,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 174 transitions, 1537 flow [2023-08-26 21:27:06,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:27:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:27:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2023-08-26 21:27:06,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46091954022988507 [2023-08-26 21:27:06,902 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 802 transitions. [2023-08-26 21:27:06,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 802 transitions. [2023-08-26 21:27:06,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:06,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 802 transitions. [2023-08-26 21:27:06,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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-26 21:27:06,905 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:27:06,906 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:27:06,906 INFO L175 Difference]: Start difference. First operand has 82 places, 83 transitions, 687 flow. Second operand 6 states and 802 transitions. [2023-08-26 21:27:06,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 174 transitions, 1537 flow [2023-08-26 21:27:07,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 174 transitions, 1537 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:27:07,796 INFO L231 Difference]: Finished difference. Result has 90 places, 108 transitions, 995 flow [2023-08-26 21:27:07,796 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=687, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=995, PETRI_PLACES=90, PETRI_TRANSITIONS=108} [2023-08-26 21:27:07,797 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 41 predicate places. [2023-08-26 21:27:07,797 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 108 transitions, 995 flow [2023-08-26 21:27:07,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 122.2) internal successors, (611), 5 states have internal predecessors, (611), 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-26 21:27:07,797 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:07,797 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:07,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:27:07,797 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:07,798 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:07,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1915553712, now seen corresponding path program 2 times [2023-08-26 21:27:07,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:07,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416018015] [2023-08-26 21:27:07,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:07,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:08,535 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-26 21:27:08,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416018015] [2023-08-26 21:27:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416018015] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:27:08,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443163281] [2023-08-26 21:27:08,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:08,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:27:08,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:08,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:27:08,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:27:08,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 290 [2023-08-26 21:27:08,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 108 transitions, 995 flow. Second operand has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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-26 21:27:08,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:08,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 290 [2023-08-26 21:27:08,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:31,652 INFO L124 PetriNetUnfolderBase]: 121131/175605 cut-off events. [2023-08-26 21:27:31,652 INFO L125 PetriNetUnfolderBase]: For 413694/414513 co-relation queries the response was YES. [2023-08-26 21:27:32,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 694538 conditions, 175605 events. 121131/175605 cut-off events. For 413694/414513 co-relation queries the response was YES. Maximal size of possible extension queue 8124. Compared 1444541 event pairs, 29892 based on Foata normal form. 815/161565 useless extension candidates. Maximal degree in co-relation 694500. Up to 66050 conditions per place. [2023-08-26 21:27:33,033 INFO L140 encePairwiseOnDemand]: 277/290 looper letters, 209 selfloop transitions, 71 changer transitions 0/283 dead transitions. [2023-08-26 21:27:33,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 283 transitions, 2789 flow [2023-08-26 21:27:33,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-26 21:27:33,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-26 21:27:33,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1068 transitions. [2023-08-26 21:27:33,036 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4603448275862069 [2023-08-26 21:27:33,036 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1068 transitions. [2023-08-26 21:27:33,036 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1068 transitions. [2023-08-26 21:27:33,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:33,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1068 transitions. [2023-08-26 21:27:33,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 133.5) internal successors, (1068), 8 states have internal predecessors, (1068), 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-26 21:27:33,040 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 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-26 21:27:33,040 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 290.0) internal successors, (2610), 9 states have internal predecessors, (2610), 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-26 21:27:33,040 INFO L175 Difference]: Start difference. First operand has 90 places, 108 transitions, 995 flow. Second operand 8 states and 1068 transitions. [2023-08-26 21:27:33,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 283 transitions, 2789 flow [2023-08-26 21:27:37,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 283 transitions, 2708 flow, removed 28 selfloop flow, removed 2 redundant places. [2023-08-26 21:27:37,364 INFO L231 Difference]: Finished difference. Result has 100 places, 157 transitions, 1722 flow [2023-08-26 21:27:37,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=949, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1722, PETRI_PLACES=100, PETRI_TRANSITIONS=157} [2023-08-26 21:27:37,364 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 51 predicate places. [2023-08-26 21:27:37,365 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 157 transitions, 1722 flow [2023-08-26 21:27:37,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.28571428571429) internal successors, (835), 7 states have internal predecessors, (835), 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-26 21:27:37,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:37,365 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:37,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:27:37,365 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:37,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:37,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1034869312, now seen corresponding path program 1 times [2023-08-26 21:27:37,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:37,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334213749] [2023-08-26 21:27:37,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:37,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:37,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:37,519 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-26 21:27:37,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:37,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334213749] [2023-08-26 21:27:37,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334213749] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:37,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:37,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:27:37,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366881318] [2023-08-26 21:27:37,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:37,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:27:37,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:37,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:27:37,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:27:37,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 290 [2023-08-26 21:27:37,521 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 157 transitions, 1722 flow. Second operand has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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-26 21:27:37,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:37,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 290 [2023-08-26 21:27:37,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:49,933 INFO L124 PetriNetUnfolderBase]: 58222/89424 cut-off events. [2023-08-26 21:27:49,933 INFO L125 PetriNetUnfolderBase]: For 393274/399726 co-relation queries the response was YES. [2023-08-26 21:27:50,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 407034 conditions, 89424 events. 58222/89424 cut-off events. For 393274/399726 co-relation queries the response was YES. Maximal size of possible extension queue 4686. Compared 762487 event pairs, 17752 based on Foata normal form. 7779/85311 useless extension candidates. Maximal degree in co-relation 406991. Up to 68678 conditions per place. [2023-08-26 21:27:50,769 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 209 selfloop transitions, 6 changer transitions 0/224 dead transitions. [2023-08-26 21:27:50,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 224 transitions, 2612 flow [2023-08-26 21:27:50,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:27:50,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:27:50,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 568 transitions. [2023-08-26 21:27:50,777 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896551724137931 [2023-08-26 21:27:50,777 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 568 transitions. [2023-08-26 21:27:50,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 568 transitions. [2023-08-26 21:27:50,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:50,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 568 transitions. [2023-08-26 21:27:50,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 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-26 21:27:50,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 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-26 21:27:50,780 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 290.0) internal successors, (1450), 5 states have internal predecessors, (1450), 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-26 21:27:50,780 INFO L175 Difference]: Start difference. First operand has 100 places, 157 transitions, 1722 flow. Second operand 4 states and 568 transitions. [2023-08-26 21:27:50,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 224 transitions, 2612 flow [2023-08-26 21:27:55,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 224 transitions, 2581 flow, removed 15 selfloop flow, removed 1 redundant places. [2023-08-26 21:27:55,208 INFO L231 Difference]: Finished difference. Result has 104 places, 154 transitions, 1661 flow [2023-08-26 21:27:55,208 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1627, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1661, PETRI_PLACES=104, PETRI_TRANSITIONS=154} [2023-08-26 21:27:55,209 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 55 predicate places. [2023-08-26 21:27:55,209 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 154 transitions, 1661 flow [2023-08-26 21:27:55,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 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-26 21:27:55,209 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:55,209 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:55,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:27:55,209 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:55,210 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:55,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1221952215, now seen corresponding path program 1 times [2023-08-26 21:27:55,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:55,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102677093] [2023-08-26 21:27:55,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:55,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:55,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:55,286 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-26 21:27:55,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:55,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102677093] [2023-08-26 21:27:55,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102677093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:55,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:55,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:27:55,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14785154] [2023-08-26 21:27:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:55,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:27:55,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:55,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:27:55,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:27:55,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-08-26 21:27:55,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 154 transitions, 1661 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 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-26 21:27:55,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:55,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-08-26 21:27:55,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:05,289 INFO L124 PetriNetUnfolderBase]: 46542/69968 cut-off events. [2023-08-26 21:28:05,289 INFO L125 PetriNetUnfolderBase]: For 359516/365945 co-relation queries the response was YES. [2023-08-26 21:28:05,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 331681 conditions, 69968 events. 46542/69968 cut-off events. For 359516/365945 co-relation queries the response was YES. Maximal size of possible extension queue 4125. Compared 566216 event pairs, 5876 based on Foata normal form. 5712/74329 useless extension candidates. Maximal degree in co-relation 331635. Up to 29826 conditions per place. [2023-08-26 21:28:06,164 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 322 selfloop transitions, 13 changer transitions 0/344 dead transitions. [2023-08-26 21:28:06,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 344 transitions, 4398 flow [2023-08-26 21:28:06,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:28:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:28:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 731 transitions. [2023-08-26 21:28:06,166 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5041379310344828 [2023-08-26 21:28:06,166 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 731 transitions. [2023-08-26 21:28:06,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 731 transitions. [2023-08-26 21:28:06,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:06,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 731 transitions. [2023-08-26 21:28:06,181 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.2) internal successors, (731), 5 states have internal predecessors, (731), 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-26 21:28:06,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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-26 21:28:06,183 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 290.0) internal successors, (1740), 6 states have internal predecessors, (1740), 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-26 21:28:06,183 INFO L175 Difference]: Start difference. First operand has 104 places, 154 transitions, 1661 flow. Second operand 5 states and 731 transitions. [2023-08-26 21:28:06,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 344 transitions, 4398 flow [2023-08-26 21:28:07,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 344 transitions, 4389 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:28:07,914 INFO L231 Difference]: Finished difference. Result has 107 places, 158 transitions, 1728 flow [2023-08-26 21:28:07,915 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1728, PETRI_PLACES=107, PETRI_TRANSITIONS=158} [2023-08-26 21:28:07,917 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 58 predicate places. [2023-08-26 21:28:07,917 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 158 transitions, 1728 flow [2023-08-26 21:28:07,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 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-26 21:28:07,917 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:07,917 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-26 21:28:07,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:28:07,918 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:28:07,918 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash 921331489, now seen corresponding path program 1 times [2023-08-26 21:28:07,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:07,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238285003] [2023-08-26 21:28:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:07,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:07,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:08,116 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-26 21:28:08,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:08,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238285003] [2023-08-26 21:28:08,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238285003] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:08,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:08,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:28:08,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648037319] [2023-08-26 21:28:08,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:08,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:28:08,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:08,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:28:08,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:28:08,118 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 290 [2023-08-26 21:28:08,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 158 transitions, 1728 flow. Second operand has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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-26 21:28:08,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:08,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 290 [2023-08-26 21:28:08,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:13,152 INFO L124 PetriNetUnfolderBase]: 20880/32406 cut-off events. [2023-08-26 21:28:13,152 INFO L125 PetriNetUnfolderBase]: For 191620/195789 co-relation queries the response was YES. [2023-08-26 21:28:13,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170110 conditions, 32406 events. 20880/32406 cut-off events. For 191620/195789 co-relation queries the response was YES. Maximal size of possible extension queue 1409. Compared 244334 event pairs, 3804 based on Foata normal form. 4857/36472 useless extension candidates. Maximal degree in co-relation 170063. Up to 14264 conditions per place. [2023-08-26 21:28:13,368 INFO L140 encePairwiseOnDemand]: 278/290 looper letters, 224 selfloop transitions, 23 changer transitions 4/260 dead transitions. [2023-08-26 21:28:13,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 260 transitions, 3037 flow [2023-08-26 21:28:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:28:13,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:28:13,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 844 transitions. [2023-08-26 21:28:13,370 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4850574712643678 [2023-08-26 21:28:13,370 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 844 transitions. [2023-08-26 21:28:13,370 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 844 transitions. [2023-08-26 21:28:13,371 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:13,371 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 844 transitions. [2023-08-26 21:28:13,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.66666666666666) internal successors, (844), 6 states have internal predecessors, (844), 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-26 21:28:13,374 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:28:13,374 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:28:13,374 INFO L175 Difference]: Start difference. First operand has 107 places, 158 transitions, 1728 flow. Second operand 6 states and 844 transitions. [2023-08-26 21:28:13,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 260 transitions, 3037 flow [2023-08-26 21:28:14,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 260 transitions, 2925 flow, removed 26 selfloop flow, removed 5 redundant places. [2023-08-26 21:28:14,463 INFO L231 Difference]: Finished difference. Result has 109 places, 157 transitions, 1662 flow [2023-08-26 21:28:14,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1463, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1662, PETRI_PLACES=109, PETRI_TRANSITIONS=157} [2023-08-26 21:28:14,463 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 60 predicate places. [2023-08-26 21:28:14,463 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 157 transitions, 1662 flow [2023-08-26 21:28:14,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 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-26 21:28:14,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:14,464 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] [2023-08-26 21:28:14,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:28:14,464 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:28:14,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:14,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1890854745, now seen corresponding path program 1 times [2023-08-26 21:28:14,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:14,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545430707] [2023-08-26 21:28:14,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:14,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:14,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:14,652 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-26 21:28:14,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:14,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545430707] [2023-08-26 21:28:14,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545430707] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:14,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:14,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:28:14,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427615524] [2023-08-26 21:28:14,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:14,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:28:14,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:14,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:28:14,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:28:14,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 290 [2023-08-26 21:28:14,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 157 transitions, 1662 flow. Second operand has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 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-26 21:28:14,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:14,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 290 [2023-08-26 21:28:14,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:18,203 INFO L124 PetriNetUnfolderBase]: 16013/23938 cut-off events. [2023-08-26 21:28:18,203 INFO L125 PetriNetUnfolderBase]: For 152174/155989 co-relation queries the response was YES. [2023-08-26 21:28:18,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130943 conditions, 23938 events. 16013/23938 cut-off events. For 152174/155989 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 164889 event pairs, 2484 based on Foata normal form. 3804/27651 useless extension candidates. Maximal degree in co-relation 130895. Up to 11118 conditions per place. [2023-08-26 21:28:18,487 INFO L140 encePairwiseOnDemand]: 278/290 looper letters, 183 selfloop transitions, 31 changer transitions 0/219 dead transitions. [2023-08-26 21:28:18,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 219 transitions, 2521 flow [2023-08-26 21:28:18,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:28:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:28:18,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 985 transitions. [2023-08-26 21:28:18,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852216748768473 [2023-08-26 21:28:18,489 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 985 transitions. [2023-08-26 21:28:18,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 985 transitions. [2023-08-26 21:28:18,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:18,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 985 transitions. [2023-08-26 21:28:18,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 140.71428571428572) internal successors, (985), 7 states have internal predecessors, (985), 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-26 21:28:18,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 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-26 21:28:18,493 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 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-26 21:28:18,493 INFO L175 Difference]: Start difference. First operand has 109 places, 157 transitions, 1662 flow. Second operand 7 states and 985 transitions. [2023-08-26 21:28:18,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 219 transitions, 2521 flow [2023-08-26 21:28:19,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 219 transitions, 2372 flow, removed 68 selfloop flow, removed 5 redundant places. [2023-08-26 21:28:19,571 INFO L231 Difference]: Finished difference. Result has 108 places, 118 transitions, 1246 flow [2023-08-26 21:28:19,571 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=1080, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1246, PETRI_PLACES=108, PETRI_TRANSITIONS=118} [2023-08-26 21:28:19,572 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 59 predicate places. [2023-08-26 21:28:19,572 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 118 transitions, 1246 flow [2023-08-26 21:28:19,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 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-26 21:28:19,572 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:19,572 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:19,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:28:19,573 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:28:19,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:19,573 INFO L85 PathProgramCache]: Analyzing trace with hash 110747670, now seen corresponding path program 1 times [2023-08-26 21:28:19,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:19,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508904311] [2023-08-26 21:28:19,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:19,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:19,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:19,663 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-26 21:28:19,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:19,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508904311] [2023-08-26 21:28:19,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508904311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:19,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:19,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:28:19,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266865900] [2023-08-26 21:28:19,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:19,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:28:19,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:19,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:28:19,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:28:19,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 290 [2023-08-26 21:28:19,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 118 transitions, 1246 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 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-26 21:28:19,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:19,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 290 [2023-08-26 21:28:19,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:23,165 INFO L124 PetriNetUnfolderBase]: 15789/23368 cut-off events. [2023-08-26 21:28:23,165 INFO L125 PetriNetUnfolderBase]: For 136177/139397 co-relation queries the response was YES. [2023-08-26 21:28:23,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128566 conditions, 23368 events. 15789/23368 cut-off events. For 136177/139397 co-relation queries the response was YES. Maximal size of possible extension queue 1372. Compared 159058 event pairs, 2456 based on Foata normal form. 3211/26488 useless extension candidates. Maximal degree in co-relation 128519. Up to 11078 conditions per place. [2023-08-26 21:28:23,254 INFO L140 encePairwiseOnDemand]: 281/290 looper letters, 90 selfloop transitions, 17 changer transitions 78/189 dead transitions. [2023-08-26 21:28:23,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 189 transitions, 2121 flow [2023-08-26 21:28:23,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:28:23,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:28:23,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2023-08-26 21:28:23,256 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4896551724137931 [2023-08-26 21:28:23,256 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 852 transitions. [2023-08-26 21:28:23,256 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 852 transitions. [2023-08-26 21:28:23,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:23,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 852 transitions. [2023-08-26 21:28:23,257 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 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-26 21:28:23,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:28:23,268 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:28:23,268 INFO L175 Difference]: Start difference. First operand has 108 places, 118 transitions, 1246 flow. Second operand 6 states and 852 transitions. [2023-08-26 21:28:23,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 189 transitions, 2121 flow [2023-08-26 21:28:25,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 189 transitions, 2071 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-26 21:28:25,354 INFO L231 Difference]: Finished difference. Result has 101 places, 54 transitions, 497 flow [2023-08-26 21:28:25,354 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=999, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=497, PETRI_PLACES=101, PETRI_TRANSITIONS=54} [2023-08-26 21:28:25,354 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 52 predicate places. [2023-08-26 21:28:25,354 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 54 transitions, 497 flow [2023-08-26 21:28:25,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 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-26 21:28:25,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:25,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:25,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:28:25,355 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:28:25,355 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:25,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1183117921, now seen corresponding path program 1 times [2023-08-26 21:28:25,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:25,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145171352] [2023-08-26 21:28:25,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:25,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:25,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-26 21:28:25,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:25,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145171352] [2023-08-26 21:28:25,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145171352] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:25,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:25,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:28:25,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610200691] [2023-08-26 21:28:25,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:25,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:28:25,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:25,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:28:25,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:28:25,790 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 290 [2023-08-26 21:28:25,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 54 transitions, 497 flow. Second operand has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 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-26 21:28:25,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:25,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 290 [2023-08-26 21:28:25,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:26,290 INFO L124 PetriNetUnfolderBase]: 1989/3038 cut-off events. [2023-08-26 21:28:26,290 INFO L125 PetriNetUnfolderBase]: For 14622/14783 co-relation queries the response was YES. [2023-08-26 21:28:26,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17146 conditions, 3038 events. 1989/3038 cut-off events. For 14622/14783 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 15829 event pairs, 355 based on Foata normal form. 171/3176 useless extension candidates. Maximal degree in co-relation 17114. Up to 1556 conditions per place. [2023-08-26 21:28:26,305 INFO L140 encePairwiseOnDemand]: 283/290 looper letters, 72 selfloop transitions, 18 changer transitions 22/115 dead transitions. [2023-08-26 21:28:26,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 115 transitions, 1163 flow [2023-08-26 21:28:26,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:28:26,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:28:26,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 946 transitions. [2023-08-26 21:28:26,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4660098522167488 [2023-08-26 21:28:26,307 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 946 transitions. [2023-08-26 21:28:26,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 946 transitions. [2023-08-26 21:28:26,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:26,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 946 transitions. [2023-08-26 21:28:26,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.14285714285714) internal successors, (946), 7 states have internal predecessors, (946), 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-26 21:28:26,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 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-26 21:28:26,313 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 290.0) internal successors, (2320), 8 states have internal predecessors, (2320), 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-26 21:28:26,313 INFO L175 Difference]: Start difference. First operand has 101 places, 54 transitions, 497 flow. Second operand 7 states and 946 transitions. [2023-08-26 21:28:26,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 115 transitions, 1163 flow [2023-08-26 21:28:26,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 115 transitions, 912 flow, removed 45 selfloop flow, removed 31 redundant places. [2023-08-26 21:28:26,376 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 322 flow [2023-08-26 21:28:26,376 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=305, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=322, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-08-26 21:28:26,377 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2023-08-26 21:28:26,377 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 322 flow [2023-08-26 21:28:26,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.14285714285714) internal successors, (897), 7 states have internal predecessors, (897), 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-26 21:28:26,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:26,378 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:26,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:28:26,378 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:28:26,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:26,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1946030969, now seen corresponding path program 1 times [2023-08-26 21:28:26,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:26,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415123603] [2023-08-26 21:28:26,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:26,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:28:26,611 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-26 21:28:26,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:28:26,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415123603] [2023-08-26 21:28:26,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415123603] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:28:26,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:28:26,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:28:26,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481869780] [2023-08-26 21:28:26,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:28:26,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:28:26,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:28:26,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:28:26,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:28:26,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 290 [2023-08-26 21:28:26,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 322 flow. Second operand has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 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-26 21:28:26,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:28:26,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 290 [2023-08-26 21:28:26,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:28:26,970 INFO L124 PetriNetUnfolderBase]: 1667/2567 cut-off events. [2023-08-26 21:28:26,970 INFO L125 PetriNetUnfolderBase]: For 7393/7438 co-relation queries the response was YES. [2023-08-26 21:28:26,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12132 conditions, 2567 events. 1667/2567 cut-off events. For 7393/7438 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 12503 event pairs, 265 based on Foata normal form. 46/2613 useless extension candidates. Maximal degree in co-relation 12119. Up to 1290 conditions per place. [2023-08-26 21:28:26,978 INFO L140 encePairwiseOnDemand]: 285/290 looper letters, 43 selfloop transitions, 2 changer transitions 64/110 dead transitions. [2023-08-26 21:28:26,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 982 flow [2023-08-26 21:28:26,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:28:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:28:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 812 transitions. [2023-08-26 21:28:26,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4666666666666667 [2023-08-26 21:28:26,980 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 812 transitions. [2023-08-26 21:28:26,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 812 transitions. [2023-08-26 21:28:26,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:28:26,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 812 transitions. [2023-08-26 21:28:26,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 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-26 21:28:26,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:28:26,983 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 290.0) internal successors, (2030), 7 states have internal predecessors, (2030), 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-26 21:28:26,983 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 322 flow. Second operand 6 states and 812 transitions. [2023-08-26 21:28:26,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 982 flow [2023-08-26 21:28:26,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 110 transitions, 743 flow, removed 28 selfloop flow, removed 15 redundant places. [2023-08-26 21:28:26,994 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 201 flow [2023-08-26 21:28:26,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=290, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=201, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2023-08-26 21:28:26,995 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 8 predicate places. [2023-08-26 21:28:26,995 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 201 flow [2023-08-26 21:28:26,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 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-26 21:28:26,995 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:28:26,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:26,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:28:26,995 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:28:26,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:28:26,995 INFO L85 PathProgramCache]: Analyzing trace with hash -833217581, now seen corresponding path program 2 times [2023-08-26 21:28:26,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:28:26,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773691303] [2023-08-26 21:28:26,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:28:26,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:28:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:28:27,085 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:28:27,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:28:27,213 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:28:27,213 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:28:27,214 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (20 of 21 remaining) [2023-08-26 21:28:27,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2023-08-26 21:28:27,215 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2023-08-26 21:28:27,216 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2023-08-26 21:28:27,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2023-08-26 21:28:27,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2023-08-26 21:28:27,217 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2023-08-26 21:28:27,218 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2023-08-26 21:28:27,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-26 21:28:27,219 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:28:27,222 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:28:27,222 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:28:27,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:28:27 BasicIcfg [2023-08-26 21:28:27,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:28:27,323 INFO L158 Benchmark]: Toolchain (without parser) took 131339.07ms. Allocated memory was 346.0MB in the beginning and 15.7GB in the end (delta: 15.3GB). Free memory was 320.7MB in the beginning and 9.6GB in the end (delta: -9.3GB). Peak memory consumption was 6.0GB. Max. memory is 16.0GB. [2023-08-26 21:28:27,323 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 346.0MB. Free memory is still 322.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:28:27,323 INFO L158 Benchmark]: CACSL2BoogieTranslator took 439.02ms. Allocated memory is still 346.0MB. Free memory was 320.1MB in the beginning and 294.1MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 21:28:27,323 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.07ms. Allocated memory is still 346.0MB. Free memory was 294.1MB in the beginning and 291.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:28:27,323 INFO L158 Benchmark]: Boogie Preprocessor took 47.96ms. Allocated memory is still 346.0MB. Free memory was 291.5MB in the beginning and 288.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:28:27,324 INFO L158 Benchmark]: RCFGBuilder took 744.44ms. Allocated memory is still 346.0MB. Free memory was 288.8MB in the beginning and 243.1MB in the end (delta: 45.7MB). Peak memory consumption was 46.8MB. Max. memory is 16.0GB. [2023-08-26 21:28:27,324 INFO L158 Benchmark]: TraceAbstraction took 130045.26ms. Allocated memory was 346.0MB in the beginning and 15.7GB in the end (delta: 15.3GB). Free memory was 242.1MB in the beginning and 9.6GB in the end (delta: -9.4GB). Peak memory consumption was 5.9GB. Max. memory is 16.0GB. [2023-08-26 21:28:27,325 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 is still 322.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 439.02ms. Allocated memory is still 346.0MB. Free memory was 320.1MB in the beginning and 294.1MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 58.07ms. Allocated memory is still 346.0MB. Free memory was 294.1MB in the beginning and 291.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 47.96ms. Allocated memory is still 346.0MB. Free memory was 291.5MB in the beginning and 288.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 744.44ms. Allocated memory is still 346.0MB. Free memory was 288.8MB in the beginning and 243.1MB in the end (delta: 45.7MB). Peak memory consumption was 46.8MB. Max. memory is 16.0GB. * TraceAbstraction took 130045.26ms. Allocated memory was 346.0MB in the beginning and 15.7GB in the end (delta: 15.3GB). Free memory was 242.1MB in the beginning and 9.6GB in the end (delta: -9.4GB). Peak memory consumption was 5.9GB. 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: 6.8s, 162 PlacesBefore, 49 PlacesAfterwards, 152 TransitionsBefore, 37 TransitionsAfterwards, 3974 CoEnabledTransitionPairs, 8 FixpointIterations, 60 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 134 TotalNumberOfCompositions, 16268 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4708, independent: 4304, independent conditional: 0, independent unconditional: 4304, dependent: 404, dependent conditional: 0, dependent unconditional: 404, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2118, independent: 2055, independent conditional: 0, independent unconditional: 2055, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4708, independent: 2249, independent conditional: 0, independent unconditional: 2249, dependent: 341, dependent conditional: 0, dependent unconditional: 341, unknown: 2118, unknown conditional: 0, unknown unconditional: 2118] , Statistics on independence cache: Total cache size (in pairs): 233, Positive cache size: 206, Positive conditional cache size: 0, Positive unconditional cache size: 206, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff0_thd4; [L744] 0 _Bool x$r_buff1_thd0; [L745] 0 _Bool x$r_buff1_thd1; [L746] 0 _Bool x$r_buff1_thd2; [L747] 0 _Bool x$r_buff1_thd3; [L748] 0 _Bool x$r_buff1_thd4; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L861] 0 pthread_t t2149; [L862] FCALL, FORK 0 pthread_create(&t2149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2149, ((void *)0), P0, ((void *)0))=10, t2149={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L863] 0 pthread_t t2150; [L864] FCALL, FORK 0 pthread_create(&t2150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2150, ((void *)0), P1, ((void *)0))=11, t2149={7:0}, t2150={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L865] 0 pthread_t t2151; [L866] FCALL, FORK 0 pthread_create(&t2151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2151, ((void *)0), P2, ((void *)0))=12, t2149={7:0}, t2150={8:0}, t2151={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L867] 0 pthread_t t2152; [L800] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 3 x$flush_delayed = weak$$choice2 [L803] EXPR 3 \read(x) [L803] 3 x$mem_tmp = x [L804] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] EXPR 3 \read(x) [L805] EXPR 3 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L805] 3 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L806] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)))) [L807] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)))) [L808] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L809] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L810] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L811] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (weak$$choice0 ? x$r_buff1_thd3 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd3 && x$w_buff1_used && !x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L812] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L813] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L814] EXPR 3 \read(x) [L814] 3 __unbuffered_p2_EAX = x [L815] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L815] 3 x = x$flush_delayed ? x$mem_tmp : x [L816] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L868] FCALL, FORK 0 pthread_create(&t2152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2152, ((void *)0), P3, ((void *)0))=13, t2149={7:0}, t2150={8:0}, t2151={9:0}, t2152={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L819] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 \read(x) [L822] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L822] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L822] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L823] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L824] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L825] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L826] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L836] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 \read(x) [L839] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L839] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L839] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L840] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L841] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L842] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L843] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L763] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L766] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L783] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 \read(x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L793] EXPR 2 __unbuffered_cnt + 1 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L846] EXPR 4 __unbuffered_cnt + 1 [L846] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L848] 4 return 0; [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 \read(x) [L769] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L769] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L769] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L770] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L771] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L772] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L773] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L829] EXPR 3 __unbuffered_cnt + 1 [L829] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 3 return 0; [L776] EXPR 1 __unbuffered_cnt + 1 [L776] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 1 return 0; [L870] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2149={7:0}, t2150={8:0}, t2151={9:0}, t2152={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L872] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L872] RET 0 assume_abort_if_not(main$tmp_guard0) [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 \read(x) [L874] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L874] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L874] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L875] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L876] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L877] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L878] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2149={7:0}, t2150={8:0}, t2151={9:0}, t2152={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L881] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L882] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L883] 0 x$flush_delayed = weak$$choice2 [L884] EXPR 0 \read(x) [L884] 0 x$mem_tmp = x [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] EXPR 0 \read(x) [L885] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L885] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L886] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L887] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L888] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L889] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L890] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L891] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L892] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L893] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L893] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L894] EXPR 0 \read(x) [L894] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 2) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] EXPR 0 \read(x) [L895] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L895] 0 x = x$flush_delayed ? x$mem_tmp : x [L896] 0 x$flush_delayed = (_Bool)0 [L898] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "safe016_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 776]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 776]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 793]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: 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: 868]: 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: 862]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 196 locations, 21 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: 129.8s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 117.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1015 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1015 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 141 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2302 IncrementalHoareTripleChecker+Invalid, 2443 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 141 mSolverCounterUnsat, 9 mSDtfsCounter, 2302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1728occurred in iteration=12, InterpolantAutomatonStates: 94, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 255 ConstructedInterpolants, 0 QuantifiedInterpolants, 1275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-26 21:28:27,355 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...