/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/mix036.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:45:46,518 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:45:46,604 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:45:46,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:45:46,609 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:45:46,637 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:45:46,638 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:45:46,638 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:45:46,639 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:45:46,643 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:45:46,643 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:45:46,643 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:45:46,643 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:45:46,645 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:45:46,645 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:45:46,645 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:45:46,645 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:45:46,646 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:45:46,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:45:46,646 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:45:46,646 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:45:46,647 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:45:46,647 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:45:46,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:45:46,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:45:46,648 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:45:46,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:45:46,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:46,649 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:45:46,649 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:45:46,650 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:45:46,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:45:46,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:45:46,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:45:46,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:45:46,651 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:45:46,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:45:47,004 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:45:47,006 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:45:47,007 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:45:47,007 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:45:47,009 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2023-08-27 03:45:48,215 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:45:48,483 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:45:48,484 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036.oepc.i [2023-08-27 03:45:48,509 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be5eb0be/e4ccd372541f45a080338d87e9b2ea2f/FLAG238a5ac1d [2023-08-27 03:45:48,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3be5eb0be/e4ccd372541f45a080338d87e9b2ea2f [2023-08-27 03:45:48,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:45:48,532 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:45:48,535 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:48,535 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:45:48,538 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:45:48,540 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:48" (1/1) ... [2023-08-27 03:45:48,540 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3527250 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:48, skipping insertion in model container [2023-08-27 03:45:48,541 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:45:48" (1/1) ... [2023-08-27 03:45:48,598 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:45:48,999 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:49,013 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:45:49,043 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:49,045 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:45:49,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:45:49,122 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:49,122 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:45:49,127 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:45:49,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49 WrapperNode [2023-08-27 03:45:49,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:45:49,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:49,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:45:49,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:45:49,134 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:45:49" (1/1) ... [2023-08-27 03:45:49,160 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:45:49" (1/1) ... [2023-08-27 03:45:49,194 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155 [2023-08-27 03:45:49,196 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:45:49,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:45:49,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:45:49,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:45:49,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (1/1) ... [2023-08-27 03:45:49,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (1/1) ... [2023-08-27 03:45:49,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (1/1) ... [2023-08-27 03:45:49,207 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (1/1) ... [2023-08-27 03:45:49,215 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (1/1) ... [2023-08-27 03:45:49,217 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (1/1) ... [2023-08-27 03:45:49,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (1/1) ... [2023-08-27 03:45:49,221 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (1/1) ... [2023-08-27 03:45:49,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:45:49,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:45:49,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:45:49,226 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:45:49,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (1/1) ... [2023-08-27 03:45:49,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:45:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:45:49,256 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:45:49,273 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:45:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:45:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:45:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:45:49,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:45:49,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:45:49,324 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:45:49,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:45:49,324 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:45:49,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:45:49,324 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:45:49,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:45:49,324 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:45:49,324 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:45:49,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:45:49,325 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:45:49,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:45:49,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:45:49,327 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:45:49,445 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:45:49,447 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:45:49,873 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:45:50,015 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:45:50,015 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:45:50,017 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:50 BoogieIcfgContainer [2023-08-27 03:45:50,017 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:45:50,021 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:45:50,021 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:45:50,023 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:45:50,024 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:45:48" (1/3) ... [2023-08-27 03:45:50,024 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d83015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:50, skipping insertion in model container [2023-08-27 03:45:50,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:45:49" (2/3) ... [2023-08-27 03:45:50,025 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19d83015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:45:50, skipping insertion in model container [2023-08-27 03:45:50,025 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:45:50" (3/3) ... [2023-08-27 03:45:50,027 INFO L112 eAbstractionObserver]: Analyzing ICFG mix036.oepc.i [2023-08-27 03:45:50,044 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:45:50,045 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:45:50,045 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:45:50,119 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:45:50,160 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 312 flow [2023-08-27 03:45:50,241 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-08-27 03:45:50,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:50,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 115 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 03:45:50,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 146 transitions, 312 flow [2023-08-27 03:45:50,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 142 transitions, 296 flow [2023-08-27 03:45:50,260 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:45:50,273 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 142 transitions, 296 flow [2023-08-27 03:45:50,277 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 142 transitions, 296 flow [2023-08-27 03:45:50,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 296 flow [2023-08-27 03:45:50,340 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-08-27 03:45:50,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:50,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 115 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 03:45:50,344 INFO L119 LiptonReduction]: Number of co-enabled transitions 4666 [2023-08-27 03:45:54,400 INFO L134 LiptonReduction]: Checked pairs total: 17922 [2023-08-27 03:45:54,400 INFO L136 LiptonReduction]: Total number of compositions: 120 [2023-08-27 03:45:54,412 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:45:54,418 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;@434ac007, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:45:54,418 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:45:54,421 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:45:54,421 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-27 03:45:54,421 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:45:54,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:54,422 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:45:54,422 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:45:54,426 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:54,426 INFO L85 PathProgramCache]: Analyzing trace with hash 633746, now seen corresponding path program 1 times [2023-08-27 03:45:54,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:54,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298283216] [2023-08-27 03:45:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:54,779 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:45:54,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:54,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298283216] [2023-08-27 03:45:54,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298283216] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:54,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:54,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:54,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039879232] [2023-08-27 03:45:54,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:54,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:54,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:54,818 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 266 [2023-08-27 03:45:54,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:45:54,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:54,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 266 [2023-08-27 03:45:54,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:45:57,679 INFO L124 PetriNetUnfolderBase]: 19764/28959 cut-off events. [2023-08-27 03:45:57,680 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2023-08-27 03:45:57,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55477 conditions, 28959 events. 19764/28959 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 1258. Compared 202608 event pairs, 2924 based on Foata normal form. 875/23358 useless extension candidates. Maximal degree in co-relation 55465. Up to 21989 conditions per place. [2023-08-27 03:45:57,934 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 56 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-27 03:45:57,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 65 transitions, 267 flow [2023-08-27 03:45:57,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:45:57,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:45:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-27 03:45:57,952 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.531328320802005 [2023-08-27 03:45:57,953 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-27 03:45:57,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-27 03:45:57,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:45:57,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-27 03:45:57,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 0 states have call successors, (0), 0 states 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:45:57,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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:45:57,970 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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:45:57,972 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 94 flow. Second operand 3 states and 424 transitions. [2023-08-27 03:45:57,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 65 transitions, 267 flow [2023-08-27 03:45:57,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 260 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:45:57,979 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 90 flow [2023-08-27 03:45:57,981 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-27 03:45:57,984 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -3 predicate places. [2023-08-27 03:45:57,984 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 90 flow [2023-08-27 03:45:57,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states 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:45:57,985 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:45:57,985 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:45:57,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:45:57,986 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:45:57,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:45:57,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1700534576, now seen corresponding path program 1 times [2023-08-27 03:45:57,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:45:57,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648977086] [2023-08-27 03:45:57,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:45:57,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:45:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:45:58,103 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:45:58,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:45:58,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648977086] [2023-08-27 03:45:58,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648977086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:45:58,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:45:58,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:45:58,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445218812] [2023-08-27 03:45:58,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:45:58,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:45:58,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:45:58,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:45:58,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:45:58,108 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 03:45:58,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 90 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:45:58,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:45:58,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 03:45:58,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:00,480 INFO L124 PetriNetUnfolderBase]: 19764/26222 cut-off events. [2023-08-27 03:46:00,480 INFO L125 PetriNetUnfolderBase]: For 1286/1286 co-relation queries the response was YES. [2023-08-27 03:46:00,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54025 conditions, 26222 events. 19764/26222 cut-off events. For 1286/1286 co-relation queries the response was YES. Maximal size of possible extension queue 1032. Compared 139777 event pairs, 19764 based on Foata normal form. 0/19727 useless extension candidates. Maximal degree in co-relation 54015. Up to 26200 conditions per place. [2023-08-27 03:46:00,675 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 31 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-27 03:46:00,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 35 transitions, 146 flow [2023-08-27 03:46:00,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:00,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-27 03:46:00,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2023-08-27 03:46:00,678 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-27 03:46:00,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-27 03:46:00,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:00,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-27 03:46:00,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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:46:00,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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:46:00,683 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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:46:00,683 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 90 flow. Second operand 3 states and 384 transitions. [2023-08-27 03:46:00,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 35 transitions, 146 flow [2023-08-27 03:46:00,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 35 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:00,686 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 80 flow [2023-08-27 03:46:00,686 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-27 03:46:00,689 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -7 predicate places. [2023-08-27 03:46:00,690 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 80 flow [2023-08-27 03:46:00,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:00,690 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:00,695 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:46:00,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:46:00,695 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:46:00,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:00,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1700534577, now seen corresponding path program 1 times [2023-08-27 03:46:00,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:00,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993736905] [2023-08-27 03:46:00,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:00,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:00,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:00,774 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:46:00,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:00,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993736905] [2023-08-27 03:46:00,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993736905] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:00,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:00,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:00,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710530649] [2023-08-27 03:46:00,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:00,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:00,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:00,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:00,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:00,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 03:46:00,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 80 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:00,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:00,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 03:46:00,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:02,335 INFO L124 PetriNetUnfolderBase]: 12789/17408 cut-off events. [2023-08-27 03:46:02,335 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:02,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35026 conditions, 17408 events. 12789/17408 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 96051 event pairs, 3558 based on Foata normal form. 0/13999 useless extension candidates. Maximal degree in co-relation 35020. Up to 13721 conditions per place. [2023-08-27 03:46:02,430 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 53 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-08-27 03:46:02,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 61 transitions, 254 flow [2023-08-27 03:46:02,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:02,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:02,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-27 03:46:02,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5137844611528822 [2023-08-27 03:46:02,432 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-27 03:46:02,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-27 03:46:02,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:02,433 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-27 03:46:02,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states 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:46:02,435 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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:46:02,436 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states 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:46:02,436 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 80 flow. Second operand 3 states and 410 transitions. [2023-08-27 03:46:02,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 61 transitions, 254 flow [2023-08-27 03:46:02,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 253 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:02,438 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 118 flow [2023-08-27 03:46:02,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-27 03:46:02,439 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -5 predicate places. [2023-08-27 03:46:02,439 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 118 flow [2023-08-27 03:46:02,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:02,439 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:02,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:02,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:46:02,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:02,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:02,440 INFO L85 PathProgramCache]: Analyzing trace with hash -51212970, now seen corresponding path program 1 times [2023-08-27 03:46:02,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:02,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164094127] [2023-08-27 03:46:02,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:02,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:02,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:02,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:02,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164094127] [2023-08-27 03:46:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164094127] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:02,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:02,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:02,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570569934] [2023-08-27 03:46:02,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:02,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:02,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:02,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:02,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:02,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 03:46:02,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 118 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:46:02,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:02,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 03:46:02,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:03,461 INFO L124 PetriNetUnfolderBase]: 8901/12144 cut-off events. [2023-08-27 03:46:03,461 INFO L125 PetriNetUnfolderBase]: For 997/997 co-relation queries the response was YES. [2023-08-27 03:46:03,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28730 conditions, 12144 events. 8901/12144 cut-off events. For 997/997 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 64807 event pairs, 2725 based on Foata normal form. 0/10847 useless extension candidates. Maximal degree in co-relation 28722. Up to 4716 conditions per place. [2023-08-27 03:46:03,518 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 73 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2023-08-27 03:46:03,519 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 85 transitions, 392 flow [2023-08-27 03:46:03,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:03,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:03,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 550 transitions. [2023-08-27 03:46:03,521 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169172932330827 [2023-08-27 03:46:03,521 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 550 transitions. [2023-08-27 03:46:03,521 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 550 transitions. [2023-08-27 03:46:03,521 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:03,521 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 550 transitions. [2023-08-27 03:46:03,523 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states 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:46:03,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states 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:46:03,525 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states 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:46:03,526 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 118 flow. Second operand 4 states and 550 transitions. [2023-08-27 03:46:03,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 85 transitions, 392 flow [2023-08-27 03:46:03,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 85 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:03,529 INFO L231 Difference]: Finished difference. Result has 51 places, 43 transitions, 171 flow [2023-08-27 03:46:03,529 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=51, PETRI_TRANSITIONS=43} [2023-08-27 03:46:03,530 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, -2 predicate places. [2023-08-27 03:46:03,530 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 43 transitions, 171 flow [2023-08-27 03:46:03,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states 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:46:03,531 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:03,531 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:03,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:46:03,531 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:03,531 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:03,532 INFO L85 PathProgramCache]: Analyzing trace with hash 2111939245, now seen corresponding path program 1 times [2023-08-27 03:46:03,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:03,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629439035] [2023-08-27 03:46:03,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:03,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:03,681 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:46:03,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:03,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629439035] [2023-08-27 03:46:03,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629439035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:03,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:03,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:03,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849772147] [2023-08-27 03:46:03,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:03,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:03,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:03,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:03,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:03,684 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 03:46:03,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 43 transitions, 171 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:46:03,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:03,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 03:46:03,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:05,653 INFO L124 PetriNetUnfolderBase]: 20100/26873 cut-off events. [2023-08-27 03:46:05,653 INFO L125 PetriNetUnfolderBase]: For 16825/16825 co-relation queries the response was YES. [2023-08-27 03:46:05,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66672 conditions, 26873 events. 20100/26873 cut-off events. For 16825/16825 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 134054 event pairs, 7389 based on Foata normal form. 0/24725 useless extension candidates. Maximal degree in co-relation 66662. Up to 19926 conditions per place. [2023-08-27 03:46:05,828 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 89 selfloop transitions, 11 changer transitions 0/100 dead transitions. [2023-08-27 03:46:05,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 100 transitions, 563 flow [2023-08-27 03:46:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:05,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 636 transitions. [2023-08-27 03:46:05,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781954887218045 [2023-08-27 03:46:05,831 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 636 transitions. [2023-08-27 03:46:05,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 636 transitions. [2023-08-27 03:46:05,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:05,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 636 transitions. [2023-08-27 03:46:05,834 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.2) internal successors, (636), 5 states have internal predecessors, (636), 0 states have call successors, (0), 0 states 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:46:05,836 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:05,837 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:05,837 INFO L175 Difference]: Start difference. First operand has 51 places, 43 transitions, 171 flow. Second operand 5 states and 636 transitions. [2023-08-27 03:46:05,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 100 transitions, 563 flow [2023-08-27 03:46:05,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 100 transitions, 529 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:05,870 INFO L231 Difference]: Finished difference. Result has 57 places, 53 transitions, 241 flow [2023-08-27 03:46:05,870 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=241, PETRI_PLACES=57, PETRI_TRANSITIONS=53} [2023-08-27 03:46:05,871 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 4 predicate places. [2023-08-27 03:46:05,871 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 53 transitions, 241 flow [2023-08-27 03:46:05,871 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:46:05,871 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:05,872 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:05,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:46:05,872 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:46:05,872 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:05,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1055639376, now seen corresponding path program 1 times [2023-08-27 03:46:05,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:05,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464669862] [2023-08-27 03:46:05,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:05,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:05,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:06,048 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:46:06,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:06,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464669862] [2023-08-27 03:46:06,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464669862] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:06,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:06,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:06,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899488906] [2023-08-27 03:46:06,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:06,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:06,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:06,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:06,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:06,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 266 [2023-08-27 03:46:06,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 53 transitions, 241 flow. Second operand has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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:46:06,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:06,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 266 [2023-08-27 03:46:06,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:08,148 INFO L124 PetriNetUnfolderBase]: 16506/22805 cut-off events. [2023-08-27 03:46:08,149 INFO L125 PetriNetUnfolderBase]: For 17171/17658 co-relation queries the response was YES. [2023-08-27 03:46:08,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62779 conditions, 22805 events. 16506/22805 cut-off events. For 17171/17658 co-relation queries the response was YES. Maximal size of possible extension queue 843. Compared 127007 event pairs, 3782 based on Foata normal form. 763/21766 useless extension candidates. Maximal degree in co-relation 62765. Up to 10635 conditions per place. [2023-08-27 03:46:08,310 INFO L140 encePairwiseOnDemand]: 261/266 looper letters, 105 selfloop transitions, 8 changer transitions 0/122 dead transitions. [2023-08-27 03:46:08,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 122 transitions, 761 flow [2023-08-27 03:46:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:08,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:08,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 667 transitions. [2023-08-27 03:46:08,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5015037593984962 [2023-08-27 03:46:08,313 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 667 transitions. [2023-08-27 03:46:08,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 667 transitions. [2023-08-27 03:46:08,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:08,314 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 667 transitions. [2023-08-27 03:46:08,316 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.4) internal successors, (667), 5 states have internal predecessors, (667), 0 states have call successors, (0), 0 states 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:46:08,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:08,320 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:08,320 INFO L175 Difference]: Start difference. First operand has 57 places, 53 transitions, 241 flow. Second operand 5 states and 667 transitions. [2023-08-27 03:46:08,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 122 transitions, 761 flow [2023-08-27 03:46:08,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 122 transitions, 761 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:46:08,347 INFO L231 Difference]: Finished difference. Result has 65 places, 56 transitions, 297 flow [2023-08-27 03:46:08,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=297, PETRI_PLACES=65, PETRI_TRANSITIONS=56} [2023-08-27 03:46:08,349 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 12 predicate places. [2023-08-27 03:46:08,352 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 56 transitions, 297 flow [2023-08-27 03:46:08,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.25) internal successors, (481), 4 states have internal predecessors, (481), 0 states have call successors, (0), 0 states 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:46:08,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:08,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:08,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:46:08,353 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:46:08,354 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1995931344, now seen corresponding path program 1 times [2023-08-27 03:46:08,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:08,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465360670] [2023-08-27 03:46:08,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:08,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:08,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:08,564 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:46:08,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:08,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465360670] [2023-08-27 03:46:08,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465360670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:08,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:08,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:08,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433196097] [2023-08-27 03:46:08,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:08,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:08,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:08,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:08,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:08,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-27 03:46:08,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 56 transitions, 297 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:46:08,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:08,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-27 03:46:08,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:09,860 INFO L124 PetriNetUnfolderBase]: 11049/15954 cut-off events. [2023-08-27 03:46:09,861 INFO L125 PetriNetUnfolderBase]: For 19143/19498 co-relation queries the response was YES. [2023-08-27 03:46:09,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46310 conditions, 15954 events. 11049/15954 cut-off events. For 19143/19498 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 94435 event pairs, 1855 based on Foata normal form. 725/15041 useless extension candidates. Maximal degree in co-relation 46290. Up to 9655 conditions per place. [2023-08-27 03:46:09,945 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 87 selfloop transitions, 12 changer transitions 0/105 dead transitions. [2023-08-27 03:46:09,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 105 transitions, 657 flow [2023-08-27 03:46:09,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:09,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 658 transitions. [2023-08-27 03:46:09,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49473684210526314 [2023-08-27 03:46:09,948 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 658 transitions. [2023-08-27 03:46:09,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 658 transitions. [2023-08-27 03:46:09,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:09,948 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 658 transitions. [2023-08-27 03:46:09,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.6) internal successors, (658), 5 states have internal predecessors, (658), 0 states have call successors, (0), 0 states 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:46:09,952 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:09,952 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:09,952 INFO L175 Difference]: Start difference. First operand has 65 places, 56 transitions, 297 flow. Second operand 5 states and 658 transitions. [2023-08-27 03:46:09,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 105 transitions, 657 flow [2023-08-27 03:46:10,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 105 transitions, 637 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-27 03:46:10,074 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 313 flow [2023-08-27 03:46:10,075 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=313, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2023-08-27 03:46:10,075 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 15 predicate places. [2023-08-27 03:46:10,075 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 313 flow [2023-08-27 03:46:10,076 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:46:10,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:10,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:10,076 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:46:10,076 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:46:10,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:10,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1557453970, now seen corresponding path program 1 times [2023-08-27 03:46:10,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:10,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373549387] [2023-08-27 03:46:10,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:10,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:10,298 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:46:10,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:10,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373549387] [2023-08-27 03:46:10,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373549387] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:10,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:10,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:46:10,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814045525] [2023-08-27 03:46:10,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:10,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:10,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:10,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:10,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:10,300 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-27 03:46:10,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:46:10,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:10,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-27 03:46:10,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:11,287 INFO L124 PetriNetUnfolderBase]: 7768/11574 cut-off events. [2023-08-27 03:46:11,287 INFO L125 PetriNetUnfolderBase]: For 15604/15911 co-relation queries the response was YES. [2023-08-27 03:46:11,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36292 conditions, 11574 events. 7768/11574 cut-off events. For 15604/15911 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 69122 event pairs, 1113 based on Foata normal form. 455/10923 useless extension candidates. Maximal degree in co-relation 36270. Up to 3184 conditions per place. [2023-08-27 03:46:11,360 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 103 selfloop transitions, 22 changer transitions 0/131 dead transitions. [2023-08-27 03:46:11,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 131 transitions, 814 flow [2023-08-27 03:46:11,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:46:11,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:46:11,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 920 transitions. [2023-08-27 03:46:11,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4940923737916219 [2023-08-27 03:46:11,363 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 920 transitions. [2023-08-27 03:46:11,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 920 transitions. [2023-08-27 03:46:11,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:11,363 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 920 transitions. [2023-08-27 03:46:11,365 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 131.42857142857142) internal successors, (920), 7 states have internal predecessors, (920), 0 states have call successors, (0), 0 states 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:46:11,368 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states 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:46:11,368 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states 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:46:11,368 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 313 flow. Second operand 7 states and 920 transitions. [2023-08-27 03:46:11,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 131 transitions, 814 flow [2023-08-27 03:46:11,664 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 131 transitions, 805 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:11,665 INFO L231 Difference]: Finished difference. Result has 76 places, 62 transitions, 404 flow [2023-08-27 03:46:11,665 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=404, PETRI_PLACES=76, PETRI_TRANSITIONS=62} [2023-08-27 03:46:11,666 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2023-08-27 03:46:11,666 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 62 transitions, 404 flow [2023-08-27 03:46:11,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states 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:46:11,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:11,667 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:46:11,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:46:11,667 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:46:11,667 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:11,667 INFO L85 PathProgramCache]: Analyzing trace with hash 8523468, now seen corresponding path program 1 times [2023-08-27 03:46:11,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:11,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479368692] [2023-08-27 03:46:11,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:11,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:11,735 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:46:11,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:11,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479368692] [2023-08-27 03:46:11,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479368692] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:11,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:11,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:11,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846449803] [2023-08-27 03:46:11,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:11,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:11,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:11,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:11,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:11,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 03:46:11,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 62 transitions, 404 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:46:11,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:11,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 03:46:11,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:12,686 INFO L124 PetriNetUnfolderBase]: 6719/9909 cut-off events. [2023-08-27 03:46:12,686 INFO L125 PetriNetUnfolderBase]: For 20537/20844 co-relation queries the response was YES. [2023-08-27 03:46:12,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35136 conditions, 9909 events. 6719/9909 cut-off events. For 20537/20844 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 56909 event pairs, 1810 based on Foata normal form. 0/9394 useless extension candidates. Maximal degree in co-relation 35110. Up to 3639 conditions per place. [2023-08-27 03:46:12,754 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 90 selfloop transitions, 21 changer transitions 0/117 dead transitions. [2023-08-27 03:46:12,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 117 transitions, 838 flow [2023-08-27 03:46:12,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 680 transitions. [2023-08-27 03:46:12,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5112781954887218 [2023-08-27 03:46:12,756 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 680 transitions. [2023-08-27 03:46:12,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 680 transitions. [2023-08-27 03:46:12,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:12,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 680 transitions. [2023-08-27 03:46:12,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 136.0) internal successors, (680), 5 states have internal predecessors, (680), 0 states have call successors, (0), 0 states 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:46:12,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:12,760 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:12,760 INFO L175 Difference]: Start difference. First operand has 76 places, 62 transitions, 404 flow. Second operand 5 states and 680 transitions. [2023-08-27 03:46:12,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 117 transitions, 838 flow [2023-08-27 03:46:13,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 117 transitions, 799 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 03:46:13,037 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 460 flow [2023-08-27 03:46:13,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=460, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2023-08-27 03:46:13,037 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-27 03:46:13,038 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 460 flow [2023-08-27 03:46:13,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states 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:46:13,038 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:13,038 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] [2023-08-27 03:46:13,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:46:13,038 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:46:13,039 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:13,039 INFO L85 PathProgramCache]: Analyzing trace with hash 920187872, now seen corresponding path program 1 times [2023-08-27 03:46:13,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:13,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133936093] [2023-08-27 03:46:13,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:13,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:13,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:13,653 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:46:13,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:13,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133936093] [2023-08-27 03:46:13,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133936093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:13,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:13,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:46:13,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174399118] [2023-08-27 03:46:13,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:13,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:46:13,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:13,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:46:13,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:46:13,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 266 [2023-08-27 03:46:13,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 460 flow. Second operand has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states 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:46:13,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:13,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 266 [2023-08-27 03:46:13,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:15,775 INFO L124 PetriNetUnfolderBase]: 12937/19789 cut-off events. [2023-08-27 03:46:15,775 INFO L125 PetriNetUnfolderBase]: For 53950/54291 co-relation queries the response was YES. [2023-08-27 03:46:15,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74878 conditions, 19789 events. 12937/19789 cut-off events. For 53950/54291 co-relation queries the response was YES. Maximal size of possible extension queue 851. Compared 134103 event pairs, 1618 based on Foata normal form. 67/19074 useless extension candidates. Maximal degree in co-relation 74851. Up to 8108 conditions per place. [2023-08-27 03:46:16,038 INFO L140 encePairwiseOnDemand]: 255/266 looper letters, 319 selfloop transitions, 36 changer transitions 20/381 dead transitions. [2023-08-27 03:46:16,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 381 transitions, 3393 flow [2023-08-27 03:46:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-27 03:46:16,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-27 03:46:16,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1663 transitions. [2023-08-27 03:46:16,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809138230190862 [2023-08-27 03:46:16,042 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1663 transitions. [2023-08-27 03:46:16,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1663 transitions. [2023-08-27 03:46:16,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:16,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1663 transitions. [2023-08-27 03:46:16,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 127.92307692307692) internal successors, (1663), 13 states have internal predecessors, (1663), 0 states have call successors, (0), 0 states 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:46:16,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 266.0) internal successors, (3724), 14 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states 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:46:16,052 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 266.0) internal successors, (3724), 14 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states 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:46:16,052 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 460 flow. Second operand 13 states and 1663 transitions. [2023-08-27 03:46:16,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 381 transitions, 3393 flow [2023-08-27 03:46:17,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 381 transitions, 3049 flow, removed 84 selfloop flow, removed 3 redundant places. [2023-08-27 03:46:17,075 INFO L231 Difference]: Finished difference. Result has 94 places, 100 transitions, 728 flow [2023-08-27 03:46:17,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=728, PETRI_PLACES=94, PETRI_TRANSITIONS=100} [2023-08-27 03:46:17,076 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 41 predicate places. [2023-08-27 03:46:17,076 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 100 transitions, 728 flow [2023-08-27 03:46:17,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.85714285714286) internal successors, (797), 7 states have internal predecessors, (797), 0 states have call successors, (0), 0 states 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:46:17,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:17,077 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] [2023-08-27 03:46:17,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:46:17,077 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:46:17,077 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:17,077 INFO L85 PathProgramCache]: Analyzing trace with hash -750350162, now seen corresponding path program 2 times [2023-08-27 03:46:17,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:17,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896403759] [2023-08-27 03:46:17,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:17,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:17,288 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:46:17,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:17,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896403759] [2023-08-27 03:46:17,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896403759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:17,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:17,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:46:17,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437909197] [2023-08-27 03:46:17,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:17,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:46:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:17,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:46:17,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:46:17,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-27 03:46:17,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 100 transitions, 728 flow. Second operand has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:17,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:17,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-27 03:46:17,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:19,037 INFO L124 PetriNetUnfolderBase]: 11634/17288 cut-off events. [2023-08-27 03:46:19,038 INFO L125 PetriNetUnfolderBase]: For 67356/67907 co-relation queries the response was YES. [2023-08-27 03:46:19,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76952 conditions, 17288 events. 11634/17288 cut-off events. For 67356/67907 co-relation queries the response was YES. Maximal size of possible extension queue 891. Compared 112921 event pairs, 657 based on Foata normal form. 351/16765 useless extension candidates. Maximal degree in co-relation 76917. Up to 5187 conditions per place. [2023-08-27 03:46:19,179 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 203 selfloop transitions, 32 changer transitions 4/245 dead transitions. [2023-08-27 03:46:19,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 245 transitions, 2050 flow [2023-08-27 03:46:19,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:46:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:46:19,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1180 transitions. [2023-08-27 03:46:19,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4928989139515455 [2023-08-27 03:46:19,183 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1180 transitions. [2023-08-27 03:46:19,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1180 transitions. [2023-08-27 03:46:19,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:19,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1180 transitions. [2023-08-27 03:46:19,186 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 131.11111111111111) internal successors, (1180), 9 states have internal predecessors, (1180), 0 states have call successors, (0), 0 states 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:46:19,189 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states 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:46:19,190 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 266.0) internal successors, (2660), 10 states have internal predecessors, (2660), 0 states have call successors, (0), 0 states 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:46:19,190 INFO L175 Difference]: Start difference. First operand has 94 places, 100 transitions, 728 flow. Second operand 9 states and 1180 transitions. [2023-08-27 03:46:19,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 245 transitions, 2050 flow [2023-08-27 03:46:21,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 245 transitions, 2042 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:21,562 INFO L231 Difference]: Finished difference. Result has 103 places, 92 transitions, 756 flow [2023-08-27 03:46:21,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=756, PETRI_PLACES=103, PETRI_TRANSITIONS=92} [2023-08-27 03:46:21,563 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 50 predicate places. [2023-08-27 03:46:21,563 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 92 transitions, 756 flow [2023-08-27 03:46:21,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.33333333333333) internal successors, (704), 6 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:21,563 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:21,563 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:46:21,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:46:21,563 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:21,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:21,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1448642369, now seen corresponding path program 1 times [2023-08-27 03:46:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327997263] [2023-08-27 03:46:21,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:21,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:21,658 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:46:21,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:21,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327997263] [2023-08-27 03:46:21,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327997263] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:21,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:21,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:46:21,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569779680] [2023-08-27 03:46:21,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:21,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:46:21,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:21,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:46:21,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:46:21,660 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 03:46:21,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 92 transitions, 756 flow. Second operand has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:46:21,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:21,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 03:46:21,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:23,336 INFO L124 PetriNetUnfolderBase]: 11207/16649 cut-off events. [2023-08-27 03:46:23,336 INFO L125 PetriNetUnfolderBase]: For 73813/74423 co-relation queries the response was YES. [2023-08-27 03:46:23,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81729 conditions, 16649 events. 11207/16649 cut-off events. For 73813/74423 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 107770 event pairs, 2149 based on Foata normal form. 17/15932 useless extension candidates. Maximal degree in co-relation 81690. Up to 6796 conditions per place. [2023-08-27 03:46:23,460 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 115 selfloop transitions, 28 changer transitions 19/168 dead transitions. [2023-08-27 03:46:23,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 168 transitions, 1564 flow [2023-08-27 03:46:23,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:46:23,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:46:23,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 794 transitions. [2023-08-27 03:46:23,462 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4974937343358396 [2023-08-27 03:46:23,462 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 794 transitions. [2023-08-27 03:46:23,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 794 transitions. [2023-08-27 03:46:23,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:23,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 794 transitions. [2023-08-27 03:46:23,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.33333333333334) internal successors, (794), 6 states have internal predecessors, (794), 0 states have call successors, (0), 0 states 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:46:23,467 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states 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:46:23,467 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states 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:46:23,467 INFO L175 Difference]: Start difference. First operand has 103 places, 92 transitions, 756 flow. Second operand 6 states and 794 transitions. [2023-08-27 03:46:23,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 168 transitions, 1564 flow [2023-08-27 03:46:25,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 168 transitions, 1503 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 03:46:25,722 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 658 flow [2023-08-27 03:46:25,723 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=658, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2023-08-27 03:46:25,723 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 45 predicate places. [2023-08-27 03:46:25,723 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 658 flow [2023-08-27 03:46:25,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.66666666666667) internal successors, (718), 6 states have internal predecessors, (718), 0 states have call successors, (0), 0 states 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:46:25,724 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:25,724 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:46:25,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:46:25,724 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:46:25,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:25,725 INFO L85 PathProgramCache]: Analyzing trace with hash 737113337, now seen corresponding path program 1 times [2023-08-27 03:46:25,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:25,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830305055] [2023-08-27 03:46:25,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:25,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:25,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:26,441 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:46:26,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:26,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830305055] [2023-08-27 03:46:26,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830305055] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:26,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:26,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:46:26,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75408026] [2023-08-27 03:46:26,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:26,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:46:26,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:26,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:46:26,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:46:26,444 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 266 [2023-08-27 03:46:26,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 80 transitions, 658 flow. Second operand has 8 states, 8 states have (on average 111.875) internal successors, (895), 8 states have internal predecessors, (895), 0 states have call successors, (0), 0 states 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:46:26,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:26,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 266 [2023-08-27 03:46:26,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:28,838 INFO L124 PetriNetUnfolderBase]: 13015/20104 cut-off events. [2023-08-27 03:46:28,838 INFO L125 PetriNetUnfolderBase]: For 98051/98854 co-relation queries the response was YES. [2023-08-27 03:46:28,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97282 conditions, 20104 events. 13015/20104 cut-off events. For 98051/98854 co-relation queries the response was YES. Maximal size of possible extension queue 971. Compared 140999 event pairs, 1259 based on Foata normal form. 346/19803 useless extension candidates. Maximal degree in co-relation 97243. Up to 6152 conditions per place. [2023-08-27 03:46:29,003 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 246 selfloop transitions, 18 changer transitions 45/315 dead transitions. [2023-08-27 03:46:29,003 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 315 transitions, 3353 flow [2023-08-27 03:46:29,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 03:46:29,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 03:46:29,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1339 transitions. [2023-08-27 03:46:29,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45762132604237865 [2023-08-27 03:46:29,007 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1339 transitions. [2023-08-27 03:46:29,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1339 transitions. [2023-08-27 03:46:29,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:29,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1339 transitions. [2023-08-27 03:46:29,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 121.72727272727273) internal successors, (1339), 11 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states 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:46:29,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states 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:46:29,016 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 266.0) internal successors, (3192), 12 states have internal predecessors, (3192), 0 states have call successors, (0), 0 states 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:46:29,016 INFO L175 Difference]: Start difference. First operand has 98 places, 80 transitions, 658 flow. Second operand 11 states and 1339 transitions. [2023-08-27 03:46:29,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 315 transitions, 3353 flow [2023-08-27 03:46:31,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 315 transitions, 2659 flow, removed 103 selfloop flow, removed 14 redundant places. [2023-08-27 03:46:31,249 INFO L231 Difference]: Finished difference. Result has 96 places, 84 transitions, 673 flow [2023-08-27 03:46:31,249 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=673, PETRI_PLACES=96, PETRI_TRANSITIONS=84} [2023-08-27 03:46:31,249 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 43 predicate places. [2023-08-27 03:46:31,250 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 84 transitions, 673 flow [2023-08-27 03:46:31,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.875) internal successors, (895), 8 states have internal predecessors, (895), 0 states have call successors, (0), 0 states 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:46:31,250 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:31,250 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:46:31,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:46:31,250 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:46:31,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1718150373, now seen corresponding path program 1 times [2023-08-27 03:46:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:31,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126676589] [2023-08-27 03:46:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:31,474 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:46:31,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:31,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126676589] [2023-08-27 03:46:31,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126676589] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:31,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:31,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:46:31,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829549323] [2023-08-27 03:46:31,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:31,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:46:31,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:31,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:46:31,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:46:31,477 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-27 03:46:31,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 84 transitions, 673 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:46:31,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:31,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-27 03:46:31,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:35,066 INFO L124 PetriNetUnfolderBase]: 25908/37728 cut-off events. [2023-08-27 03:46:35,067 INFO L125 PetriNetUnfolderBase]: For 131136/131136 co-relation queries the response was YES. [2023-08-27 03:46:35,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168745 conditions, 37728 events. 25908/37728 cut-off events. For 131136/131136 co-relation queries the response was YES. Maximal size of possible extension queue 1511. Compared 250816 event pairs, 2837 based on Foata normal form. 18/36910 useless extension candidates. Maximal degree in co-relation 168711. Up to 19873 conditions per place. [2023-08-27 03:46:35,282 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 97 selfloop transitions, 10 changer transitions 140/247 dead transitions. [2023-08-27 03:46:35,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 247 transitions, 2424 flow [2023-08-27 03:46:35,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:46:35,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:46:35,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 983 transitions. [2023-08-27 03:46:35,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4619360902255639 [2023-08-27 03:46:35,285 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 983 transitions. [2023-08-27 03:46:35,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 983 transitions. [2023-08-27 03:46:35,285 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:35,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 983 transitions. [2023-08-27 03:46:35,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.875) internal successors, (983), 8 states have internal predecessors, (983), 0 states have call successors, (0), 0 states 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:46:35,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:35,290 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:35,290 INFO L175 Difference]: Start difference. First operand has 96 places, 84 transitions, 673 flow. Second operand 8 states and 983 transitions. [2023-08-27 03:46:35,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 247 transitions, 2424 flow [2023-08-27 03:46:38,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 247 transitions, 2309 flow, removed 38 selfloop flow, removed 5 redundant places. [2023-08-27 03:46:38,786 INFO L231 Difference]: Finished difference. Result has 97 places, 63 transitions, 464 flow [2023-08-27 03:46:38,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=464, PETRI_PLACES=97, PETRI_TRANSITIONS=63} [2023-08-27 03:46:38,787 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 44 predicate places. [2023-08-27 03:46:38,787 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 63 transitions, 464 flow [2023-08-27 03:46:38,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:46:38,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:38,788 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:46:38,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:46:38,788 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:46:38,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:38,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1774819441, now seen corresponding path program 2 times [2023-08-27 03:46:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:38,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699514803] [2023-08-27 03:46:38,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:38,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:38,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:39,587 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:46:39,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:39,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699514803] [2023-08-27 03:46:39,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699514803] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:39,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:39,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:46:39,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967775392] [2023-08-27 03:46:39,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:39,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:46:39,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:39,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:46:39,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:46:39,591 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 03:46:39,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 63 transitions, 464 flow. Second operand has 8 states, 8 states have (on average 112.875) internal successors, (903), 8 states have internal predecessors, (903), 0 states have call successors, (0), 0 states 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:46:39,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:39,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 03:46:39,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:41,075 INFO L124 PetriNetUnfolderBase]: 4960/8164 cut-off events. [2023-08-27 03:46:41,075 INFO L125 PetriNetUnfolderBase]: For 26886/27569 co-relation queries the response was YES. [2023-08-27 03:46:41,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34387 conditions, 8164 events. 4960/8164 cut-off events. For 26886/27569 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 54587 event pairs, 944 based on Foata normal form. 388/8433 useless extension candidates. Maximal degree in co-relation 34352. Up to 2837 conditions per place. [2023-08-27 03:46:41,135 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 118 selfloop transitions, 17 changer transitions 36/180 dead transitions. [2023-08-27 03:46:41,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 180 transitions, 1558 flow [2023-08-27 03:46:41,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:46:41,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:46:41,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 977 transitions. [2023-08-27 03:46:41,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4591165413533835 [2023-08-27 03:46:41,138 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 977 transitions. [2023-08-27 03:46:41,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 977 transitions. [2023-08-27 03:46:41,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:41,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 977 transitions. [2023-08-27 03:46:41,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 122.125) internal successors, (977), 8 states have internal predecessors, (977), 0 states have call successors, (0), 0 states 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:46:41,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:41,142 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:41,142 INFO L175 Difference]: Start difference. First operand has 97 places, 63 transitions, 464 flow. Second operand 8 states and 977 transitions. [2023-08-27 03:46:41,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 180 transitions, 1558 flow [2023-08-27 03:46:41,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 180 transitions, 1349 flow, removed 84 selfloop flow, removed 14 redundant places. [2023-08-27 03:46:41,401 INFO L231 Difference]: Finished difference. Result has 76 places, 73 transitions, 536 flow [2023-08-27 03:46:41,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=536, PETRI_PLACES=76, PETRI_TRANSITIONS=73} [2023-08-27 03:46:41,402 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 23 predicate places. [2023-08-27 03:46:41,402 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 73 transitions, 536 flow [2023-08-27 03:46:41,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 112.875) internal successors, (903), 8 states have internal predecessors, (903), 0 states have call successors, (0), 0 states 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:46:41,403 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:41,403 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:46:41,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:46:41,403 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:46:41,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:41,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1647132669, now seen corresponding path program 2 times [2023-08-27 03:46:41,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:41,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801564951] [2023-08-27 03:46:41,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:41,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:41,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:41,585 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:46:41,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:41,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801564951] [2023-08-27 03:46:41,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801564951] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:41,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:41,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:46:41,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110331262] [2023-08-27 03:46:41,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:41,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:46:41,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:41,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:46:41,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:46:41,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-27 03:46:41,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 73 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:46:41,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:41,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-27 03:46:41,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:42,882 INFO L124 PetriNetUnfolderBase]: 8808/13532 cut-off events. [2023-08-27 03:46:42,882 INFO L125 PetriNetUnfolderBase]: For 44471/44471 co-relation queries the response was YES. [2023-08-27 03:46:42,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58657 conditions, 13532 events. 8808/13532 cut-off events. For 44471/44471 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 85601 event pairs, 1195 based on Foata normal form. 19/13551 useless extension candidates. Maximal degree in co-relation 58630. Up to 6203 conditions per place. [2023-08-27 03:46:42,996 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 117 selfloop transitions, 10 changer transitions 78/205 dead transitions. [2023-08-27 03:46:42,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 205 transitions, 1876 flow [2023-08-27 03:46:42,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:46:42,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:46:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-08-27 03:46:42,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46455424274973145 [2023-08-27 03:46:42,999 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-08-27 03:46:42,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-08-27 03:46:42,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:42,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-08-27 03:46:43,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states 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:46:43,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states 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:46:43,003 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states 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:46:43,003 INFO L175 Difference]: Start difference. First operand has 76 places, 73 transitions, 536 flow. Second operand 7 states and 865 transitions. [2023-08-27 03:46:43,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 205 transitions, 1876 flow [2023-08-27 03:46:43,284 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 205 transitions, 1839 flow, removed 18 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:43,285 INFO L231 Difference]: Finished difference. Result has 82 places, 73 transitions, 543 flow [2023-08-27 03:46:43,285 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=543, PETRI_PLACES=82, PETRI_TRANSITIONS=73} [2023-08-27 03:46:43,286 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2023-08-27 03:46:43,286 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 73 transitions, 543 flow [2023-08-27 03:46:43,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.16666666666667) internal successors, (673), 6 states have internal predecessors, (673), 0 states have call successors, (0), 0 states 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:46:43,286 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:43,286 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:46:43,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:46:43,287 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:46:43,287 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:43,287 INFO L85 PathProgramCache]: Analyzing trace with hash -611369705, now seen corresponding path program 3 times [2023-08-27 03:46:43,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:43,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804558571] [2023-08-27 03:46:43,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:43,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:43,499 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:46:43,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:43,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804558571] [2023-08-27 03:46:43,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804558571] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:43,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:43,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:46:43,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302450796] [2023-08-27 03:46:43,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:43,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:46:43,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:43,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:46:43,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:46:43,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 266 [2023-08-27 03:46:43,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 73 transitions, 543 flow. Second operand has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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:46:43,503 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:43,503 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 266 [2023-08-27 03:46:43,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:44,493 INFO L124 PetriNetUnfolderBase]: 5917/9530 cut-off events. [2023-08-27 03:46:44,494 INFO L125 PetriNetUnfolderBase]: For 38388/38779 co-relation queries the response was YES. [2023-08-27 03:46:44,533 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42057 conditions, 9530 events. 5917/9530 cut-off events. For 38388/38779 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 65727 event pairs, 860 based on Foata normal form. 202/9474 useless extension candidates. Maximal degree in co-relation 42030. Up to 3743 conditions per place. [2023-08-27 03:46:44,547 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 99 selfloop transitions, 17 changer transitions 45/166 dead transitions. [2023-08-27 03:46:44,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 166 transitions, 1510 flow [2023-08-27 03:46:44,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:46:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:46:44,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1009 transitions. [2023-08-27 03:46:44,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4741541353383459 [2023-08-27 03:46:44,550 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1009 transitions. [2023-08-27 03:46:44,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1009 transitions. [2023-08-27 03:46:44,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:44,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1009 transitions. [2023-08-27 03:46:44,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.125) internal successors, (1009), 8 states have internal predecessors, (1009), 0 states have call successors, (0), 0 states 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:46:44,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:44,553 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:44,553 INFO L175 Difference]: Start difference. First operand has 82 places, 73 transitions, 543 flow. Second operand 8 states and 1009 transitions. [2023-08-27 03:46:44,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 166 transitions, 1510 flow [2023-08-27 03:46:44,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 166 transitions, 1491 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-27 03:46:44,906 INFO L231 Difference]: Finished difference. Result has 86 places, 57 transitions, 426 flow [2023-08-27 03:46:44,906 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=479, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=426, PETRI_PLACES=86, PETRI_TRANSITIONS=57} [2023-08-27 03:46:44,907 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 33 predicate places. [2023-08-27 03:46:44,907 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 57 transitions, 426 flow [2023-08-27 03:46:44,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.28571428571429) internal successors, (821), 7 states have internal predecessors, (821), 0 states have call successors, (0), 0 states 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:46:44,907 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:44,907 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, 1] [2023-08-27 03:46:44,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:46:44,908 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:46:44,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:44,908 INFO L85 PathProgramCache]: Analyzing trace with hash -625806244, now seen corresponding path program 1 times [2023-08-27 03:46:44,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:44,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998141595] [2023-08-27 03:46:44,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:44,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:44,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:45,073 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:46:45,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:45,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998141595] [2023-08-27 03:46:45,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998141595] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:45,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:45,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:46:45,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10131846] [2023-08-27 03:46:45,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:45,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:45,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:45,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:45,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:45,075 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-27 03:46:45,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 57 transitions, 426 flow. Second operand has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states 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:46:45,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:45,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-27 03:46:45,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:45,573 INFO L124 PetriNetUnfolderBase]: 2659/4210 cut-off events. [2023-08-27 03:46:45,573 INFO L125 PetriNetUnfolderBase]: For 17256/17261 co-relation queries the response was YES. [2023-08-27 03:46:45,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19276 conditions, 4210 events. 2659/4210 cut-off events. For 17256/17261 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 23162 event pairs, 583 based on Foata normal form. 1/4194 useless extension candidates. Maximal degree in co-relation 19244. Up to 1950 conditions per place. [2023-08-27 03:46:45,591 INFO L140 encePairwiseOnDemand]: 262/266 looper letters, 59 selfloop transitions, 1 changer transitions 63/125 dead transitions. [2023-08-27 03:46:45,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 125 transitions, 1203 flow [2023-08-27 03:46:45,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2023-08-27 03:46:45,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766917293233083 [2023-08-27 03:46:45,593 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2023-08-27 03:46:45,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2023-08-27 03:46:45,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:45,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2023-08-27 03:46:45,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states 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:46:45,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:45,595 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states 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:46:45,595 INFO L175 Difference]: Start difference. First operand has 86 places, 57 transitions, 426 flow. Second operand 5 states and 634 transitions. [2023-08-27 03:46:45,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 125 transitions, 1203 flow [2023-08-27 03:46:45,642 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 125 transitions, 1014 flow, removed 43 selfloop flow, removed 13 redundant places. [2023-08-27 03:46:45,643 INFO L231 Difference]: Finished difference. Result has 74 places, 52 transitions, 314 flow [2023-08-27 03:46:45,643 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=314, PETRI_PLACES=74, PETRI_TRANSITIONS=52} [2023-08-27 03:46:45,643 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2023-08-27 03:46:45,644 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 52 transitions, 314 flow [2023-08-27 03:46:45,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.4) internal successors, (602), 5 states have internal predecessors, (602), 0 states have call successors, (0), 0 states 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:46:45,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:45,644 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, 1] [2023-08-27 03:46:45,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:46:45,644 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:45,644 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:45,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1255258732, now seen corresponding path program 2 times [2023-08-27 03:46:45,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:45,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664881476] [2023-08-27 03:46:45,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:45,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:45,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:46,599 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:46:46,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:46,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664881476] [2023-08-27 03:46:46,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664881476] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:46,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:46,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:46:46,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906992857] [2023-08-27 03:46:46,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:46,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 03:46:46,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:46,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 03:46:46,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-27 03:46:46,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 266 [2023-08-27 03:46:46,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 52 transitions, 314 flow. Second operand has 9 states, 9 states have (on average 105.22222222222223) internal successors, (947), 9 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:46:46,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:46,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 266 [2023-08-27 03:46:46,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:47,047 INFO L124 PetriNetUnfolderBase]: 1427/2283 cut-off events. [2023-08-27 03:46:47,047 INFO L125 PetriNetUnfolderBase]: For 6060/6060 co-relation queries the response was YES. [2023-08-27 03:46:47,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9072 conditions, 2283 events. 1427/2283 cut-off events. For 6060/6060 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 11011 event pairs, 239 based on Foata normal form. 1/2284 useless extension candidates. Maximal degree in co-relation 9048. Up to 1315 conditions per place. [2023-08-27 03:46:47,055 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 63 selfloop transitions, 6 changer transitions 51/120 dead transitions. [2023-08-27 03:46:47,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 120 transitions, 882 flow [2023-08-27 03:46:47,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:46:47,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:46:47,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 900 transitions. [2023-08-27 03:46:47,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42293233082706766 [2023-08-27 03:46:47,056 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 900 transitions. [2023-08-27 03:46:47,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 900 transitions. [2023-08-27 03:46:47,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:47,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 900 transitions. [2023-08-27 03:46:47,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 112.5) internal successors, (900), 8 states have internal predecessors, (900), 0 states have call successors, (0), 0 states 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:46:47,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:47,059 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:47,059 INFO L175 Difference]: Start difference. First operand has 74 places, 52 transitions, 314 flow. Second operand 8 states and 900 transitions. [2023-08-27 03:46:47,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 120 transitions, 882 flow [2023-08-27 03:46:47,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 120 transitions, 862 flow, removed 5 selfloop flow, removed 5 redundant places. [2023-08-27 03:46:47,078 INFO L231 Difference]: Finished difference. Result has 77 places, 49 transitions, 296 flow [2023-08-27 03:46:47,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=296, PETRI_PLACES=77, PETRI_TRANSITIONS=49} [2023-08-27 03:46:47,079 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-27 03:46:47,079 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 49 transitions, 296 flow [2023-08-27 03:46:47,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 105.22222222222223) internal successors, (947), 9 states have internal predecessors, (947), 0 states have call successors, (0), 0 states 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:46:47,079 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:47,079 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, 1] [2023-08-27 03:46:47,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 03:46:47,079 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:47,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:47,080 INFO L85 PathProgramCache]: Analyzing trace with hash -186543220, now seen corresponding path program 3 times [2023-08-27 03:46:47,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:47,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668643386] [2023-08-27 03:46:47,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:47,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:47,837 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:46:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668643386] [2023-08-27 03:46:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668643386] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:47,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:47,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:46:47,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042513721] [2023-08-27 03:46:47,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:47,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 03:46:47,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:47,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 03:46:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-08-27 03:46:47,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-27 03:46:47,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 49 transitions, 296 flow. Second operand has 9 states, 9 states have (on average 110.88888888888889) internal successors, (998), 9 states have internal predecessors, (998), 0 states have call successors, (0), 0 states 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:46:47,840 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:47,840 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-27 03:46:47,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:48,164 INFO L124 PetriNetUnfolderBase]: 909/1500 cut-off events. [2023-08-27 03:46:48,164 INFO L125 PetriNetUnfolderBase]: For 3694/3700 co-relation queries the response was YES. [2023-08-27 03:46:48,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6069 conditions, 1500 events. 909/1500 cut-off events. For 3694/3700 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 6829 event pairs, 150 based on Foata normal form. 1/1480 useless extension candidates. Maximal degree in co-relation 6045. Up to 707 conditions per place. [2023-08-27 03:46:48,170 INFO L140 encePairwiseOnDemand]: 258/266 looper letters, 67 selfloop transitions, 6 changer transitions 36/112 dead transitions. [2023-08-27 03:46:48,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 112 transitions, 858 flow [2023-08-27 03:46:48,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:46:48,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:46:48,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 932 transitions. [2023-08-27 03:46:48,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43796992481203006 [2023-08-27 03:46:48,172 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 932 transitions. [2023-08-27 03:46:48,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 932 transitions. [2023-08-27 03:46:48,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:48,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 932 transitions. [2023-08-27 03:46:48,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 116.5) internal successors, (932), 8 states have internal predecessors, (932), 0 states have call successors, (0), 0 states 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:46:48,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:48,175 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states 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:46:48,175 INFO L175 Difference]: Start difference. First operand has 77 places, 49 transitions, 296 flow. Second operand 8 states and 932 transitions. [2023-08-27 03:46:48,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 112 transitions, 858 flow [2023-08-27 03:46:48,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 112 transitions, 812 flow, removed 17 selfloop flow, removed 8 redundant places. [2023-08-27 03:46:48,187 INFO L231 Difference]: Finished difference. Result has 77 places, 52 transitions, 328 flow [2023-08-27 03:46:48,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=328, PETRI_PLACES=77, PETRI_TRANSITIONS=52} [2023-08-27 03:46:48,188 INFO L281 CegarLoopForPetriNet]: 53 programPoint places, 24 predicate places. [2023-08-27 03:46:48,188 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 52 transitions, 328 flow [2023-08-27 03:46:48,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.88888888888889) internal successors, (998), 9 states have internal predecessors, (998), 0 states have call successors, (0), 0 states 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:46:48,188 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:48,188 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, 1] [2023-08-27 03:46:48,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 03:46:48,188 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:48,189 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:48,189 INFO L85 PathProgramCache]: Analyzing trace with hash 981186806, now seen corresponding path program 4 times [2023-08-27 03:46:48,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:48,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997808188] [2023-08-27 03:46:48,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:48,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:46:48,242 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:46:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:46:48,314 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:46:48,314 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:46:48,315 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:46:48,316 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 03:46:48,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:46:48,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 03:46:48,317 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:46:48,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 03:46:48,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:46:48,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 03:46:48,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:46:48,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:46:48,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:46:48,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:46:48,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:46:48,318 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:46:48,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 03:46:48,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:46:48,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 03:46:48,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:46:48,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 03:46:48,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:46:48,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 03:46:48,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:46:48,319 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:46:48,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-27 03:46:48,320 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:48,325 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:46:48,325 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:46:48,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:46:48 BasicIcfg [2023-08-27 03:46:48,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:46:48,409 INFO L158 Benchmark]: Toolchain (without parser) took 59877.53ms. Allocated memory was 388.0MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 362.8MB in the beginning and 4.1GB in the end (delta: -3.8GB). Peak memory consumption was 1.3GB. Max. memory is 16.0GB. [2023-08-27 03:46:48,410 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 388.0MB. Free memory was 365.4MB in the beginning and 365.3MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:46:48,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 593.29ms. Allocated memory is still 388.0MB. Free memory was 362.2MB in the beginning and 338.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:46:48,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.10ms. Allocated memory is still 388.0MB. Free memory was 338.5MB in the beginning and 334.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:46:48,410 INFO L158 Benchmark]: Boogie Preprocessor took 29.13ms. Allocated memory is still 388.0MB. Free memory was 334.9MB in the beginning and 332.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:46:48,410 INFO L158 Benchmark]: RCFGBuilder took 791.47ms. Allocated memory is still 388.0MB. Free memory was 332.9MB in the beginning and 290.3MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. [2023-08-27 03:46:48,411 INFO L158 Benchmark]: TraceAbstraction took 58388.42ms. Allocated memory was 388.0MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 289.5MB in the beginning and 4.1GB in the end (delta: -3.8GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2023-08-27 03:46:48,412 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.14ms. Allocated memory is still 388.0MB. Free memory was 365.4MB in the beginning and 365.3MB in the end (delta: 82.6kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 593.29ms. Allocated memory is still 388.0MB. Free memory was 362.2MB in the beginning and 338.5MB in the end (delta: 23.7MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 67.10ms. Allocated memory is still 388.0MB. Free memory was 338.5MB in the beginning and 334.9MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 29.13ms. Allocated memory is still 388.0MB. Free memory was 334.9MB in the beginning and 332.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 791.47ms. Allocated memory is still 388.0MB. Free memory was 332.9MB in the beginning and 290.3MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.0GB. * TraceAbstraction took 58388.42ms. Allocated memory was 388.0MB in the beginning and 5.5GB in the end (delta: 5.1GB). Free memory was 289.5MB in the beginning and 4.1GB in the end (delta: -3.8GB). Peak memory consumption was 1.2GB. 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.1s, 152 PlacesBefore, 53 PlacesAfterwards, 142 TransitionsBefore, 41 TransitionsAfterwards, 4666 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 56 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 120 TotalNumberOfCompositions, 17922 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6272, independent: 5890, independent conditional: 0, independent unconditional: 5890, dependent: 382, dependent conditional: 0, dependent unconditional: 382, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2507, independent: 2445, independent conditional: 0, independent unconditional: 2445, dependent: 62, dependent conditional: 0, dependent unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6272, independent: 3445, independent conditional: 0, independent unconditional: 3445, dependent: 320, dependent conditional: 0, dependent unconditional: 320, unknown: 2507, unknown conditional: 0, unknown unconditional: 2507] , Statistics on independence cache: Total cache size (in pairs): 303, Positive cache size: 277, Positive conditional cache size: 0, Positive unconditional cache size: 277, 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_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L724] 0 int b = 0; [L725] 0 _Bool b$flush_delayed; [L726] 0 int b$mem_tmp; [L727] 0 _Bool b$r_buff0_thd0; [L728] 0 _Bool b$r_buff0_thd1; [L729] 0 _Bool b$r_buff0_thd2; [L730] 0 _Bool b$r_buff0_thd3; [L731] 0 _Bool b$r_buff0_thd4; [L732] 0 _Bool b$r_buff1_thd0; [L733] 0 _Bool b$r_buff1_thd1; [L734] 0 _Bool b$r_buff1_thd2; [L735] 0 _Bool b$r_buff1_thd3; [L736] 0 _Bool b$r_buff1_thd4; [L737] 0 _Bool b$read_delayed; [L738] 0 int *b$read_delayed_var; [L739] 0 int b$w_buff0; [L740] 0 _Bool b$w_buff0_used; [L741] 0 int b$w_buff1; [L742] 0 _Bool b$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t937; [L874] FCALL, FORK 0 pthread_create(&t937, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, 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(&t937, ((void *)0), P0, ((void *)0))=-2, t937={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t938; [L876] FCALL, FORK 0 pthread_create(&t938, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, 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(&t938, ((void *)0), P1, ((void *)0))=-1, t937={5:0}, t938={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t939; [L878] FCALL, FORK 0 pthread_create(&t939, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, 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(&t939, ((void *)0), P2, ((void *)0))=0, t937={5:0}, t938={6:0}, t939={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t940; [L880] FCALL, FORK 0 pthread_create(&t940, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, 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(&t940, ((void *)0), P3, ((void *)0))=1, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L756] 1 b$w_buff1 = b$w_buff0 [L757] 1 b$w_buff0 = 1 [L758] 1 b$w_buff1_used = b$w_buff0_used [L759] 1 b$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L761] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L762] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L763] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L764] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L765] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L766] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L809] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L826] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L792] 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) [L793] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L794] 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 [L795] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L796] 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_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L799] EXPR 2 __unbuffered_cnt + 1 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L829] 4 a = 1 [L832] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L812] 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) [L813] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L814] 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 [L815] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L816] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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] [L819] EXPR 3 __unbuffered_cnt + 1 [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L821] 3 return 0; [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 b$flush_delayed = weak$$choice2 [L838] 4 b$mem_tmp = b [L839] 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) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 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)) [L845] 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)) [L846] 4 __unbuffered_p3_EBX = b [L847] 4 b = b$flush_delayed ? b$mem_tmp : b [L848] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, x=1, y=1, z=1] [L851] 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) [L852] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L853] 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 [L854] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L855] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, x=1, y=1, z=1] [L772] 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) [L773] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L774] 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 [L775] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L776] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, x=1, y=1, z=1] [L779] EXPR 1 __unbuffered_cnt + 1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L858] EXPR 4 __unbuffered_cnt + 1 [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 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) [L887] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L888] 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 [L889] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L890] 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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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, t937={5:0}, t938={6:0}, t939={7:0}, t940={3:0}, weak$$choice2=1, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] 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", "mix036.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_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, 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=1, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 880]: 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: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 191 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: 58.2s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 47.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1186 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1186 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 126 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4363 IncrementalHoareTripleChecker+Invalid, 4489 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 126 mSolverCounterUnsat, 29 mSDtfsCounter, 4363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=756occurred in iteration=11, InterpolantAutomatonStates: 131, 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.5s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 361 ConstructedInterpolants, 0 QuantifiedInterpolants, 2824 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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:46:48,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...