/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:47:10,930 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:47:11,015 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-27 03:47:11,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:47:11,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:47:11,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:47:11,052 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:47:11,057 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:47:11,058 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:47:11,061 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:47:11,061 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:47:11,062 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:47:11,062 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:47:11,063 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:47:11,063 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:47:11,063 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:47:11,063 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:47:11,064 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:47:11,064 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:47:11,064 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:47:11,064 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:47:11,065 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:47:11,065 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:47:11,065 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:47:11,065 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:47:11,065 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:47:11,066 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:47:11,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:47:11,066 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:47:11,066 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:47:11,066 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:47:11,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:47:11,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:47:11,067 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:47:11,067 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:47:11,067 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST 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-27 03:47:11,388 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:47:11,412 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:47:11,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:47:11,417 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:47:11,417 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:47:11,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-27 03:47:12,522 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:47:12,831 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:47:12,832 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043.oepc.i [2023-08-27 03:47:12,854 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00248358c/e7f0134fc0084c1ca33bae1e7ec634c2/FLAGe4b38c5d2 [2023-08-27 03:47:12,867 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00248358c/e7f0134fc0084c1ca33bae1e7ec634c2 [2023-08-27 03:47:12,869 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:47:12,870 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:47:12,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:47:12,871 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:47:12,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:47:12,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:47:12" (1/1) ... [2023-08-27 03:47:12,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec0f9fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:12, skipping insertion in model container [2023-08-27 03:47:12,875 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:47:12" (1/1) ... [2023-08-27 03:47:12,931 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:47:13,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:47:13,318 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:47:13,333 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:47:13,335 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:47:13,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:47:13,391 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:47:13,391 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:47:13,397 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:47:13,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13 WrapperNode [2023-08-27 03:47:13,398 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:47:13,399 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:47:13,399 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:47:13,399 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:47:13,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,442 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 154 [2023-08-27 03:47:13,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:47:13,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:47:13,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:47:13,444 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:47:13,451 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,452 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,455 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,465 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,467 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,469 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,471 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,474 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:47:13,475 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:47:13,475 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:47:13,475 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:47:13,476 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (1/1) ... [2023-08-27 03:47:13,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:47:13,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:47:13,515 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-27 03:47:13,548 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-27 03:47:13,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:47:13,568 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:47:13,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:47:13,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:47:13,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:47:13,568 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:47:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:47:13,569 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:47:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:47:13,569 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:47:13,569 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:47:13,569 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:47:13,570 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:47:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:47:13,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:47:13,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:47:13,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:47:13,573 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:47:13,747 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:47:13,750 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:47:14,140 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:47:14,307 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:47:14,308 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:47:14,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:47:14 BoogieIcfgContainer [2023-08-27 03:47:14,310 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:47:14,312 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:47:14,312 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:47:14,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:47:14,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:47:12" (1/3) ... [2023-08-27 03:47:14,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570daad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:47:14, skipping insertion in model container [2023-08-27 03:47:14,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:47:13" (2/3) ... [2023-08-27 03:47:14,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@570daad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:47:14, skipping insertion in model container [2023-08-27 03:47:14,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:47:14" (3/3) ... [2023-08-27 03:47:14,319 INFO L112 eAbstractionObserver]: Analyzing ICFG mix043.oepc.i [2023-08-27 03:47:14,336 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:47:14,336 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:47:14,337 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:47:14,432 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:47:14,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 155 places, 145 transitions, 310 flow [2023-08-27 03:47:14,532 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-27 03:47:14,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:47:14,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 03:47:14,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 145 transitions, 310 flow [2023-08-27 03:47:14,545 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 141 transitions, 294 flow [2023-08-27 03:47:14,549 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:47:14,557 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-27 03:47:14,559 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 141 transitions, 294 flow [2023-08-27 03:47:14,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 294 flow [2023-08-27 03:47:14,584 INFO L124 PetriNetUnfolderBase]: 3/141 cut-off events. [2023-08-27 03:47:14,584 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:47:14,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 154 conditions, 141 events. 3/141 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 111 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 03:47:14,588 INFO L119 LiptonReduction]: Number of co-enabled transitions 4666 [2023-08-27 03:47:18,733 INFO L134 LiptonReduction]: Checked pairs total: 17674 [2023-08-27 03:47:18,733 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-27 03:47:18,745 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:47:18,750 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;@1f11abba, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:47:18,750 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:47:18,753 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:47:18,753 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 03:47:18,753 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:47:18,753 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:18,754 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:47:18,754 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:18,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:18,759 INFO L85 PathProgramCache]: Analyzing trace with hash 632718, now seen corresponding path program 1 times [2023-08-27 03:47:18,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:18,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130587794] [2023-08-27 03:47:18,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:18,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:18,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:19,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:19,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:19,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130587794] [2023-08-27 03:47:19,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130587794] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:19,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:19,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:47:19,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374948195] [2023-08-27 03:47:19,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:19,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:19,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:19,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:19,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:19,126 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 268 [2023-08-27 03:47:19,129 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:19,129 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:19,129 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 268 [2023-08-27 03:47:19,130 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:21,050 INFO L124 PetriNetUnfolderBase]: 12064/17903 cut-off events. [2023-08-27 03:47:21,051 INFO L125 PetriNetUnfolderBase]: For 148/148 co-relation queries the response was YES. [2023-08-27 03:47:21,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34346 conditions, 17903 events. 12064/17903 cut-off events. For 148/148 co-relation queries the response was YES. Maximal size of possible extension queue 827. Compared 122022 event pairs, 1764 based on Foata normal form. 0/14083 useless extension candidates. Maximal degree in co-relation 34334. Up to 13549 conditions per place. [2023-08-27 03:47:21,193 INFO L140 encePairwiseOnDemand]: 264/268 looper letters, 50 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-27 03:47:21,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 60 transitions, 245 flow [2023-08-27 03:47:21,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:21,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:21,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 415 transitions. [2023-08-27 03:47:21,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5161691542288557 [2023-08-27 03:47:21,205 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 415 transitions. [2023-08-27 03:47:21,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 415 transitions. [2023-08-27 03:47:21,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:21,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 415 transitions. [2023-08-27 03:47:21,211 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.33333333333334) internal successors, (415), 3 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:21,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:21,216 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:21,218 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 90 flow. Second operand 3 states and 415 transitions. [2023-08-27 03:47:21,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 60 transitions, 245 flow [2023-08-27 03:47:21,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:47:21,223 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 86 flow [2023-08-27 03:47:21,225 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2023-08-27 03:47:21,228 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -3 predicate places. [2023-08-27 03:47:21,228 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 86 flow [2023-08-27 03:47:21,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:21,228 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:21,229 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:47:21,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:47:21,229 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:21,229 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:21,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1669907442, now seen corresponding path program 1 times [2023-08-27 03:47:21,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:21,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107444640] [2023-08-27 03:47:21,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:21,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:21,278 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-27 03:47:21,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:21,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107444640] [2023-08-27 03:47:21,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107444640] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:21,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:47:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17779517] [2023-08-27 03:47:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:21,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:21,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:21,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:21,282 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 03:47:21,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:21,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:21,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 03:47:21,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:22,950 INFO L124 PetriNetUnfolderBase]: 12064/16219 cut-off events. [2023-08-27 03:47:22,950 INFO L125 PetriNetUnfolderBase]: For 811/811 co-relation queries the response was YES. [2023-08-27 03:47:22,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33472 conditions, 16219 events. 12064/16219 cut-off events. For 811/811 co-relation queries the response was YES. Maximal size of possible extension queue 668. Compared 85246 event pairs, 12064 based on Foata normal form. 0/12266 useless extension candidates. Maximal degree in co-relation 33462. Up to 16125 conditions per place. [2023-08-27 03:47:23,061 INFO L140 encePairwiseOnDemand]: 263/268 looper letters, 28 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-27 03:47:23,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 33 transitions, 136 flow [2023-08-27 03:47:23,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:23,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:23,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 378 transitions. [2023-08-27 03:47:23,067 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701492537313433 [2023-08-27 03:47:23,067 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 378 transitions. [2023-08-27 03:47:23,067 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 378 transitions. [2023-08-27 03:47:23,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:23,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 378 transitions. [2023-08-27 03:47:23,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:23,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:23,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:23,071 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 86 flow. Second operand 3 states and 378 transitions. [2023-08-27 03:47:23,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 33 transitions, 136 flow [2023-08-27 03:47:23,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:23,072 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 76 flow [2023-08-27 03:47:23,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2023-08-27 03:47:23,073 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -7 predicate places. [2023-08-27 03:47:23,074 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 76 flow [2023-08-27 03:47:23,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:23,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:23,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:47:23,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:47:23,074 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:23,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1669907443, now seen corresponding path program 1 times [2023-08-27 03:47:23,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:23,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781888388] [2023-08-27 03:47:23,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:23,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:23,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:23,131 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-27 03:47:23,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:23,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781888388] [2023-08-27 03:47:23,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781888388] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:23,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:23,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:47:23,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744541353] [2023-08-27 03:47:23,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:23,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:23,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:23,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:23,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:23,134 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 03:47:23,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:23,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:23,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 03:47:23,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:24,230 INFO L124 PetriNetUnfolderBase]: 7784/10735 cut-off events. [2023-08-27 03:47:24,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:47:24,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21656 conditions, 10735 events. 7784/10735 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 57641 event pairs, 2133 based on Foata normal form. 0/8735 useless extension candidates. Maximal degree in co-relation 21650. Up to 8563 conditions per place. [2023-08-27 03:47:24,283 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 47 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-27 03:47:24,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 56 transitions, 232 flow [2023-08-27 03:47:24,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:24,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:24,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-27 03:47:24,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4987562189054726 [2023-08-27 03:47:24,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-27 03:47:24,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-27 03:47:24,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:24,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-27 03:47:24,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:24,288 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:24,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:24,289 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 76 flow. Second operand 3 states and 401 transitions. [2023-08-27 03:47:24,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 56 transitions, 232 flow [2023-08-27 03:47:24,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:24,291 INFO L231 Difference]: Finished difference. Result has 46 places, 37 transitions, 114 flow [2023-08-27 03:47:24,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=46, PETRI_TRANSITIONS=37} [2023-08-27 03:47:24,292 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -5 predicate places. [2023-08-27 03:47:24,292 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 37 transitions, 114 flow [2023-08-27 03:47:24,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:24,292 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:24,292 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:24,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:47:24,293 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:24,293 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:24,293 INFO L85 PathProgramCache]: Analyzing trace with hash 437072231, now seen corresponding path program 1 times [2023-08-27 03:47:24,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:24,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988156502] [2023-08-27 03:47:24,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:24,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:24,453 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-27 03:47:24,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:24,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988156502] [2023-08-27 03:47:24,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988156502] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:24,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:24,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:47:24,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227257216] [2023-08-27 03:47:24,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:24,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:47:24,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:24,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:47:24,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:47:24,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-27 03:47:24,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 37 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:24,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:24,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-27 03:47:24,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:27,445 INFO L124 PetriNetUnfolderBase]: 26699/36528 cut-off events. [2023-08-27 03:47:27,445 INFO L125 PetriNetUnfolderBase]: For 3530/3530 co-relation queries the response was YES. [2023-08-27 03:47:27,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86728 conditions, 36528 events. 26699/36528 cut-off events. For 3530/3530 co-relation queries the response was YES. Maximal size of possible extension queue 1073. Compared 206207 event pairs, 9680 based on Foata normal form. 0/31648 useless extension candidates. Maximal degree in co-relation 86720. Up to 22750 conditions per place. [2023-08-27 03:47:27,657 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 63 selfloop transitions, 8 changer transitions 0/71 dead transitions. [2023-08-27 03:47:27,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 358 flow [2023-08-27 03:47:27,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:47:27,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:47:27,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 394 transitions. [2023-08-27 03:47:27,659 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4900497512437811 [2023-08-27 03:47:27,659 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 394 transitions. [2023-08-27 03:47:27,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 394 transitions. [2023-08-27 03:47:27,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:27,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 394 transitions. [2023-08-27 03:47:27,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:27,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:27,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 268.0) internal successors, (1072), 4 states have internal predecessors, (1072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:27,662 INFO L175 Difference]: Start difference. First operand has 46 places, 37 transitions, 114 flow. Second operand 3 states and 394 transitions. [2023-08-27 03:47:27,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 358 flow [2023-08-27 03:47:27,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 71 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:27,668 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 171 flow [2023-08-27 03:47:27,669 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=171, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2023-08-27 03:47:27,669 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -2 predicate places. [2023-08-27 03:47:27,669 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 171 flow [2023-08-27 03:47:27,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:27,670 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:27,670 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:27,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:47:27,670 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:27,671 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 258866566, now seen corresponding path program 1 times [2023-08-27 03:47:27,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543253441] [2023-08-27 03:47:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:27,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:27,750 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-27 03:47:27,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:27,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543253441] [2023-08-27 03:47:27,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543253441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:27,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:27,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:47:27,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379114418] [2023-08-27 03:47:27,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:27,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:27,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:27,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:27,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:27,756 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 03:47:27,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:27,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:27,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 03:47:27,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:29,591 INFO L124 PetriNetUnfolderBase]: 14885/21182 cut-off events. [2023-08-27 03:47:29,591 INFO L125 PetriNetUnfolderBase]: For 7724/8316 co-relation queries the response was YES. [2023-08-27 03:47:29,649 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54994 conditions, 21182 events. 14885/21182 cut-off events. For 7724/8316 co-relation queries the response was YES. Maximal size of possible extension queue 999. Compared 131312 event pairs, 4079 based on Foata normal form. 66/19886 useless extension candidates. Maximal degree in co-relation 54983. Up to 8070 conditions per place. [2023-08-27 03:47:29,743 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 73 selfloop transitions, 9 changer transitions 0/90 dead transitions. [2023-08-27 03:47:29,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 90 transitions, 485 flow [2023-08-27 03:47:29,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:47:29,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:47:29,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 537 transitions. [2023-08-27 03:47:29,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009328358208955 [2023-08-27 03:47:29,750 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 537 transitions. [2023-08-27 03:47:29,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 537 transitions. [2023-08-27 03:47:29,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:29,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 537 transitions. [2023-08-27 03:47:29,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 134.25) internal successors, (537), 4 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:29,754 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:29,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:29,755 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 171 flow. Second operand 4 states and 537 transitions. [2023-08-27 03:47:29,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 90 transitions, 485 flow [2023-08-27 03:47:29,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 90 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:29,784 INFO L231 Difference]: Finished difference. Result has 51 places, 48 transitions, 213 flow [2023-08-27 03:47:29,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=213, PETRI_PLACES=51, PETRI_TRANSITIONS=48} [2023-08-27 03:47:29,786 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-08-27 03:47:29,786 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 48 transitions, 213 flow [2023-08-27 03:47:29,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.5) internal successors, (470), 4 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:29,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:29,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:29,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:47:29,787 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:29,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash 664170569, now seen corresponding path program 1 times [2023-08-27 03:47:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:29,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776800818] [2023-08-27 03:47:29,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:29,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:29,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:29,995 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-27 03:47:29,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:29,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776800818] [2023-08-27 03:47:29,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776800818] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:29,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:29,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:47:29,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076535704] [2023-08-27 03:47:29,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:29,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:29,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:29,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:30,000 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-27 03:47:30,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 48 transitions, 213 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:30,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:30,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-27 03:47:30,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:32,055 INFO L124 PetriNetUnfolderBase]: 18716/25583 cut-off events. [2023-08-27 03:47:32,056 INFO L125 PetriNetUnfolderBase]: For 20837/20837 co-relation queries the response was YES. [2023-08-27 03:47:32,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73317 conditions, 25583 events. 18716/25583 cut-off events. For 20837/20837 co-relation queries the response was YES. Maximal size of possible extension queue 765. Compared 135577 event pairs, 4537 based on Foata normal form. 0/24382 useless extension candidates. Maximal degree in co-relation 73305. Up to 11580 conditions per place. [2023-08-27 03:47:32,179 INFO L140 encePairwiseOnDemand]: 260/268 looper letters, 93 selfloop transitions, 8 changer transitions 0/101 dead transitions. [2023-08-27 03:47:32,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 101 transitions, 663 flow [2023-08-27 03:47:32,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:47:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:47:32,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-27 03:47:32,182 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47947761194029853 [2023-08-27 03:47:32,182 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-27 03:47:32,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-27 03:47:32,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:32,182 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-27 03:47:32,183 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:32,185 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:32,186 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:32,186 INFO L175 Difference]: Start difference. First operand has 51 places, 48 transitions, 213 flow. Second operand 4 states and 514 transitions. [2023-08-27 03:47:32,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 101 transitions, 663 flow [2023-08-27 03:47:32,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 101 transitions, 617 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:32,198 INFO L231 Difference]: Finished difference. Result has 55 places, 52 transitions, 253 flow [2023-08-27 03:47:32,198 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=55, PETRI_TRANSITIONS=52} [2023-08-27 03:47:32,199 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-27 03:47:32,199 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 52 transitions, 253 flow [2023-08-27 03:47:32,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:32,199 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:32,199 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:32,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:47:32,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:32,200 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash -885552175, now seen corresponding path program 1 times [2023-08-27 03:47:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:32,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158363151] [2023-08-27 03:47:32,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:32,382 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-27 03:47:32,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:32,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158363151] [2023-08-27 03:47:32,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158363151] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:32,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:32,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:47:32,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066712275] [2023-08-27 03:47:32,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:32,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:32,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:32,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:32,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:32,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 03:47:32,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 52 transitions, 253 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:32,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:32,385 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 03:47:32,385 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:33,691 INFO L124 PetriNetUnfolderBase]: 11025/16497 cut-off events. [2023-08-27 03:47:33,692 INFO L125 PetriNetUnfolderBase]: For 9498/10184 co-relation queries the response was YES. [2023-08-27 03:47:33,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46437 conditions, 16497 events. 11025/16497 cut-off events. For 9498/10184 co-relation queries the response was YES. Maximal size of possible extension queue 766. Compared 107261 event pairs, 1517 based on Foata normal form. 1056/16502 useless extension candidates. Maximal degree in co-relation 46422. Up to 8705 conditions per place. [2023-08-27 03:47:33,770 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 76 selfloop transitions, 6 changer transitions 0/93 dead transitions. [2023-08-27 03:47:33,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 569 flow [2023-08-27 03:47:33,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:47:33,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:47:33,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-27 03:47:33,772 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48507462686567165 [2023-08-27 03:47:33,772 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-27 03:47:33,772 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-27 03:47:33,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:33,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-27 03:47:33,774 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:33,775 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:33,776 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:33,776 INFO L175 Difference]: Start difference. First operand has 55 places, 52 transitions, 253 flow. Second operand 4 states and 520 transitions. [2023-08-27 03:47:33,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 569 flow [2023-08-27 03:47:33,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 93 transitions, 566 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:33,805 INFO L231 Difference]: Finished difference. Result has 59 places, 53 transitions, 280 flow [2023-08-27 03:47:33,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=280, PETRI_PLACES=59, PETRI_TRANSITIONS=53} [2023-08-27 03:47:33,806 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 8 predicate places. [2023-08-27 03:47:33,806 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 53 transitions, 280 flow [2023-08-27 03:47:33,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:33,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:33,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:33,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:47:33,806 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:33,807 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:33,807 INFO L85 PathProgramCache]: Analyzing trace with hash 2023454573, now seen corresponding path program 1 times [2023-08-27 03:47:33,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:33,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079099601] [2023-08-27 03:47:33,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:33,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:34,036 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-27 03:47:34,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:34,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079099601] [2023-08-27 03:47:34,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079099601] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:34,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:34,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:34,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989143593] [2023-08-27 03:47:34,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:34,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:34,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:34,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:34,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:34,039 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 03:47:34,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 53 transitions, 280 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:34,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:34,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 03:47:34,040 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:35,185 INFO L124 PetriNetUnfolderBase]: 7944/12415 cut-off events. [2023-08-27 03:47:35,186 INFO L125 PetriNetUnfolderBase]: For 13724/14003 co-relation queries the response was YES. [2023-08-27 03:47:35,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39276 conditions, 12415 events. 7944/12415 cut-off events. For 13724/14003 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 82085 event pairs, 1465 based on Foata normal form. 718/12065 useless extension candidates. Maximal degree in co-relation 39258. Up to 3733 conditions per place. [2023-08-27 03:47:35,254 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 84 selfloop transitions, 10 changer transitions 0/105 dead transitions. [2023-08-27 03:47:35,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 105 transitions, 653 flow [2023-08-27 03:47:35,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:35,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:35,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-27 03:47:35,257 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48582089552238805 [2023-08-27 03:47:35,257 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-27 03:47:35,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-27 03:47:35,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:35,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-27 03:47:35,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:35,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:35,262 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:35,262 INFO L175 Difference]: Start difference. First operand has 59 places, 53 transitions, 280 flow. Second operand 5 states and 651 transitions. [2023-08-27 03:47:35,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 105 transitions, 653 flow [2023-08-27 03:47:35,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 105 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:47:35,278 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 316 flow [2023-08-27 03:47:35,279 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2023-08-27 03:47:35,279 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 12 predicate places. [2023-08-27 03:47:35,279 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 316 flow [2023-08-27 03:47:35,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:35,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:35,280 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-27 03:47:35,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:47:35,280 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:35,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:35,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1837312041, now seen corresponding path program 1 times [2023-08-27 03:47:35,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:35,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475553036] [2023-08-27 03:47:35,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:35,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:35,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:35,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:35,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475553036] [2023-08-27 03:47:35,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475553036] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:35,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:35,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:47:35,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690190855] [2023-08-27 03:47:35,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:35,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:35,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:35,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:35,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:35,363 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 268 [2023-08-27 03:47:35,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:35,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:35,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 268 [2023-08-27 03:47:35,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:36,576 INFO L124 PetriNetUnfolderBase]: 6939/10697 cut-off events. [2023-08-27 03:47:36,577 INFO L125 PetriNetUnfolderBase]: For 18709/18958 co-relation queries the response was YES. [2023-08-27 03:47:36,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36759 conditions, 10697 events. 6939/10697 cut-off events. For 18709/18958 co-relation queries the response was YES. Maximal size of possible extension queue 514. Compared 68183 event pairs, 1399 based on Foata normal form. 12/10433 useless extension candidates. Maximal degree in co-relation 36739. Up to 3733 conditions per place. [2023-08-27 03:47:36,652 INFO L140 encePairwiseOnDemand]: 259/268 looper letters, 85 selfloop transitions, 13 changer transitions 0/109 dead transitions. [2023-08-27 03:47:36,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 109 transitions, 715 flow [2023-08-27 03:47:36,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:36,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 665 transitions. [2023-08-27 03:47:36,654 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962686567164179 [2023-08-27 03:47:36,655 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 665 transitions. [2023-08-27 03:47:36,655 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 665 transitions. [2023-08-27 03:47:36,655 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:36,655 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 665 transitions. [2023-08-27 03:47:36,657 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,659 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 268.0) internal successors, (1608), 6 states have internal predecessors, (1608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,659 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 316 flow. Second operand 5 states and 665 transitions. [2023-08-27 03:47:36,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 109 transitions, 715 flow [2023-08-27 03:47:36,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 109 transitions, 699 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:47:36,685 INFO L231 Difference]: Finished difference. Result has 65 places, 58 transitions, 375 flow [2023-08-27 03:47:36,685 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=375, PETRI_PLACES=65, PETRI_TRANSITIONS=58} [2023-08-27 03:47:36,686 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 14 predicate places. [2023-08-27 03:47:36,686 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 58 transitions, 375 flow [2023-08-27 03:47:36,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.0) internal successors, (590), 5 states have internal predecessors, (590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,687 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:36,687 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-27 03:47:36,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:47:36,687 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:36,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1654663801, now seen corresponding path program 1 times [2023-08-27 03:47:36,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:36,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601354751] [2023-08-27 03:47:36,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:37,196 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-27 03:47:37,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:37,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601354751] [2023-08-27 03:47:37,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601354751] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:37,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:37,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528034736] [2023-08-27 03:47:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:37,198 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:47:37,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:37,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:47:37,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:47:37,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 03:47:37,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 58 transitions, 375 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:37,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:37,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 03:47:37,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:38,731 INFO L124 PetriNetUnfolderBase]: 8526/13260 cut-off events. [2023-08-27 03:47:38,731 INFO L125 PetriNetUnfolderBase]: For 31661/32063 co-relation queries the response was YES. [2023-08-27 03:47:38,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49142 conditions, 13260 events. 8526/13260 cut-off events. For 31661/32063 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 87564 event pairs, 1099 based on Foata normal form. 77/13081 useless extension candidates. Maximal degree in co-relation 49121. Up to 9264 conditions per place. [2023-08-27 03:47:38,840 INFO L140 encePairwiseOnDemand]: 260/268 looper letters, 126 selfloop transitions, 17 changer transitions 4/158 dead transitions. [2023-08-27 03:47:38,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 158 transitions, 1221 flow [2023-08-27 03:47:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:47:38,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:47:38,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 891 transitions. [2023-08-27 03:47:38,843 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47494669509594883 [2023-08-27 03:47:38,843 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 891 transitions. [2023-08-27 03:47:38,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 891 transitions. [2023-08-27 03:47:38,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:38,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 891 transitions. [2023-08-27 03:47:38,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 127.28571428571429) internal successors, (891), 7 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:38,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:38,849 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:38,849 INFO L175 Difference]: Start difference. First operand has 65 places, 58 transitions, 375 flow. Second operand 7 states and 891 transitions. [2023-08-27 03:47:38,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 158 transitions, 1221 flow [2023-08-27 03:47:39,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 158 transitions, 1141 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 03:47:39,108 INFO L231 Difference]: Finished difference. Result has 73 places, 76 transitions, 493 flow [2023-08-27 03:47:39,109 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=341, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=493, PETRI_PLACES=73, PETRI_TRANSITIONS=76} [2023-08-27 03:47:39,110 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2023-08-27 03:47:39,110 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 76 transitions, 493 flow [2023-08-27 03:47:39,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:39,111 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:39,111 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-27 03:47:39,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:47:39,111 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:39,111 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:39,111 INFO L85 PathProgramCache]: Analyzing trace with hash 645975777, now seen corresponding path program 2 times [2023-08-27 03:47:39,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:39,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755883813] [2023-08-27 03:47:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:39,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:39,375 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-27 03:47:39,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:39,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755883813] [2023-08-27 03:47:39,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755883813] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:39,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:39,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:47:39,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739430234] [2023-08-27 03:47:39,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:39,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:47:39,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:39,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:47:39,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:47:39,378 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 03:47:39,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 76 transitions, 493 flow. Second operand has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:39,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:39,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 03:47:39,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:40,579 INFO L124 PetriNetUnfolderBase]: 7750/12087 cut-off events. [2023-08-27 03:47:40,579 INFO L125 PetriNetUnfolderBase]: For 28458/28774 co-relation queries the response was YES. [2023-08-27 03:47:40,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46791 conditions, 12087 events. 7750/12087 cut-off events. For 28458/28774 co-relation queries the response was YES. Maximal size of possible extension queue 654. Compared 80582 event pairs, 1265 based on Foata normal form. 320/12088 useless extension candidates. Maximal degree in co-relation 46765. Up to 4681 conditions per place. [2023-08-27 03:47:40,684 INFO L140 encePairwiseOnDemand]: 261/268 looper letters, 135 selfloop transitions, 14 changer transitions 0/160 dead transitions. [2023-08-27 03:47:40,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 160 transitions, 1182 flow [2023-08-27 03:47:40,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:47:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:47:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 780 transitions. [2023-08-27 03:47:40,686 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48507462686567165 [2023-08-27 03:47:40,686 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 780 transitions. [2023-08-27 03:47:40,686 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 780 transitions. [2023-08-27 03:47:40,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:40,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 780 transitions. [2023-08-27 03:47:40,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.0) internal successors, (780), 6 states have internal predecessors, (780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:40,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:40,691 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:40,691 INFO L175 Difference]: Start difference. First operand has 73 places, 76 transitions, 493 flow. Second operand 6 states and 780 transitions. [2023-08-27 03:47:40,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 160 transitions, 1182 flow [2023-08-27 03:47:41,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 160 transitions, 1182 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:47:41,107 INFO L231 Difference]: Finished difference. Result has 80 places, 75 transitions, 519 flow [2023-08-27 03:47:41,107 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=519, PETRI_PLACES=80, PETRI_TRANSITIONS=75} [2023-08-27 03:47:41,108 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 29 predicate places. [2023-08-27 03:47:41,108 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 75 transitions, 519 flow [2023-08-27 03:47:41,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:41,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:41,108 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:41,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:47:41,108 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:41,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:41,109 INFO L85 PathProgramCache]: Analyzing trace with hash 28587290, now seen corresponding path program 1 times [2023-08-27 03:47:41,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:41,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265160871] [2023-08-27 03:47:41,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:41,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:41,351 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-27 03:47:41,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:41,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265160871] [2023-08-27 03:47:41,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265160871] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:41,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:41,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:41,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269991871] [2023-08-27 03:47:41,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:41,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:41,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:41,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:41,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:41,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 268 [2023-08-27 03:47:41,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 75 transitions, 519 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:41,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:41,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 268 [2023-08-27 03:47:41,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:43,419 INFO L124 PetriNetUnfolderBase]: 17020/25162 cut-off events. [2023-08-27 03:47:43,419 INFO L125 PetriNetUnfolderBase]: For 95018/95018 co-relation queries the response was YES. [2023-08-27 03:47:43,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108660 conditions, 25162 events. 17020/25162 cut-off events. For 95018/95018 co-relation queries the response was YES. Maximal size of possible extension queue 964. Compared 161714 event pairs, 2360 based on Foata normal form. 17/24958 useless extension candidates. Maximal degree in co-relation 108630. Up to 9382 conditions per place. [2023-08-27 03:47:43,701 INFO L140 encePairwiseOnDemand]: 258/268 looper letters, 229 selfloop transitions, 27 changer transitions 6/262 dead transitions. [2023-08-27 03:47:43,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 262 transitions, 2349 flow [2023-08-27 03:47:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:47:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:47:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 778 transitions. [2023-08-27 03:47:43,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48383084577114427 [2023-08-27 03:47:43,703 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 778 transitions. [2023-08-27 03:47:43,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 778 transitions. [2023-08-27 03:47:43,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:43,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 778 transitions. [2023-08-27 03:47:43,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.66666666666666) internal successors, (778), 6 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:43,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:43,708 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:43,708 INFO L175 Difference]: Start difference. First operand has 80 places, 75 transitions, 519 flow. Second operand 6 states and 778 transitions. [2023-08-27 03:47:43,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 262 transitions, 2349 flow [2023-08-27 03:47:44,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 262 transitions, 2252 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:47:44,849 INFO L231 Difference]: Finished difference. Result has 84 places, 97 transitions, 769 flow [2023-08-27 03:47:44,849 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=769, PETRI_PLACES=84, PETRI_TRANSITIONS=97} [2023-08-27 03:47:44,849 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 33 predicate places. [2023-08-27 03:47:44,849 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 97 transitions, 769 flow [2023-08-27 03:47:44,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:44,850 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:44,850 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] [2023-08-27 03:47:44,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:47:44,850 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:44,850 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:44,851 INFO L85 PathProgramCache]: Analyzing trace with hash 559246805, now seen corresponding path program 1 times [2023-08-27 03:47:44,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:44,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224025334] [2023-08-27 03:47:44,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:44,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:44,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:45,098 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-27 03:47:45,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:45,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224025334] [2023-08-27 03:47:45,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224025334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:45,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:45,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:47:45,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244681420] [2023-08-27 03:47:45,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:45,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:47:45,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:45,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:47:45,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:47:45,100 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 268 [2023-08-27 03:47:45,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 97 transitions, 769 flow. Second operand has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 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-27 03:47:45,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:45,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 268 [2023-08-27 03:47:45,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:46,845 INFO L124 PetriNetUnfolderBase]: 11521/17879 cut-off events. [2023-08-27 03:47:46,845 INFO L125 PetriNetUnfolderBase]: For 55951/56724 co-relation queries the response was YES. [2023-08-27 03:47:46,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74410 conditions, 17879 events. 11521/17879 cut-off events. For 55951/56724 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 127698 event pairs, 1723 based on Foata normal form. 138/17679 useless extension candidates. Maximal degree in co-relation 74377. Up to 7039 conditions per place. [2023-08-27 03:47:47,003 INFO L140 encePairwiseOnDemand]: 257/268 looper letters, 93 selfloop transitions, 18 changer transitions 45/170 dead transitions. [2023-08-27 03:47:47,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 170 transitions, 1483 flow [2023-08-27 03:47:47,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:47:47,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:47:47,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 877 transitions. [2023-08-27 03:47:47,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46748400852878463 [2023-08-27 03:47:47,005 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 877 transitions. [2023-08-27 03:47:47,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 877 transitions. [2023-08-27 03:47:47,006 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:47,006 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 877 transitions. [2023-08-27 03:47:47,008 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:47,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:47,010 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:47,010 INFO L175 Difference]: Start difference. First operand has 84 places, 97 transitions, 769 flow. Second operand 7 states and 877 transitions. [2023-08-27 03:47:47,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 170 transitions, 1483 flow [2023-08-27 03:47:48,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 170 transitions, 1476 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:48,822 INFO L231 Difference]: Finished difference. Result has 87 places, 68 transitions, 553 flow [2023-08-27 03:47:48,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=702, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=553, PETRI_PLACES=87, PETRI_TRANSITIONS=68} [2023-08-27 03:47:48,823 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 36 predicate places. [2023-08-27 03:47:48,823 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 68 transitions, 553 flow [2023-08-27 03:47:48,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.0) internal successors, (812), 7 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-27 03:47:48,823 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:48,823 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, 1, 1] [2023-08-27 03:47:48,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:47:48,823 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:48,824 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 117311908, now seen corresponding path program 1 times [2023-08-27 03:47:48,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:48,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274852022] [2023-08-27 03:47:48,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:48,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:49,034 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-27 03:47:49,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:49,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274852022] [2023-08-27 03:47:49,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274852022] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:49,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:49,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:47:49,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783892609] [2023-08-27 03:47:49,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:49,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:49,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:49,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:49,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:49,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 268 [2023-08-27 03:47:49,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 68 transitions, 553 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:49,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:49,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 268 [2023-08-27 03:47:49,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:50,528 INFO L124 PetriNetUnfolderBase]: 11056/16296 cut-off events. [2023-08-27 03:47:50,528 INFO L125 PetriNetUnfolderBase]: For 70099/70099 co-relation queries the response was YES. [2023-08-27 03:47:50,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 72048 conditions, 16296 events. 11056/16296 cut-off events. For 70099/70099 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 97923 event pairs, 2339 based on Foata normal form. 1/16297 useless extension candidates. Maximal degree in co-relation 72016. Up to 9219 conditions per place. [2023-08-27 03:47:50,675 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 80 selfloop transitions, 8 changer transitions 37/125 dead transitions. [2023-08-27 03:47:50,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 125 transitions, 1216 flow [2023-08-27 03:47:50,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:47:50,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:47:50,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-08-27 03:47:50,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46828358208955223 [2023-08-27 03:47:50,677 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-08-27 03:47:50,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-08-27 03:47:50,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:50,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-08-27 03:47:50,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:50,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:50,680 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 268.0) internal successors, (1340), 5 states have internal predecessors, (1340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:50,680 INFO L175 Difference]: Start difference. First operand has 87 places, 68 transitions, 553 flow. Second operand 4 states and 502 transitions. [2023-08-27 03:47:50,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 125 transitions, 1216 flow [2023-08-27 03:47:51,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 125 transitions, 1064 flow, removed 28 selfloop flow, removed 11 redundant places. [2023-08-27 03:47:51,377 INFO L231 Difference]: Finished difference. Result has 77 places, 56 transitions, 381 flow [2023-08-27 03:47:51,377 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=471, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=381, PETRI_PLACES=77, PETRI_TRANSITIONS=56} [2023-08-27 03:47:51,377 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 26 predicate places. [2023-08-27 03:47:51,377 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 56 transitions, 381 flow [2023-08-27 03:47:51,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:51,378 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:51,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, 1, 1] [2023-08-27 03:47:51,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:47:51,378 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:51,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:51,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1722109176, now seen corresponding path program 2 times [2023-08-27 03:47:51,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:51,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660051602] [2023-08-27 03:47:51,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:51,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:51,767 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-27 03:47:51,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:51,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660051602] [2023-08-27 03:47:51,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660051602] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:51,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:51,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:47:51,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894796238] [2023-08-27 03:47:51,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:51,768 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:47:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:47:51,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:47:51,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 268 [2023-08-27 03:47:51,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 56 transitions, 381 flow. Second operand has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:51,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:51,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 268 [2023-08-27 03:47:51,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:52,474 INFO L124 PetriNetUnfolderBase]: 2421/3647 cut-off events. [2023-08-27 03:47:52,475 INFO L125 PetriNetUnfolderBase]: For 8686/8686 co-relation queries the response was YES. [2023-08-27 03:47:52,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14523 conditions, 3647 events. 2421/3647 cut-off events. For 8686/8686 co-relation queries the response was YES. Maximal size of possible extension queue 138. Compared 17064 event pairs, 191 based on Foata normal form. 1/3648 useless extension candidates. Maximal degree in co-relation 14492. Up to 1497 conditions per place. [2023-08-27 03:47:52,489 INFO L140 encePairwiseOnDemand]: 256/268 looper letters, 88 selfloop transitions, 18 changer transitions 126/232 dead transitions. [2023-08-27 03:47:52,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 232 transitions, 1897 flow [2023-08-27 03:47:52,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 03:47:52,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 03:47:52,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1945 transitions. [2023-08-27 03:47:52,493 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269095697980685 [2023-08-27 03:47:52,493 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1945 transitions. [2023-08-27 03:47:52,493 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1945 transitions. [2023-08-27 03:47:52,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:52,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1945 transitions. [2023-08-27 03:47:52,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 114.41176470588235) internal successors, (1945), 17 states have internal predecessors, (1945), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:52,503 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 268.0) internal successors, (4824), 18 states have internal predecessors, (4824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:52,504 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 268.0) internal successors, (4824), 18 states have internal predecessors, (4824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:52,504 INFO L175 Difference]: Start difference. First operand has 77 places, 56 transitions, 381 flow. Second operand 17 states and 1945 transitions. [2023-08-27 03:47:52,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 232 transitions, 1897 flow [2023-08-27 03:47:52,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 232 transitions, 1569 flow, removed 42 selfloop flow, removed 16 redundant places. [2023-08-27 03:47:52,552 INFO L231 Difference]: Finished difference. Result has 83 places, 57 transitions, 346 flow [2023-08-27 03:47:52,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=346, PETRI_PLACES=83, PETRI_TRANSITIONS=57} [2023-08-27 03:47:52,552 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 32 predicate places. [2023-08-27 03:47:52,552 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 57 transitions, 346 flow [2023-08-27 03:47:52,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 107.5) internal successors, (860), 8 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:52,553 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:52,553 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, 1, 1] [2023-08-27 03:47:52,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:47:52,553 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:52,553 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:52,553 INFO L85 PathProgramCache]: Analyzing trace with hash -397051280, now seen corresponding path program 3 times [2023-08-27 03:47:52,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:52,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910111652] [2023-08-27 03:47:52,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:52,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:53,890 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-27 03:47:53,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:53,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910111652] [2023-08-27 03:47:53,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910111652] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:53,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:53,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:47:53,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596202052] [2023-08-27 03:47:53,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:53,892 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:47:53,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:53,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:47:53,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:47:53,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 268 [2023-08-27 03:47:53,894 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 57 transitions, 346 flow. Second operand has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:53,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:53,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 268 [2023-08-27 03:47:53,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:54,199 INFO L124 PetriNetUnfolderBase]: 763/1301 cut-off events. [2023-08-27 03:47:54,199 INFO L125 PetriNetUnfolderBase]: For 3147/3186 co-relation queries the response was YES. [2023-08-27 03:47:54,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4572 conditions, 1301 events. 763/1301 cut-off events. For 3147/3186 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5842 event pairs, 184 based on Foata normal form. 17/1307 useless extension candidates. Maximal degree in co-relation 4550. Up to 550 conditions per place. [2023-08-27 03:47:54,204 INFO L140 encePairwiseOnDemand]: 262/268 looper letters, 54 selfloop transitions, 8 changer transitions 47/114 dead transitions. [2023-08-27 03:47:54,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 114 transitions, 813 flow [2023-08-27 03:47:54,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:47:54,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:47:54,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 729 transitions. [2023-08-27 03:47:54,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4533582089552239 [2023-08-27 03:47:54,206 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 729 transitions. [2023-08-27 03:47:54,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 729 transitions. [2023-08-27 03:47:54,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:54,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 729 transitions. [2023-08-27 03:47:54,208 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.5) internal successors, (729), 6 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-27 03:47:54,210 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:54,210 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 268.0) internal successors, (1876), 7 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:54,210 INFO L175 Difference]: Start difference. First operand has 83 places, 57 transitions, 346 flow. Second operand 6 states and 729 transitions. [2023-08-27 03:47:54,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 114 transitions, 813 flow [2023-08-27 03:47:54,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 114 transitions, 719 flow, removed 22 selfloop flow, removed 17 redundant places. [2023-08-27 03:47:54,218 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 305 flow [2023-08-27 03:47:54,218 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=305, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2023-08-27 03:47:54,218 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 15 predicate places. [2023-08-27 03:47:54,218 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 305 flow [2023-08-27 03:47:54,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:54,219 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:54,219 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, 1, 1] [2023-08-27 03:47:54,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:47:54,219 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:54,219 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:54,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1709676988, now seen corresponding path program 4 times [2023-08-27 03:47:54,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:54,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138527877] [2023-08-27 03:47:54,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:54,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:54,944 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-27 03:47:54,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:54,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138527877] [2023-08-27 03:47:54,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138527877] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:54,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:54,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:47:54,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984896986] [2023-08-27 03:47:54,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:54,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:47:54,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:54,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:47:54,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:47:54,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 268 [2023-08-27 03:47:54,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 305 flow. Second operand has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:54,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:54,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 268 [2023-08-27 03:47:54,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:55,291 INFO L124 PetriNetUnfolderBase]: 726/1260 cut-off events. [2023-08-27 03:47:55,291 INFO L125 PetriNetUnfolderBase]: For 1363/1373 co-relation queries the response was YES. [2023-08-27 03:47:55,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4138 conditions, 1260 events. 726/1260 cut-off events. For 1363/1373 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5963 event pairs, 53 based on Foata normal form. 1/1261 useless extension candidates. Maximal degree in co-relation 4121. Up to 443 conditions per place. [2023-08-27 03:47:55,296 INFO L140 encePairwiseOnDemand]: 260/268 looper letters, 89 selfloop transitions, 10 changer transitions 40/144 dead transitions. [2023-08-27 03:47:55,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 144 transitions, 922 flow [2023-08-27 03:47:55,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:47:55,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:47:55,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 847 transitions. [2023-08-27 03:47:55,298 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45149253731343286 [2023-08-27 03:47:55,298 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 847 transitions. [2023-08-27 03:47:55,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 847 transitions. [2023-08-27 03:47:55,298 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:55,298 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 847 transitions. [2023-08-27 03:47:55,300 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.0) internal successors, (847), 7 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:55,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:55,302 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 268.0) internal successors, (2144), 8 states have internal predecessors, (2144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:55,302 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 305 flow. Second operand 7 states and 847 transitions. [2023-08-27 03:47:55,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 144 transitions, 922 flow [2023-08-27 03:47:55,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 144 transitions, 895 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-08-27 03:47:55,308 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 340 flow [2023-08-27 03:47:55,308 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=268, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=340, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2023-08-27 03:47:55,309 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 19 predicate places. [2023-08-27 03:47:55,309 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 340 flow [2023-08-27 03:47:55,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 114.0) internal successors, (912), 8 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:55,309 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:55,309 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, 1, 1] [2023-08-27 03:47:55,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:47:55,309 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:55,310 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:55,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1781048340, now seen corresponding path program 5 times [2023-08-27 03:47:55,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:55,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618237450] [2023-08-27 03:47:55,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:55,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:55,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:47:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:55,463 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:47:55,463 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:47:55,464 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:47:55,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 03:47:55,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:47:55,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 03:47:55,468 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:47:55,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 03:47:55,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:47:55,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 03:47:55,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:47:55,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 03:47:55,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:47:55,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:47:55,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:47:55,469 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:55,475 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:47:55,476 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:47:55,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:47:55 BasicIcfg [2023-08-27 03:47:55,586 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:47:55,587 INFO L158 Benchmark]: Toolchain (without parser) took 42716.91ms. Allocated memory was 364.9MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 339.9MB in the beginning and 4.9GB in the end (delta: -4.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-27 03:47:55,587 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 364.9MB. Free memory is still 341.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:47:55,587 INFO L158 Benchmark]: CACSL2BoogieTranslator took 527.49ms. Allocated memory is still 364.9MB. Free memory was 339.4MB in the beginning and 315.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:55,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.83ms. Allocated memory is still 364.9MB. Free memory was 315.3MB in the beginning and 313.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:55,588 INFO L158 Benchmark]: Boogie Preprocessor took 31.13ms. Allocated memory is still 364.9MB. Free memory was 313.1MB in the beginning and 311.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:55,588 INFO L158 Benchmark]: RCFGBuilder took 834.91ms. Allocated memory is still 364.9MB. Free memory was 311.0MB in the beginning and 321.4MB in the end (delta: -10.4MB). Peak memory consumption was 31.7MB. Max. memory is 16.0GB. [2023-08-27 03:47:55,588 INFO L158 Benchmark]: TraceAbstraction took 41274.84ms. Allocated memory was 364.9MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 321.2MB in the beginning and 4.9GB in the end (delta: -4.6GB). Peak memory consumption was 1.1GB. Max. memory is 16.0GB. [2023-08-27 03:47:55,589 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.16ms. Allocated memory is still 364.9MB. Free memory is still 341.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 527.49ms. Allocated memory is still 364.9MB. Free memory was 339.4MB in the beginning and 315.3MB in the end (delta: 24.0MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.83ms. Allocated memory is still 364.9MB. Free memory was 315.3MB in the beginning and 313.1MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.13ms. Allocated memory is still 364.9MB. Free memory was 313.1MB in the beginning and 311.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 834.91ms. Allocated memory is still 364.9MB. Free memory was 311.0MB in the beginning and 321.4MB in the end (delta: -10.4MB). Peak memory consumption was 31.7MB. Max. memory is 16.0GB. * TraceAbstraction took 41274.84ms. Allocated memory was 364.9MB in the beginning and 6.0GB in the end (delta: 5.7GB). Free memory was 321.2MB in the beginning and 4.9GB in the end (delta: -4.6GB). Peak memory consumption was 1.1GB. 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: 4.2s, 151 PlacesBefore, 51 PlacesAfterwards, 141 TransitionsBefore, 39 TransitionsAfterwards, 4666 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 123 TotalNumberOfCompositions, 17674 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6427, independent: 6048, independent conditional: 0, independent unconditional: 6048, dependent: 379, dependent conditional: 0, dependent unconditional: 379, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2585, independent: 2511, independent conditional: 0, independent unconditional: 2511, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6427, independent: 3537, independent conditional: 0, independent unconditional: 3537, dependent: 305, dependent conditional: 0, dependent unconditional: 305, unknown: 2585, unknown conditional: 0, unknown unconditional: 2585] , Statistics on independence cache: Total cache size (in pairs): 258, Positive cache size: 232, Positive conditional cache size: 0, Positive unconditional cache size: 232, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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_p1_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t1129; [L872] FCALL, FORK 0 pthread_create(&t1129, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1129, ((void *)0), P0, ((void *)0))=-3, t1129={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1130; [L874] FCALL, FORK 0 pthread_create(&t1130, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1130, ((void *)0), P1, ((void *)0))=-2, t1129={5:0}, t1130={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1131; [L876] FCALL, FORK 0 pthread_create(&t1131, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1131, ((void *)0), P2, ((void *)0))=-1, t1129={5:0}, t1130={6:0}, t1131={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t1132; [L878] FCALL, FORK 0 pthread_create(&t1132, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1132, ((void *)0), P3, ((void *)0))=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L784] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L807] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L824] 4 z = 2 [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L797] EXPR 2 __unbuffered_cnt + 1 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] [L777] EXPR 1 __unbuffered_cnt + 1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L817] EXPR 3 __unbuffered_cnt + 1 [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L856] EXPR 4 __unbuffered_cnt + 1 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1129={5:0}, t1130={6:0}, t1131={7:0}, t1132={3:0}, weak$$choice2=0, x=1, y=1, z=2] [L891] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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", "mix043.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 817]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 874]: 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: 878]: 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: 872]: 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: 876]: 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, 190 locations, 23 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: 41.0s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 31.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 953 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 953 mSDsluCounter, 75 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2121 IncrementalHoareTripleChecker+Invalid, 2241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 36 mSDtfsCounter, 2121 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=769occurred 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.4s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 281 ConstructedInterpolants, 0 QuantifiedInterpolants, 2762 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-27 03:47:55,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...