/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/safe019_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:56:06,226 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:56:06,292 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:56:06,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:56:06,296 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:56:06,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:56:06,321 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:56:06,328 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:56:06,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:56:06,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:56:06,330 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:56:06,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:56:06,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:56:06,333 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:56:06,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:56:06,333 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:56:06,333 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:56:06,333 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:56:06,333 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:56:06,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:56:06,334 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:56:06,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:56:06,334 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:56:06,334 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:56:06,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:56:06,335 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:56:06,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:56:06,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:56:06,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:56:06,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:56:06,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:56:06,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:56:06,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:56:06,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:56:06,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:56:06,337 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:56:06,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:56:06,605 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:56:06,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:56:06,607 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:56:06,609 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:56:06,609 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i [2023-08-27 03:56:07,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:56:07,756 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:56:07,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.opt.i [2023-08-27 03:56:07,777 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296f5770f/6c58a57b758b489fbfe3a38cdf0c0e3a/FLAG3844d063a [2023-08-27 03:56:07,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/296f5770f/6c58a57b758b489fbfe3a38cdf0c0e3a [2023-08-27 03:56:07,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:56:07,790 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:56:07,790 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:56:07,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:56:07,797 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:56:07,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:56:07" (1/1) ... [2023-08-27 03:56:07,798 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d3b0913 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:07, skipping insertion in model container [2023-08-27 03:56:07,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:56:07" (1/1) ... [2023-08-27 03:56:07,850 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:56:08,150 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:56:08,162 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:56:08,185 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:56:08,186 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:56:08,227 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:56:08,256 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:56:08,256 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:56:08,260 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:56:08,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08 WrapperNode [2023-08-27 03:56:08,261 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:56:08,262 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:56:08,262 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:56:08,262 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:56:08,266 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:56:08" (1/1) ... [2023-08-27 03:56:08,290 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:56:08" (1/1) ... [2023-08-27 03:56:08,316 INFO L138 Inliner]: procedures = 177, calls = 87, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 155 [2023-08-27 03:56:08,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:56:08,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:56:08,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:56:08,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:56:08,323 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (1/1) ... [2023-08-27 03:56:08,323 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (1/1) ... [2023-08-27 03:56:08,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (1/1) ... [2023-08-27 03:56:08,336 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (1/1) ... [2023-08-27 03:56:08,348 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (1/1) ... [2023-08-27 03:56:08,350 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (1/1) ... [2023-08-27 03:56:08,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (1/1) ... [2023-08-27 03:56:08,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (1/1) ... [2023-08-27 03:56:08,355 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:56:08,356 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:56:08,356 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:56:08,356 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:56:08,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (1/1) ... [2023-08-27 03:56:08,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:56:08,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:56:08,386 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:56:08,399 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:56:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 03:56:08,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:56:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:56:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:56:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:56:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:56:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:56:08,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:56:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:56:08,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:56:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:56:08,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:56:08,411 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:56:08,411 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:56:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:56:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:56:08,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:56:08,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:56:08,413 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:56:08,531 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:56:08,532 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:56:08,846 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:56:09,058 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:56:09,058 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:56:09,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:56:09 BoogieIcfgContainer [2023-08-27 03:56:09,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:56:09,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:56:09,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:56:09,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:56:09,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:56:07" (1/3) ... [2023-08-27 03:56:09,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f8584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:56:09, skipping insertion in model container [2023-08-27 03:56:09,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:56:08" (2/3) ... [2023-08-27 03:56:09,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65f8584f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:56:09, skipping insertion in model container [2023-08-27 03:56:09,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:56:09" (3/3) ... [2023-08-27 03:56:09,065 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_rmo.opt.i [2023-08-27 03:56:09,077 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:56:09,079 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-27 03:56:09,079 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:56:09,144 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:56:09,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 166 places, 156 transitions, 332 flow [2023-08-27 03:56:09,240 INFO L124 PetriNetUnfolderBase]: 3/152 cut-off events. [2023-08-27 03:56:09,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:56:09,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 152 events. 3/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-27 03:56:09,249 INFO L82 GeneralOperation]: Start removeDead. Operand has 166 places, 156 transitions, 332 flow [2023-08-27 03:56:09,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 152 transitions, 316 flow [2023-08-27 03:56:09,256 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:56:09,265 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 152 transitions, 316 flow [2023-08-27 03:56:09,268 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 152 transitions, 316 flow [2023-08-27 03:56:09,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 152 transitions, 316 flow [2023-08-27 03:56:09,306 INFO L124 PetriNetUnfolderBase]: 3/152 cut-off events. [2023-08-27 03:56:09,307 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:56:09,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 152 events. 3/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/140 useless extension candidates. Maximal degree in co-relation 95. Up to 2 conditions per place. [2023-08-27 03:56:09,310 INFO L119 LiptonReduction]: Number of co-enabled transitions 3812 [2023-08-27 03:56:15,010 INFO L134 LiptonReduction]: Checked pairs total: 13047 [2023-08-27 03:56:15,010 INFO L136 LiptonReduction]: Total number of compositions: 138 [2023-08-27 03:56:15,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:56:15,026 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;@2c7de287, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:56:15,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-27 03:56:15,028 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:56:15,028 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 03:56:15,028 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:56:15,029 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:15,029 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:56:15,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:15,032 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:15,032 INFO L85 PathProgramCache]: Analyzing trace with hash 861256250, now seen corresponding path program 1 times [2023-08-27 03:56:15,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:15,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240268731] [2023-08-27 03:56:15,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:15,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:15,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:15,283 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:56:15,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:15,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240268731] [2023-08-27 03:56:15,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240268731] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:15,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:15,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:56:15,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392876525] [2023-08-27 03:56:15,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:15,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:56:15,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:15,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:56:15,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:56:15,305 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 294 [2023-08-27 03:56:15,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:56:15,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:15,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 294 [2023-08-27 03:56:15,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:16,770 INFO L124 PetriNetUnfolderBase]: 10523/14586 cut-off events. [2023-08-27 03:56:16,770 INFO L125 PetriNetUnfolderBase]: For 125/125 co-relation queries the response was YES. [2023-08-27 03:56:16,787 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29446 conditions, 14586 events. 10523/14586 cut-off events. For 125/125 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 78663 event pairs, 2964 based on Foata normal form. 0/10043 useless extension candidates. Maximal degree in co-relation 29434. Up to 12949 conditions per place. [2023-08-27 03:56:16,846 INFO L140 encePairwiseOnDemand]: 281/294 looper letters, 49 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-27 03:56:16,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 239 flow [2023-08-27 03:56:16,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:56:16,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:56:16,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-08-27 03:56:16,856 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022675736961452 [2023-08-27 03:56:16,856 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-08-27 03:56:16,856 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-08-27 03:56:16,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:16,859 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-08-27 03:56:16,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:56:16,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:56:16,866 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:56:16,867 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 78 flow. Second operand 3 states and 443 transitions. [2023-08-27 03:56:16,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 239 flow [2023-08-27 03:56:16,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 55 transitions, 232 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:56:16,872 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 121 flow [2023-08-27 03:56:16,873 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-27 03:56:16,875 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2023-08-27 03:56:16,875 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 121 flow [2023-08-27 03:56:16,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:56:16,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:16,876 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:16,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:56:16,876 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:16,876 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:16,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1418742031, now seen corresponding path program 1 times [2023-08-27 03:56:16,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:16,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362830490] [2023-08-27 03:56:16,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:16,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:16,974 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:56:16,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:16,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362830490] [2023-08-27 03:56:16,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362830490] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:16,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:16,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:56:16,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375235810] [2023-08-27 03:56:16,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:16,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:56:16,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:16,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:56:16,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:56:16,977 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 294 [2023-08-27 03:56:16,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:56:16,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:16,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 294 [2023-08-27 03:56:16,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:17,933 INFO L124 PetriNetUnfolderBase]: 6487/8976 cut-off events. [2023-08-27 03:56:17,933 INFO L125 PetriNetUnfolderBase]: For 528/528 co-relation queries the response was YES. [2023-08-27 03:56:17,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21933 conditions, 8976 events. 6487/8976 cut-off events. For 528/528 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 45046 event pairs, 1720 based on Foata normal form. 0/7237 useless extension candidates. Maximal degree in co-relation 21922. Up to 7338 conditions per place. [2023-08-27 03:56:17,972 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 45 selfloop transitions, 5 changer transitions 0/51 dead transitions. [2023-08-27 03:56:17,972 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 247 flow [2023-08-27 03:56:17,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:56:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:56:17,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 562 transitions. [2023-08-27 03:56:17,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.477891156462585 [2023-08-27 03:56:17,976 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 562 transitions. [2023-08-27 03:56:17,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 562 transitions. [2023-08-27 03:56:17,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:17,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 562 transitions. [2023-08-27 03:56:17,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.5) internal successors, (562), 4 states have internal predecessors, (562), 0 states have call successors, (0), 0 states 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:56:17,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:56:17,981 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:56:17,981 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 121 flow. Second operand 4 states and 562 transitions. [2023-08-27 03:56:17,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 247 flow [2023-08-27 03:56:17,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:56:17,984 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 110 flow [2023-08-27 03:56:17,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-27 03:56:17,987 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -3 predicate places. [2023-08-27 03:56:17,988 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 110 flow [2023-08-27 03:56:17,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:56:17,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:17,992 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:17,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:56:17,992 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:17,993 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:17,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1418742032, now seen corresponding path program 1 times [2023-08-27 03:56:17,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:17,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858030661] [2023-08-27 03:56:17,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:17,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:18,091 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:56:18,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:18,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858030661] [2023-08-27 03:56:18,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858030661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:18,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:18,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:56:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238360932] [2023-08-27 03:56:18,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:18,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:56:18,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:18,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:56:18,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:56:18,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 294 [2023-08-27 03:56:18,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:56:18,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:18,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 294 [2023-08-27 03:56:18,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:18,753 INFO L124 PetriNetUnfolderBase]: 4327/6030 cut-off events. [2023-08-27 03:56:18,753 INFO L125 PetriNetUnfolderBase]: For 1664/1664 co-relation queries the response was YES. [2023-08-27 03:56:18,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14552 conditions, 6030 events. 4327/6030 cut-off events. For 1664/1664 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 28707 event pairs, 1191 based on Foata normal form. 0/5451 useless extension candidates. Maximal degree in co-relation 14540. Up to 2268 conditions per place. [2023-08-27 03:56:18,772 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 61 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-27 03:56:18,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 71 transitions, 344 flow [2023-08-27 03:56:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:56:18,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:56:18,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 582 transitions. [2023-08-27 03:56:18,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49489795918367346 [2023-08-27 03:56:18,774 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 582 transitions. [2023-08-27 03:56:18,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 582 transitions. [2023-08-27 03:56:18,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:18,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 582 transitions. [2023-08-27 03:56:18,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 145.5) internal successors, (582), 4 states have internal predecessors, (582), 0 states have call successors, (0), 0 states 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:56:18,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:56:18,779 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:56:18,779 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 110 flow. Second operand 4 states and 582 transitions. [2023-08-27 03:56:18,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 71 transitions, 344 flow [2023-08-27 03:56:18,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 71 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:56:18,782 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 162 flow [2023-08-27 03:56:18,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=162, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-27 03:56:18,783 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, -1 predicate places. [2023-08-27 03:56:18,783 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 162 flow [2023-08-27 03:56:18,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:56:18,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:18,784 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:18,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:56:18,786 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:18,786 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:18,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1370082495, now seen corresponding path program 1 times [2023-08-27 03:56:18,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:18,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900665885] [2023-08-27 03:56:18,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:18,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:18,916 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:56:18,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:18,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900665885] [2023-08-27 03:56:18,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900665885] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:18,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:18,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:56:18,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058684638] [2023-08-27 03:56:18,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:18,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:56:18,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:18,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:56:18,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:56:18,919 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 294 [2023-08-27 03:56:18,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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:56:18,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:18,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 294 [2023-08-27 03:56:18,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:19,666 INFO L124 PetriNetUnfolderBase]: 5298/7318 cut-off events. [2023-08-27 03:56:19,666 INFO L125 PetriNetUnfolderBase]: For 5064/5064 co-relation queries the response was YES. [2023-08-27 03:56:19,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20214 conditions, 7318 events. 5298/7318 cut-off events. For 5064/5064 co-relation queries the response was YES. Maximal size of possible extension queue 254. Compared 33227 event pairs, 1182 based on Foata normal form. 0/6700 useless extension candidates. Maximal degree in co-relation 20201. Up to 6679 conditions per place. [2023-08-27 03:56:19,692 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 50 selfloop transitions, 3 changer transitions 0/53 dead transitions. [2023-08-27 03:56:19,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 324 flow [2023-08-27 03:56:19,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:56:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:56:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2023-08-27 03:56:19,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4886621315192744 [2023-08-27 03:56:19,694 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 431 transitions. [2023-08-27 03:56:19,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 431 transitions. [2023-08-27 03:56:19,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:19,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 431 transitions. [2023-08-27 03:56:19,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.66666666666666) internal successors, (431), 3 states have internal predecessors, (431), 0 states have call successors, (0), 0 states 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:56:19,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:56:19,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:56:19,697 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 162 flow. Second operand 3 states and 431 transitions. [2023-08-27 03:56:19,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 324 flow [2023-08-27 03:56:19,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 53 transitions, 298 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 03:56:19,701 INFO L231 Difference]: Finished difference. Result has 46 places, 39 transitions, 163 flow [2023-08-27 03:56:19,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=163, PETRI_PLACES=46, PETRI_TRANSITIONS=39} [2023-08-27 03:56:19,702 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 0 predicate places. [2023-08-27 03:56:19,702 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 39 transitions, 163 flow [2023-08-27 03:56:19,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states 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:56:19,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:19,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:19,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:56:19,703 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:19,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:19,703 INFO L85 PathProgramCache]: Analyzing trace with hash 477113432, now seen corresponding path program 1 times [2023-08-27 03:56:19,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:19,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792356683] [2023-08-27 03:56:19,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:19,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:19,792 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:56:19,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:19,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792356683] [2023-08-27 03:56:19,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792356683] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:19,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:19,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:56:19,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005826343] [2023-08-27 03:56:19,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:19,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:56:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:56:19,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:56:19,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 294 [2023-08-27 03:56:19,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 39 transitions, 163 flow. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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:56:19,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:19,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 294 [2023-08-27 03:56:19,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:20,415 INFO L124 PetriNetUnfolderBase]: 4629/6486 cut-off events. [2023-08-27 03:56:20,415 INFO L125 PetriNetUnfolderBase]: For 2651/2659 co-relation queries the response was YES. [2023-08-27 03:56:20,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17703 conditions, 6486 events. 4629/6486 cut-off events. For 2651/2659 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 31186 event pairs, 1197 based on Foata normal form. 79/6283 useless extension candidates. Maximal degree in co-relation 17689. Up to 5434 conditions per place. [2023-08-27 03:56:20,441 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 63 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-08-27 03:56:20,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 405 flow [2023-08-27 03:56:20,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:56:20,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:56:20,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2023-08-27 03:56:20,442 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5022675736961452 [2023-08-27 03:56:20,442 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 443 transitions. [2023-08-27 03:56:20,442 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 443 transitions. [2023-08-27 03:56:20,443 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:20,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 443 transitions. [2023-08-27 03:56:20,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 147.66666666666666) internal successors, (443), 3 states have internal predecessors, (443), 0 states have call successors, (0), 0 states 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:56:20,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:56:20,445 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:56:20,445 INFO L175 Difference]: Start difference. First operand has 46 places, 39 transitions, 163 flow. Second operand 3 states and 443 transitions. [2023-08-27 03:56:20,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 405 flow [2023-08-27 03:56:20,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 401 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:56:20,448 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 168 flow [2023-08-27 03:56:20,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, 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=168, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-27 03:56:20,449 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 2 predicate places. [2023-08-27 03:56:20,449 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 168 flow [2023-08-27 03:56:20,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states 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:56:20,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:20,449 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:20,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:56:20,449 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:20,450 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:20,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1902816555, now seen corresponding path program 1 times [2023-08-27 03:56:20,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:20,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860411109] [2023-08-27 03:56:20,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:20,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:20,592 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:56:20,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:20,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860411109] [2023-08-27 03:56:20,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860411109] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:20,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:20,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:56:20,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125225370] [2023-08-27 03:56:20,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:20,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:56:20,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:56:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:56:20,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 294 [2023-08-27 03:56:20,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 168 flow. Second operand has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:56:20,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:20,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 294 [2023-08-27 03:56:20,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:21,231 INFO L124 PetriNetUnfolderBase]: 4707/6613 cut-off events. [2023-08-27 03:56:21,232 INFO L125 PetriNetUnfolderBase]: For 3650/3650 co-relation queries the response was YES. [2023-08-27 03:56:21,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18649 conditions, 6613 events. 4707/6613 cut-off events. For 3650/3650 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 30692 event pairs, 1230 based on Foata normal form. 39/6377 useless extension candidates. Maximal degree in co-relation 18633. Up to 5320 conditions per place. [2023-08-27 03:56:21,252 INFO L140 encePairwiseOnDemand]: 291/294 looper letters, 58 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-08-27 03:56:21,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 62 transitions, 386 flow [2023-08-27 03:56:21,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:56:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:56:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2023-08-27 03:56:21,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4977324263038549 [2023-08-27 03:56:21,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 439 transitions. [2023-08-27 03:56:21,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 439 transitions. [2023-08-27 03:56:21,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:21,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 439 transitions. [2023-08-27 03:56:21,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 146.33333333333334) internal successors, (439), 3 states have internal predecessors, (439), 0 states have call successors, (0), 0 states 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:56:21,256 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:56:21,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 294.0) internal successors, (1176), 4 states have internal predecessors, (1176), 0 states have call successors, (0), 0 states 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:56:21,256 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 168 flow. Second operand 3 states and 439 transitions. [2023-08-27 03:56:21,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 62 transitions, 386 flow [2023-08-27 03:56:21,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 380 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:56:21,260 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 172 flow [2023-08-27 03:56:21,260 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=172, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-27 03:56:21,261 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 3 predicate places. [2023-08-27 03:56:21,261 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 172 flow [2023-08-27 03:56:21,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 states 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:56:21,261 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:21,261 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:21,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:56:21,261 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:21,261 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1435598276, now seen corresponding path program 1 times [2023-08-27 03:56:21,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:21,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857454155] [2023-08-27 03:56:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:21,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:21,400 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:56:21,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:21,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857454155] [2023-08-27 03:56:21,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857454155] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:21,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:21,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:56:21,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385481552] [2023-08-27 03:56:21,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:21,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:56:21,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:21,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:56:21,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:56:21,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 294 [2023-08-27 03:56:21,402 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 172 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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:56:21,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:21,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 294 [2023-08-27 03:56:21,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:22,503 INFO L124 PetriNetUnfolderBase]: 7707/10739 cut-off events. [2023-08-27 03:56:22,503 INFO L125 PetriNetUnfolderBase]: For 7111/7111 co-relation queries the response was YES. [2023-08-27 03:56:22,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31076 conditions, 10739 events. 7707/10739 cut-off events. For 7111/7111 co-relation queries the response was YES. Maximal size of possible extension queue 377. Compared 53693 event pairs, 978 based on Foata normal form. 223/10473 useless extension candidates. Maximal degree in co-relation 31059. Up to 5059 conditions per place. [2023-08-27 03:56:22,545 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 78 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2023-08-27 03:56:22,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 82 transitions, 511 flow [2023-08-27 03:56:22,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:56:22,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:56:22,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 577 transitions. [2023-08-27 03:56:22,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4906462585034014 [2023-08-27 03:56:22,547 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 577 transitions. [2023-08-27 03:56:22,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 577 transitions. [2023-08-27 03:56:22,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:22,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 577 transitions. [2023-08-27 03:56:22,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 144.25) internal successors, (577), 4 states have internal predecessors, (577), 0 states have call successors, (0), 0 states 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:56:22,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:56:22,549 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 294.0) internal successors, (1470), 5 states have internal predecessors, (1470), 0 states have call successors, (0), 0 states 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:56:22,550 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 172 flow. Second operand 4 states and 577 transitions. [2023-08-27 03:56:22,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 82 transitions, 511 flow [2023-08-27 03:56:22,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 82 transitions, 503 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:56:22,555 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 186 flow [2023-08-27 03:56:22,555 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-27 03:56:22,556 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 5 predicate places. [2023-08-27 03:56:22,556 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 186 flow [2023-08-27 03:56:22,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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:56:22,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:22,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:22,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:56:22,557 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:22,557 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:22,557 INFO L85 PathProgramCache]: Analyzing trace with hash 427555216, now seen corresponding path program 2 times [2023-08-27 03:56:22,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:22,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041196089] [2023-08-27 03:56:22,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:22,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:22,684 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:56:22,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:22,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041196089] [2023-08-27 03:56:22,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041196089] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:22,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:22,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:56:22,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478519590] [2023-08-27 03:56:22,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:22,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:56:22,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:22,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:56:22,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:56:22,686 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 294 [2023-08-27 03:56:22,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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:56:22,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:22,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 294 [2023-08-27 03:56:22,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:24,566 INFO L124 PetriNetUnfolderBase]: 13533/19147 cut-off events. [2023-08-27 03:56:24,566 INFO L125 PetriNetUnfolderBase]: For 14885/14885 co-relation queries the response was YES. [2023-08-27 03:56:24,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55273 conditions, 19147 events. 13533/19147 cut-off events. For 14885/14885 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 109326 event pairs, 4636 based on Foata normal form. 474/18392 useless extension candidates. Maximal degree in co-relation 55255. Up to 8373 conditions per place. [2023-08-27 03:56:24,628 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 113 selfloop transitions, 5 changer transitions 0/118 dead transitions. [2023-08-27 03:56:24,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 118 transitions, 768 flow [2023-08-27 03:56:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:56:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:56:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 727 transitions. [2023-08-27 03:56:24,630 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49455782312925173 [2023-08-27 03:56:24,630 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 727 transitions. [2023-08-27 03:56:24,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 727 transitions. [2023-08-27 03:56:24,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:24,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 727 transitions. [2023-08-27 03:56:24,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.4) internal successors, (727), 5 states have internal predecessors, (727), 0 states have call successors, (0), 0 states 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:56:24,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:56:24,634 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:56:24,634 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 186 flow. Second operand 5 states and 727 transitions. [2023-08-27 03:56:24,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 118 transitions, 768 flow [2023-08-27 03:56:24,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 118 transitions, 762 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:56:24,638 INFO L231 Difference]: Finished difference. Result has 56 places, 42 transitions, 215 flow [2023-08-27 03:56:24,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=56, PETRI_TRANSITIONS=42} [2023-08-27 03:56:24,639 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 10 predicate places. [2023-08-27 03:56:24,639 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 42 transitions, 215 flow [2023-08-27 03:56:24,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states 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:56:24,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:24,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:24,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:56:24,639 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:24,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash 424796185, now seen corresponding path program 1 times [2023-08-27 03:56:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944694925] [2023-08-27 03:56:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:24,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:24,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:25,562 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:56:25,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:25,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944694925] [2023-08-27 03:56:25,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944694925] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:25,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:25,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:56:25,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819883877] [2023-08-27 03:56:25,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:25,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:56:25,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:25,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:56:25,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:56:25,564 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 294 [2023-08-27 03:56:25,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 42 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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:56:25,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:25,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 294 [2023-08-27 03:56:25,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:27,689 INFO L124 PetriNetUnfolderBase]: 12273/17573 cut-off events. [2023-08-27 03:56:27,689 INFO L125 PetriNetUnfolderBase]: For 15255/15277 co-relation queries the response was YES. [2023-08-27 03:56:27,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52378 conditions, 17573 events. 12273/17573 cut-off events. For 15255/15277 co-relation queries the response was YES. Maximal size of possible extension queue 736. Compared 102430 event pairs, 5866 based on Foata normal form. 9/16296 useless extension candidates. Maximal degree in co-relation 52358. Up to 16999 conditions per place. [2023-08-27 03:56:27,750 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 73 selfloop transitions, 17 changer transitions 0/92 dead transitions. [2023-08-27 03:56:27,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 92 transitions, 599 flow [2023-08-27 03:56:27,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:56:27,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:56:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 699 transitions. [2023-08-27 03:56:27,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39625850340136054 [2023-08-27 03:56:27,752 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 699 transitions. [2023-08-27 03:56:27,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 699 transitions. [2023-08-27 03:56:27,753 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:27,753 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 699 transitions. [2023-08-27 03:56:27,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.5) internal successors, (699), 6 states have internal predecessors, (699), 0 states have call successors, (0), 0 states 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:56:27,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:56:27,756 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:56:27,756 INFO L175 Difference]: Start difference. First operand has 56 places, 42 transitions, 215 flow. Second operand 6 states and 699 transitions. [2023-08-27 03:56:27,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 92 transitions, 599 flow [2023-08-27 03:56:27,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 92 transitions, 582 flow, removed 6 selfloop flow, removed 1 redundant places. [2023-08-27 03:56:27,766 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 293 flow [2023-08-27 03:56:27,767 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=293, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-08-27 03:56:27,767 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 15 predicate places. [2023-08-27 03:56:27,767 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 293 flow [2023-08-27 03:56:27,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states 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:56:27,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:27,768 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:27,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:56:27,768 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:27,768 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:27,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1049480677, now seen corresponding path program 1 times [2023-08-27 03:56:27,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:27,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559025980] [2023-08-27 03:56:27,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:27,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:28,318 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:56:28,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:28,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559025980] [2023-08-27 03:56:28,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559025980] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:28,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:28,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:56:28,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487089772] [2023-08-27 03:56:28,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:28,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:56:28,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:28,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:56:28,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:56:28,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 294 [2023-08-27 03:56:28,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 293 flow. Second operand has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:56:28,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:28,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 294 [2023-08-27 03:56:28,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:31,423 INFO L124 PetriNetUnfolderBase]: 21878/31835 cut-off events. [2023-08-27 03:56:31,423 INFO L125 PetriNetUnfolderBase]: For 32458/32546 co-relation queries the response was YES. [2023-08-27 03:56:31,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103178 conditions, 31835 events. 21878/31835 cut-off events. For 32458/32546 co-relation queries the response was YES. Maximal size of possible extension queue 1419. Compared 212468 event pairs, 7874 based on Foata normal form. 61/29157 useless extension candidates. Maximal degree in co-relation 103156. Up to 19938 conditions per place. [2023-08-27 03:56:31,591 INFO L140 encePairwiseOnDemand]: 283/294 looper letters, 99 selfloop transitions, 19 changer transitions 0/120 dead transitions. [2023-08-27 03:56:31,592 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 120 transitions, 833 flow [2023-08-27 03:56:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:56:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:56:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 647 transitions. [2023-08-27 03:56:31,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44013605442176873 [2023-08-27 03:56:31,593 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 647 transitions. [2023-08-27 03:56:31,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 647 transitions. [2023-08-27 03:56:31,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:31,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 647 transitions. [2023-08-27 03:56:31,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states 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:56:31,596 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:56:31,596 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:56:31,597 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 293 flow. Second operand 5 states and 647 transitions. [2023-08-27 03:56:31,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 120 transitions, 833 flow [2023-08-27 03:56:31,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 120 transitions, 833 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:56:31,641 INFO L231 Difference]: Finished difference. Result has 68 places, 71 transitions, 425 flow [2023-08-27 03:56:31,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=425, PETRI_PLACES=68, PETRI_TRANSITIONS=71} [2023-08-27 03:56:31,642 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 22 predicate places. [2023-08-27 03:56:31,642 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 71 transitions, 425 flow [2023-08-27 03:56:31,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.5) internal successors, (705), 6 states have internal predecessors, (705), 0 states have call successors, (0), 0 states 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:56:31,642 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:31,642 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:31,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:56:31,642 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:31,642 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:31,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1119105127, now seen corresponding path program 2 times [2023-08-27 03:56:31,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:31,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287957158] [2023-08-27 03:56:31,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:31,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:31,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:32,362 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:56:32,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:32,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287957158] [2023-08-27 03:56:32,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287957158] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:32,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:32,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:56:32,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862614598] [2023-08-27 03:56:32,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:32,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:56:32,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:32,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:56:32,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:56:32,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 294 [2023-08-27 03:56:32,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 71 transitions, 425 flow. Second operand has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states 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:56:32,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:32,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 294 [2023-08-27 03:56:32,364 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:37,561 INFO L124 PetriNetUnfolderBase]: 29997/44168 cut-off events. [2023-08-27 03:56:37,561 INFO L125 PetriNetUnfolderBase]: For 71147/71269 co-relation queries the response was YES. [2023-08-27 03:56:37,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162472 conditions, 44168 events. 29997/44168 cut-off events. For 71147/71269 co-relation queries the response was YES. Maximal size of possible extension queue 2065. Compared 315895 event pairs, 8010 based on Foata normal form. 69/39998 useless extension candidates. Maximal degree in co-relation 162445. Up to 16773 conditions per place. [2023-08-27 03:56:37,816 INFO L140 encePairwiseOnDemand]: 283/294 looper letters, 148 selfloop transitions, 32 changer transitions 0/182 dead transitions. [2023-08-27 03:56:37,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 182 transitions, 1385 flow [2023-08-27 03:56:37,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:56:37,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:56:37,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 924 transitions. [2023-08-27 03:56:37,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4489795918367347 [2023-08-27 03:56:37,818 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 924 transitions. [2023-08-27 03:56:37,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 924 transitions. [2023-08-27 03:56:37,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:37,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 924 transitions. [2023-08-27 03:56:37,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 132.0) internal successors, (924), 7 states have internal predecessors, (924), 0 states have call successors, (0), 0 states 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:56:37,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states 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:56:37,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states 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:56:37,822 INFO L175 Difference]: Start difference. First operand has 68 places, 71 transitions, 425 flow. Second operand 7 states and 924 transitions. [2023-08-27 03:56:37,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 182 transitions, 1385 flow [2023-08-27 03:56:37,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 182 transitions, 1384 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:56:37,887 INFO L231 Difference]: Finished difference. Result has 76 places, 84 transitions, 631 flow [2023-08-27 03:56:37,887 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=631, PETRI_PLACES=76, PETRI_TRANSITIONS=84} [2023-08-27 03:56:37,888 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 30 predicate places. [2023-08-27 03:56:37,888 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 84 transitions, 631 flow [2023-08-27 03:56:37,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states 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:56:37,888 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:37,888 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:37,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:56:37,888 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:37,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:37,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1119172087, now seen corresponding path program 3 times [2023-08-27 03:56:37,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:37,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527653938] [2023-08-27 03:56:37,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:37,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:38,776 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:56:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527653938] [2023-08-27 03:56:38,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527653938] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:38,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:56:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317624806] [2023-08-27 03:56:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:38,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:56:38,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:38,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:56:38,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:56:38,778 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 294 [2023-08-27 03:56:38,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 84 transitions, 631 flow. Second operand has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states 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:56:38,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:38,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 294 [2023-08-27 03:56:38,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:45,303 INFO L124 PetriNetUnfolderBase]: 37315/55113 cut-off events. [2023-08-27 03:56:45,303 INFO L125 PetriNetUnfolderBase]: For 171863/172020 co-relation queries the response was YES. [2023-08-27 03:56:45,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231488 conditions, 55113 events. 37315/55113 cut-off events. For 171863/172020 co-relation queries the response was YES. Maximal size of possible extension queue 2641. Compared 407182 event pairs, 14555 based on Foata normal form. 77/49372 useless extension candidates. Maximal degree in co-relation 231457. Up to 39964 conditions per place. [2023-08-27 03:56:45,672 INFO L140 encePairwiseOnDemand]: 281/294 looper letters, 141 selfloop transitions, 26 changer transitions 0/169 dead transitions. [2023-08-27 03:56:45,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 169 transitions, 1496 flow [2023-08-27 03:56:45,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:56:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:56:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 784 transitions. [2023-08-27 03:56:45,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-27 03:56:45,674 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 784 transitions. [2023-08-27 03:56:45,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 784 transitions. [2023-08-27 03:56:45,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:45,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 784 transitions. [2023-08-27 03:56:45,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.66666666666666) internal successors, (784), 6 states have internal predecessors, (784), 0 states have call successors, (0), 0 states 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:56:45,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:56:45,677 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:56:45,677 INFO L175 Difference]: Start difference. First operand has 76 places, 84 transitions, 631 flow. Second operand 6 states and 784 transitions. [2023-08-27 03:56:45,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 169 transitions, 1496 flow [2023-08-27 03:56:45,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 169 transitions, 1461 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-27 03:56:45,866 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 844 flow [2023-08-27 03:56:45,866 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=604, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=844, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2023-08-27 03:56:45,867 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 36 predicate places. [2023-08-27 03:56:45,867 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 844 flow [2023-08-27 03:56:45,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.5) internal successors, (711), 6 states have internal predecessors, (711), 0 states have call successors, (0), 0 states 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:56:45,867 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:45,867 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:45,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:56:45,867 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:45,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:45,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1828557664, now seen corresponding path program 1 times [2023-08-27 03:56:45,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:45,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531432577] [2023-08-27 03:56:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:45,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:45,949 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:56:45,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531432577] [2023-08-27 03:56:45,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531432577] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:45,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:45,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:56:45,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954897197] [2023-08-27 03:56:45,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:45,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:56:45,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:45,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:56:45,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:56:45,951 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2023-08-27 03:56:45,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 844 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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:56:45,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:45,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2023-08-27 03:56:45,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:51,964 INFO L124 PetriNetUnfolderBase]: 33988/52336 cut-off events. [2023-08-27 03:56:51,964 INFO L125 PetriNetUnfolderBase]: For 241511/241640 co-relation queries the response was YES. [2023-08-27 03:56:52,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236009 conditions, 52336 events. 33988/52336 cut-off events. For 241511/241640 co-relation queries the response was YES. Maximal size of possible extension queue 2879. Compared 416426 event pairs, 8707 based on Foata normal form. 3800/49291 useless extension candidates. Maximal degree in co-relation 235974. Up to 41015 conditions per place. [2023-08-27 03:56:52,357 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 227 selfloop transitions, 10 changer transitions 0/239 dead transitions. [2023-08-27 03:56:52,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 239 transitions, 2576 flow [2023-08-27 03:56:52,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:56:52,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:56:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 692 transitions. [2023-08-27 03:56:52,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707482993197279 [2023-08-27 03:56:52,359 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 692 transitions. [2023-08-27 03:56:52,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 692 transitions. [2023-08-27 03:56:52,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:52,360 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 692 transitions. [2023-08-27 03:56:52,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 138.4) internal successors, (692), 5 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:56:52,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:56:52,362 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:56:52,362 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 844 flow. Second operand 5 states and 692 transitions. [2023-08-27 03:56:52,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 239 transitions, 2576 flow [2023-08-27 03:56:52,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 239 transitions, 2575 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:56:52,525 INFO L231 Difference]: Finished difference. Result has 87 places, 100 transitions, 903 flow [2023-08-27 03:56:52,525 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=812, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=903, PETRI_PLACES=87, PETRI_TRANSITIONS=100} [2023-08-27 03:56:52,525 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 41 predicate places. [2023-08-27 03:56:52,525 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 100 transitions, 903 flow [2023-08-27 03:56:52,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states 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:56:52,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:52,526 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:52,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:56:52,526 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:52,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:52,526 INFO L85 PathProgramCache]: Analyzing trace with hash 2081518933, now seen corresponding path program 1 times [2023-08-27 03:56:52,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:52,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543836764] [2023-08-27 03:56:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:52,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:52,583 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:56:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543836764] [2023-08-27 03:56:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543836764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:52,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:52,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:56:52,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24166620] [2023-08-27 03:56:52,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:52,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:56:52,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:52,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:56:52,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:56:52,584 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 294 [2023-08-27 03:56:52,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 100 transitions, 903 flow. Second operand has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:56:52,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:52,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 294 [2023-08-27 03:56:52,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:56:57,531 INFO L124 PetriNetUnfolderBase]: 25813/39005 cut-off events. [2023-08-27 03:56:57,531 INFO L125 PetriNetUnfolderBase]: For 204851/204978 co-relation queries the response was YES. [2023-08-27 03:56:57,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 190245 conditions, 39005 events. 25813/39005 cut-off events. For 204851/204978 co-relation queries the response was YES. Maximal size of possible extension queue 2304. Compared 293043 event pairs, 1502 based on Foata normal form. 31/38309 useless extension candidates. Maximal degree in co-relation 190206. Up to 14796 conditions per place. [2023-08-27 03:56:57,779 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 247 selfloop transitions, 17 changer transitions 0/266 dead transitions. [2023-08-27 03:56:57,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 266 transitions, 3053 flow [2023-08-27 03:56:57,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:56:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:56:57,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 724 transitions. [2023-08-27 03:56:57,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4925170068027211 [2023-08-27 03:56:57,781 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 724 transitions. [2023-08-27 03:56:57,781 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 724 transitions. [2023-08-27 03:56:57,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:56:57,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 724 transitions. [2023-08-27 03:56:57,782 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.8) internal successors, (724), 5 states have internal predecessors, (724), 0 states have call successors, (0), 0 states 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:56:57,783 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:56:57,784 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:56:57,784 INFO L175 Difference]: Start difference. First operand has 87 places, 100 transitions, 903 flow. Second operand 5 states and 724 transitions. [2023-08-27 03:56:57,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 266 transitions, 3053 flow [2023-08-27 03:56:58,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 266 transitions, 3039 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:56:58,017 INFO L231 Difference]: Finished difference. Result has 90 places, 104 transitions, 971 flow [2023-08-27 03:56:58,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=971, PETRI_PLACES=90, PETRI_TRANSITIONS=104} [2023-08-27 03:56:58,018 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 44 predicate places. [2023-08-27 03:56:58,018 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 104 transitions, 971 flow [2023-08-27 03:56:58,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:56:58,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:56:58,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:56:58,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:56:58,019 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:56:58,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:56:58,019 INFO L85 PathProgramCache]: Analyzing trace with hash -178522776, now seen corresponding path program 1 times [2023-08-27 03:56:58,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:56:58,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752070873] [2023-08-27 03:56:58,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:56:58,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:56:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:56:58,654 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:56:58,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:56:58,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752070873] [2023-08-27 03:56:58,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752070873] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:56:58,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:56:58,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:56:58,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161144758] [2023-08-27 03:56:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:56:58,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:56:58,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:56:58,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:56:58,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:56:58,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 294 [2023-08-27 03:56:58,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 104 transitions, 971 flow. Second operand has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states 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:56:58,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:56:58,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 294 [2023-08-27 03:56:58,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:05,513 INFO L124 PetriNetUnfolderBase]: 34634/52926 cut-off events. [2023-08-27 03:57:05,513 INFO L125 PetriNetUnfolderBase]: For 303187/303566 co-relation queries the response was YES. [2023-08-27 03:57:05,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279659 conditions, 52926 events. 34634/52926 cut-off events. For 303187/303566 co-relation queries the response was YES. Maximal size of possible extension queue 3201. Compared 418637 event pairs, 10906 based on Foata normal form. 358/52419 useless extension candidates. Maximal degree in co-relation 279619. Up to 39095 conditions per place. [2023-08-27 03:57:05,919 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 177 selfloop transitions, 41 changer transitions 0/220 dead transitions. [2023-08-27 03:57:05,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 220 transitions, 2435 flow [2023-08-27 03:57:05,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:57:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:57:05,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 761 transitions. [2023-08-27 03:57:05,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43140589569161 [2023-08-27 03:57:05,920 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 761 transitions. [2023-08-27 03:57:05,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 761 transitions. [2023-08-27 03:57:05,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:05,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 761 transitions. [2023-08-27 03:57:05,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.83333333333333) internal successors, (761), 6 states have internal predecessors, (761), 0 states have call successors, (0), 0 states 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:57:05,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:57:05,924 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:57:05,924 INFO L175 Difference]: Start difference. First operand has 90 places, 104 transitions, 971 flow. Second operand 6 states and 761 transitions. [2023-08-27 03:57:05,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 220 transitions, 2435 flow [2023-08-27 03:57:09,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 220 transitions, 2293 flow, removed 28 selfloop flow, removed 3 redundant places. [2023-08-27 03:57:09,464 INFO L231 Difference]: Finished difference. Result has 95 places, 135 transitions, 1416 flow [2023-08-27 03:57:09,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=929, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1416, PETRI_PLACES=95, PETRI_TRANSITIONS=135} [2023-08-27 03:57:09,465 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 49 predicate places. [2023-08-27 03:57:09,465 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 135 transitions, 1416 flow [2023-08-27 03:57:09,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.66666666666667) internal successors, (700), 6 states have internal predecessors, (700), 0 states have call successors, (0), 0 states 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:57:09,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:09,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:57:09,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:57:09,466 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:57:09,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:09,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1269988588, now seen corresponding path program 2 times [2023-08-27 03:57:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:09,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467785578] [2023-08-27 03:57:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:10,260 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:57:10,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:10,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467785578] [2023-08-27 03:57:10,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467785578] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:10,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:10,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:57:10,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282720908] [2023-08-27 03:57:10,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:10,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:57:10,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:10,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:57:10,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:57:10,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 294 [2023-08-27 03:57:10,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 135 transitions, 1416 flow. Second operand has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states 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:57:10,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:10,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 294 [2023-08-27 03:57:10,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:17,206 INFO L124 PetriNetUnfolderBase]: 34631/52462 cut-off events. [2023-08-27 03:57:17,206 INFO L125 PetriNetUnfolderBase]: For 361295/361785 co-relation queries the response was YES. [2023-08-27 03:57:17,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286654 conditions, 52462 events. 34631/52462 cut-off events. For 361295/361785 co-relation queries the response was YES. Maximal size of possible extension queue 3172. Compared 408466 event pairs, 12614 based on Foata normal form. 171/51767 useless extension candidates. Maximal degree in co-relation 286611. Up to 51373 conditions per place. [2023-08-27 03:57:17,651 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 163 selfloop transitions, 54 changer transitions 0/219 dead transitions. [2023-08-27 03:57:17,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 219 transitions, 2731 flow [2023-08-27 03:57:17,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:57:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:57:17,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 584 transitions. [2023-08-27 03:57:17,653 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39727891156462586 [2023-08-27 03:57:17,653 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 584 transitions. [2023-08-27 03:57:17,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 584 transitions. [2023-08-27 03:57:17,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:17,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 584 transitions. [2023-08-27 03:57:17,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.8) internal successors, (584), 5 states have internal predecessors, (584), 0 states have call successors, (0), 0 states 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:57:17,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:57:17,656 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:57:17,656 INFO L175 Difference]: Start difference. First operand has 95 places, 135 transitions, 1416 flow. Second operand 5 states and 584 transitions. [2023-08-27 03:57:17,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 219 transitions, 2731 flow [2023-08-27 03:57:21,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 219 transitions, 2710 flow, removed 10 selfloop flow, removed 1 redundant places. [2023-08-27 03:57:21,386 INFO L231 Difference]: Finished difference. Result has 101 places, 183 transitions, 2203 flow [2023-08-27 03:57:21,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1407, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2203, PETRI_PLACES=101, PETRI_TRANSITIONS=183} [2023-08-27 03:57:21,386 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 55 predicate places. [2023-08-27 03:57:21,386 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 183 transitions, 2203 flow [2023-08-27 03:57:21,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.28571428571429) internal successors, (751), 7 states have internal predecessors, (751), 0 states have call successors, (0), 0 states 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:57:21,387 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:21,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:57:21,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:57:21,387 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:57:21,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash 671255334, now seen corresponding path program 1 times [2023-08-27 03:57:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:21,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073090259] [2023-08-27 03:57:21,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:22,452 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:57:22,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:22,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073090259] [2023-08-27 03:57:22,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073090259] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:22,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:22,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:57:22,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141060133] [2023-08-27 03:57:22,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:22,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:57:22,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:22,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:57:22,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:57:22,454 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 294 [2023-08-27 03:57:22,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 183 transitions, 2203 flow. Second operand has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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:57:22,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:22,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 294 [2023-08-27 03:57:22,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:29,863 INFO L124 PetriNetUnfolderBase]: 34498/52298 cut-off events. [2023-08-27 03:57:29,864 INFO L125 PetriNetUnfolderBase]: For 403279/403772 co-relation queries the response was YES. [2023-08-27 03:57:30,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298843 conditions, 52298 events. 34498/52298 cut-off events. For 403279/403772 co-relation queries the response was YES. Maximal size of possible extension queue 3154. Compared 406999 event pairs, 12446 based on Foata normal form. 232/51664 useless extension candidates. Maximal degree in co-relation 298796. Up to 44303 conditions per place. [2023-08-27 03:57:30,304 INFO L140 encePairwiseOnDemand]: 289/294 looper letters, 227 selfloop transitions, 78 changer transitions 0/307 dead transitions. [2023-08-27 03:57:30,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 307 transitions, 4128 flow [2023-08-27 03:57:30,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:57:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:57:30,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 692 transitions. [2023-08-27 03:57:30,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3922902494331066 [2023-08-27 03:57:30,307 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 692 transitions. [2023-08-27 03:57:30,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 692 transitions. [2023-08-27 03:57:30,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:30,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 692 transitions. [2023-08-27 03:57:30,308 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states 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:57:30,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:57:30,310 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:57:30,310 INFO L175 Difference]: Start difference. First operand has 101 places, 183 transitions, 2203 flow. Second operand 6 states and 692 transitions. [2023-08-27 03:57:30,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 307 transitions, 4128 flow [2023-08-27 03:57:33,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 307 transitions, 4066 flow, removed 31 selfloop flow, removed 0 redundant places. [2023-08-27 03:57:33,653 INFO L231 Difference]: Finished difference. Result has 107 places, 210 transitions, 2743 flow [2023-08-27 03:57:33,654 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2743, PETRI_PLACES=107, PETRI_TRANSITIONS=210} [2023-08-27 03:57:33,654 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 61 predicate places. [2023-08-27 03:57:33,654 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 210 transitions, 2743 flow [2023-08-27 03:57:33,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.28571428571429) internal successors, (737), 7 states have internal predecessors, (737), 0 states have call successors, (0), 0 states 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:57:33,654 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:33,654 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:57:33,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:57:33,654 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:57:33,655 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:33,655 INFO L85 PathProgramCache]: Analyzing trace with hash -470966601, now seen corresponding path program 1 times [2023-08-27 03:57:33,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:33,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066687361] [2023-08-27 03:57:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:33,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:33,765 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:57:33,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:33,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066687361] [2023-08-27 03:57:33,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066687361] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:33,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:33,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:57:33,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076188611] [2023-08-27 03:57:33,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:33,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:57:33,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:33,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:57:33,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:57:33,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2023-08-27 03:57:33,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 210 transitions, 2743 flow. Second operand has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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:57:33,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:33,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2023-08-27 03:57:33,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:39,639 INFO L124 PetriNetUnfolderBase]: 26258/41612 cut-off events. [2023-08-27 03:57:39,640 INFO L125 PetriNetUnfolderBase]: For 412815/413136 co-relation queries the response was YES. [2023-08-27 03:57:39,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243163 conditions, 41612 events. 26258/41612 cut-off events. For 412815/413136 co-relation queries the response was YES. Maximal size of possible extension queue 2673. Compared 341513 event pairs, 1877 based on Foata normal form. 3139/43768 useless extension candidates. Maximal degree in co-relation 243113. Up to 16607 conditions per place. [2023-08-27 03:57:39,946 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 547 selfloop transitions, 19 changer transitions 4/572 dead transitions. [2023-08-27 03:57:39,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 572 transitions, 8965 flow [2023-08-27 03:57:39,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:57:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:57:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 967 transitions. [2023-08-27 03:57:39,948 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46987366375121475 [2023-08-27 03:57:39,948 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 967 transitions. [2023-08-27 03:57:39,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 967 transitions. [2023-08-27 03:57:39,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:39,949 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 967 transitions. [2023-08-27 03:57:39,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 138.14285714285714) internal successors, (967), 7 states have internal predecessors, (967), 0 states have call successors, (0), 0 states 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:57:39,951 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states 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:57:39,952 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 294.0) internal successors, (2352), 8 states have internal predecessors, (2352), 0 states have call successors, (0), 0 states 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:57:39,952 INFO L175 Difference]: Start difference. First operand has 107 places, 210 transitions, 2743 flow. Second operand 7 states and 967 transitions. [2023-08-27 03:57:39,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 572 transitions, 8965 flow [2023-08-27 03:57:43,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 572 transitions, 8642 flow, removed 73 selfloop flow, removed 3 redundant places. [2023-08-27 03:57:43,541 INFO L231 Difference]: Finished difference. Result has 111 places, 178 transitions, 2239 flow [2023-08-27 03:57:43,541 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2239, PETRI_PLACES=111, PETRI_TRANSITIONS=178} [2023-08-27 03:57:43,541 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 65 predicate places. [2023-08-27 03:57:43,542 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 178 transitions, 2239 flow [2023-08-27 03:57:43,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 126.4) internal successors, (632), 5 states have internal predecessors, (632), 0 states have call successors, (0), 0 states 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:57:43,542 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:43,542 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:57:43,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:57:43,542 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:57:43,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1955322073, now seen corresponding path program 1 times [2023-08-27 03:57:43,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:43,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374956681] [2023-08-27 03:57:43,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:43,697 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:57:43,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:43,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374956681] [2023-08-27 03:57:43,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374956681] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:43,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:43,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:57:43,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500111068] [2023-08-27 03:57:43,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:43,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:57:43,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:57:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:57:43,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2023-08-27 03:57:43,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 178 transitions, 2239 flow. Second operand has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states 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:57:43,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:43,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2023-08-27 03:57:43,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:57:48,684 INFO L124 PetriNetUnfolderBase]: 22662/36642 cut-off events. [2023-08-27 03:57:48,684 INFO L125 PetriNetUnfolderBase]: For 387689/387979 co-relation queries the response was YES. [2023-08-27 03:57:48,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231242 conditions, 36642 events. 22662/36642 cut-off events. For 387689/387979 co-relation queries the response was YES. Maximal size of possible extension queue 2528. Compared 307222 event pairs, 836 based on Foata normal form. 1752/37369 useless extension candidates. Maximal degree in co-relation 231189. Up to 8649 conditions per place. [2023-08-27 03:57:48,991 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 595 selfloop transitions, 28 changer transitions 4/629 dead transitions. [2023-08-27 03:57:48,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 629 transitions, 9543 flow [2023-08-27 03:57:48,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:57:48,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:57:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1240 transitions. [2023-08-27 03:57:48,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46863189720332576 [2023-08-27 03:57:48,993 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1240 transitions. [2023-08-27 03:57:48,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1240 transitions. [2023-08-27 03:57:48,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:57:48,994 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1240 transitions. [2023-08-27 03:57:48,995 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 137.77777777777777) internal successors, (1240), 9 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states 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:57:48,997 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states 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:57:48,997 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 294.0) internal successors, (2940), 10 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states 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:57:48,997 INFO L175 Difference]: Start difference. First operand has 111 places, 178 transitions, 2239 flow. Second operand 9 states and 1240 transitions. [2023-08-27 03:57:48,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 629 transitions, 9543 flow [2023-08-27 03:57:55,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 629 transitions, 9338 flow, removed 48 selfloop flow, removed 5 redundant places. [2023-08-27 03:57:55,606 INFO L231 Difference]: Finished difference. Result has 116 places, 165 transitions, 2049 flow [2023-08-27 03:57:55,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2049, PETRI_PLACES=116, PETRI_TRANSITIONS=165} [2023-08-27 03:57:55,606 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 70 predicate places. [2023-08-27 03:57:55,607 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 165 transitions, 2049 flow [2023-08-27 03:57:55,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states 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:57:55,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:57:55,607 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:57:55,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 03:57:55,607 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:57:55,607 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:57:55,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1134515140, now seen corresponding path program 1 times [2023-08-27 03:57:55,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:57:55,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918951032] [2023-08-27 03:57:55,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:57:55,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:57:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:57:55,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:57:55,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:57:55,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918951032] [2023-08-27 03:57:55,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918951032] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:57:55,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:57:55,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:57:55,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885419010] [2023-08-27 03:57:55,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:57:55,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:57:55,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:57:55,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:57:55,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:57:55,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 294 [2023-08-27 03:57:55,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 165 transitions, 2049 flow. Second operand has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:57:55,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:57:55,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 294 [2023-08-27 03:57:55,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:00,622 INFO L124 PetriNetUnfolderBase]: 22241/35303 cut-off events. [2023-08-27 03:58:00,622 INFO L125 PetriNetUnfolderBase]: For 359521/359871 co-relation queries the response was YES. [2023-08-27 03:58:00,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238704 conditions, 35303 events. 22241/35303 cut-off events. For 359521/359871 co-relation queries the response was YES. Maximal size of possible extension queue 2528. Compared 287431 event pairs, 1343 based on Foata normal form. 131/35394 useless extension candidates. Maximal degree in co-relation 238649. Up to 12300 conditions per place. [2023-08-27 03:58:00,830 INFO L140 encePairwiseOnDemand]: 285/294 looper letters, 191 selfloop transitions, 17 changer transitions 170/380 dead transitions. [2023-08-27 03:58:00,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 380 transitions, 5617 flow [2023-08-27 03:58:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:58:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:58:00,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2023-08-27 03:58:00,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4790249433106576 [2023-08-27 03:58:00,831 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 845 transitions. [2023-08-27 03:58:00,832 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 845 transitions. [2023-08-27 03:58:00,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:00,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 845 transitions. [2023-08-27 03:58:00,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 140.83333333333334) internal successors, (845), 6 states have internal predecessors, (845), 0 states have call successors, (0), 0 states 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:58:00,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:58:00,834 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 294.0) internal successors, (2058), 7 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states 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:58:00,834 INFO L175 Difference]: Start difference. First operand has 116 places, 165 transitions, 2049 flow. Second operand 6 states and 845 transitions. [2023-08-27 03:58:00,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 380 transitions, 5617 flow [2023-08-27 03:58:11,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 380 transitions, 5563 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 03:58:11,259 INFO L231 Difference]: Finished difference. Result has 111 places, 98 transitions, 1300 flow [2023-08-27 03:58:11,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=1963, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1300, PETRI_PLACES=111, PETRI_TRANSITIONS=98} [2023-08-27 03:58:11,259 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 65 predicate places. [2023-08-27 03:58:11,259 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 98 transitions, 1300 flow [2023-08-27 03:58:11,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states 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:58:11,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:11,260 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:58:11,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 03:58:11,260 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:58:11,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:11,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1205677318, now seen corresponding path program 1 times [2023-08-27 03:58:11,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:11,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548799552] [2023-08-27 03:58:11,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:11,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:11,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:11,409 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:58:11,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:11,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548799552] [2023-08-27 03:58:11,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548799552] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:11,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:11,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:58:11,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163422544] [2023-08-27 03:58:11,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:11,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:58:11,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:11,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:58:11,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:58:11,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 294 [2023-08-27 03:58:11,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 98 transitions, 1300 flow. Second operand has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:58:11,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:11,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 294 [2023-08-27 03:58:11,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:11,836 INFO L124 PetriNetUnfolderBase]: 1585/2683 cut-off events. [2023-08-27 03:58:11,836 INFO L125 PetriNetUnfolderBase]: For 30439/30470 co-relation queries the response was YES. [2023-08-27 03:58:11,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18498 conditions, 2683 events. 1585/2683 cut-off events. For 30439/30470 co-relation queries the response was YES. Maximal size of possible extension queue 197. Compared 15775 event pairs, 86 based on Foata normal form. 100/2780 useless extension candidates. Maximal degree in co-relation 18443. Up to 919 conditions per place. [2023-08-27 03:58:11,849 INFO L140 encePairwiseOnDemand]: 287/294 looper letters, 120 selfloop transitions, 17 changer transitions 90/228 dead transitions. [2023-08-27 03:58:11,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 228 transitions, 3572 flow [2023-08-27 03:58:11,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:58:11,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:58:11,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1062 transitions. [2023-08-27 03:58:11,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45153061224489793 [2023-08-27 03:58:11,851 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1062 transitions. [2023-08-27 03:58:11,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1062 transitions. [2023-08-27 03:58:11,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:11,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1062 transitions. [2023-08-27 03:58:11,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.75) internal successors, (1062), 8 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states 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:58:11,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states 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:58:11,855 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 294.0) internal successors, (2646), 9 states have internal predecessors, (2646), 0 states have call successors, (0), 0 states 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:58:11,855 INFO L175 Difference]: Start difference. First operand has 111 places, 98 transitions, 1300 flow. Second operand 8 states and 1062 transitions. [2023-08-27 03:58:11,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 228 transitions, 3572 flow [2023-08-27 03:58:11,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 228 transitions, 3018 flow, removed 120 selfloop flow, removed 23 redundant places. [2023-08-27 03:58:11,928 INFO L231 Difference]: Finished difference. Result has 88 places, 71 transitions, 726 flow [2023-08-27 03:58:11,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=726, PETRI_PLACES=88, PETRI_TRANSITIONS=71} [2023-08-27 03:58:11,929 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 42 predicate places. [2023-08-27 03:58:11,929 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 71 transitions, 726 flow [2023-08-27 03:58:11,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 126.0) internal successors, (882), 7 states have internal predecessors, (882), 0 states have call successors, (0), 0 states 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:58:11,929 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:11,929 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:11,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-27 03:58:11,929 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:58:11,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:11,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1096785870, now seen corresponding path program 1 times [2023-08-27 03:58:11,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:11,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260851093] [2023-08-27 03:58:11,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:11,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:13,645 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:58:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:13,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260851093] [2023-08-27 03:58:13,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260851093] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:13,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:13,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:58:13,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87760876] [2023-08-27 03:58:13,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:13,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 03:58:13,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:13,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 03:58:13,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-08-27 03:58:13,646 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 294 [2023-08-27 03:58:13,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 71 transitions, 726 flow. Second operand has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states 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:58:13,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:13,647 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 294 [2023-08-27 03:58:13,647 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:14,024 INFO L124 PetriNetUnfolderBase]: 1045/1723 cut-off events. [2023-08-27 03:58:14,025 INFO L125 PetriNetUnfolderBase]: For 11121/11153 co-relation queries the response was YES. [2023-08-27 03:58:14,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10427 conditions, 1723 events. 1045/1723 cut-off events. For 11121/11153 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 8438 event pairs, 302 based on Foata normal form. 24/1747 useless extension candidates. Maximal degree in co-relation 10387. Up to 1022 conditions per place. [2023-08-27 03:58:14,032 INFO L140 encePairwiseOnDemand]: 288/294 looper letters, 85 selfloop transitions, 17 changer transitions 20/123 dead transitions. [2023-08-27 03:58:14,032 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 123 transitions, 1476 flow [2023-08-27 03:58:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:58:14,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:58:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 596 transitions. [2023-08-27 03:58:14,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4054421768707483 [2023-08-27 03:58:14,034 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 596 transitions. [2023-08-27 03:58:14,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 596 transitions. [2023-08-27 03:58:14,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:14,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 596 transitions. [2023-08-27 03:58:14,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 119.2) internal successors, (596), 5 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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:58:14,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:58:14,036 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:58:14,036 INFO L175 Difference]: Start difference. First operand has 88 places, 71 transitions, 726 flow. Second operand 5 states and 596 transitions. [2023-08-27 03:58:14,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 123 transitions, 1476 flow [2023-08-27 03:58:14,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 123 transitions, 1285 flow, removed 33 selfloop flow, removed 16 redundant places. [2023-08-27 03:58:14,053 INFO L231 Difference]: Finished difference. Result has 73 places, 78 transitions, 780 flow [2023-08-27 03:58:14,053 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=619, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=780, PETRI_PLACES=73, PETRI_TRANSITIONS=78} [2023-08-27 03:58:14,054 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 27 predicate places. [2023-08-27 03:58:14,054 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 78 transitions, 780 flow [2023-08-27 03:58:14,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.55555555555556) internal successors, (1013), 9 states have internal predecessors, (1013), 0 states have call successors, (0), 0 states 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:58:14,054 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:14,054 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:14,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-27 03:58:14,054 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:58:14,054 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:14,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1792017442, now seen corresponding path program 2 times [2023-08-27 03:58:14,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:14,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038239983] [2023-08-27 03:58:14,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:14,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:14,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:58:15,503 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:58:15,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:58:15,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038239983] [2023-08-27 03:58:15,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038239983] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:58:15,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:58:15,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-08-27 03:58:15,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159915966] [2023-08-27 03:58:15,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:58:15,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-27 03:58:15,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:58:15,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-27 03:58:15,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-08-27 03:58:15,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 294 [2023-08-27 03:58:15,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 78 transitions, 780 flow. Second operand has 11 states, 11 states have (on average 106.0909090909091) internal successors, (1167), 11 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states 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:58:15,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:58:15,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 294 [2023-08-27 03:58:15,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:58:15,797 INFO L124 PetriNetUnfolderBase]: 1009/1669 cut-off events. [2023-08-27 03:58:15,797 INFO L125 PetriNetUnfolderBase]: For 9522/9552 co-relation queries the response was YES. [2023-08-27 03:58:15,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9221 conditions, 1669 events. 1009/1669 cut-off events. For 9522/9552 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 8187 event pairs, 270 based on Foata normal form. 21/1689 useless extension candidates. Maximal degree in co-relation 9190. Up to 722 conditions per place. [2023-08-27 03:58:15,802 INFO L140 encePairwiseOnDemand]: 290/294 looper letters, 61 selfloop transitions, 11 changer transitions 48/121 dead transitions. [2023-08-27 03:58:15,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 121 transitions, 1327 flow [2023-08-27 03:58:15,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:58:15,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:58:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2023-08-27 03:58:15,803 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38503401360544215 [2023-08-27 03:58:15,803 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2023-08-27 03:58:15,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2023-08-27 03:58:15,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:58:15,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2023-08-27 03:58:15,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:58:15,805 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:58:15,805 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 294.0) internal successors, (1764), 6 states have internal predecessors, (1764), 0 states have call successors, (0), 0 states 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:58:15,805 INFO L175 Difference]: Start difference. First operand has 73 places, 78 transitions, 780 flow. Second operand 5 states and 566 transitions. [2023-08-27 03:58:15,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 121 transitions, 1327 flow [2023-08-27 03:58:15,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 1272 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-08-27 03:58:15,822 INFO L231 Difference]: Finished difference. Result has 75 places, 63 transitions, 622 flow [2023-08-27 03:58:15,822 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=294, PETRI_DIFFERENCE_MINUEND_FLOW=728, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=622, PETRI_PLACES=75, PETRI_TRANSITIONS=63} [2023-08-27 03:58:15,822 INFO L281 CegarLoopForPetriNet]: 46 programPoint places, 29 predicate places. [2023-08-27 03:58:15,822 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 63 transitions, 622 flow [2023-08-27 03:58:15,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 106.0909090909091) internal successors, (1167), 11 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states 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:58:15,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:58:15,822 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:15,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-08-27 03:58:15,823 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-27 03:58:15,823 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:58:15,823 INFO L85 PathProgramCache]: Analyzing trace with hash -59604748, now seen corresponding path program 3 times [2023-08-27 03:58:15,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:58:15,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036722122] [2023-08-27 03:58:15,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:58:15,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:58:15,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:58:15,872 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:58:15,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:58:15,947 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:58:15,947 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:58:15,947 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (20 of 21 remaining) [2023-08-27 03:58:15,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2023-08-27 03:58:15,949 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2023-08-27 03:58:15,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2023-08-27 03:58:15,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2023-08-27 03:58:15,951 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2023-08-27 03:58:15,952 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2023-08-27 03:58:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2023-08-27 03:58:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2023-08-27 03:58:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2023-08-27 03:58:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2023-08-27 03:58:15,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2023-08-27 03:58:15,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-08-27 03:58:15,953 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:58:15,957 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:58:15,957 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:58:16,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:58:16 BasicIcfg [2023-08-27 03:58:16,036 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:58:16,036 INFO L158 Benchmark]: Toolchain (without parser) took 128246.21ms. Allocated memory was 421.5MB in the beginning and 11.1GB in the end (delta: 10.7GB). Free memory was 395.4MB in the beginning and 6.6GB in the end (delta: -6.2GB). Peak memory consumption was 4.6GB. Max. memory is 16.0GB. [2023-08-27 03:58:16,036 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 421.5MB. Free memory was 399.7MB in the beginning and 399.7MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:58:16,036 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.67ms. Allocated memory is still 421.5MB. Free memory was 395.1MB in the beginning and 370.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-27 03:58:16,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.81ms. Allocated memory is still 421.5MB. Free memory was 370.0MB in the beginning and 367.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:58:16,036 INFO L158 Benchmark]: Boogie Preprocessor took 37.92ms. Allocated memory is still 421.5MB. Free memory was 367.3MB in the beginning and 365.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:58:16,037 INFO L158 Benchmark]: RCFGBuilder took 703.98ms. Allocated memory was 421.5MB in the beginning and 549.5MB in the end (delta: 127.9MB). Free memory was 365.2MB in the beginning and 498.1MB in the end (delta: -132.9MB). Peak memory consumption was 58.5MB. Max. memory is 16.0GB. [2023-08-27 03:58:16,037 INFO L158 Benchmark]: TraceAbstraction took 126974.20ms. Allocated memory was 549.5MB in the beginning and 11.1GB in the end (delta: 10.6GB). Free memory was 498.1MB in the beginning and 6.6GB in the end (delta: -6.1GB). Peak memory consumption was 4.5GB. Max. memory is 16.0GB. [2023-08-27 03:58:16,038 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 421.5MB. Free memory was 399.7MB in the beginning and 399.7MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 470.67ms. Allocated memory is still 421.5MB. Free memory was 395.1MB in the beginning and 370.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 54.81ms. Allocated memory is still 421.5MB. Free memory was 370.0MB in the beginning and 367.3MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.92ms. Allocated memory is still 421.5MB. Free memory was 367.3MB in the beginning and 365.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 703.98ms. Allocated memory was 421.5MB in the beginning and 549.5MB in the end (delta: 127.9MB). Free memory was 365.2MB in the beginning and 498.1MB in the end (delta: -132.9MB). Peak memory consumption was 58.5MB. Max. memory is 16.0GB. * TraceAbstraction took 126974.20ms. Allocated memory was 549.5MB in the beginning and 11.1GB in the end (delta: 10.6GB). Free memory was 498.1MB in the beginning and 6.6GB in the end (delta: -6.1GB). Peak memory consumption was 4.5GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 162 PlacesBefore, 46 PlacesAfterwards, 152 TransitionsBefore, 33 TransitionsAfterwards, 3812 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 3 ChoiceCompositions, 138 TotalNumberOfCompositions, 13047 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4125, independent: 3790, independent conditional: 0, independent unconditional: 3790, dependent: 335, dependent conditional: 0, dependent unconditional: 335, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2013, independent: 1938, independent conditional: 0, independent unconditional: 1938, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4125, independent: 1852, independent conditional: 0, independent unconditional: 1852, dependent: 260, dependent conditional: 0, dependent unconditional: 260, unknown: 2013, unknown conditional: 0, unknown unconditional: 2013] , Statistics on independence cache: Total cache size (in pairs): 154, Positive cache size: 128, Positive conditional cache size: 0, Positive unconditional cache size: 128, 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: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L715] 0 int __unbuffered_p0_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L718] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L719] 0 int __unbuffered_p2_EAX$mem_tmp; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd4; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L727] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L728] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L729] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd4; [L730] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L731] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L732] 0 int __unbuffered_p2_EAX$w_buff0; [L733] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L734] 0 int __unbuffered_p2_EAX$w_buff1; [L735] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L740] 0 _Bool x$flush_delayed; [L741] 0 int x$mem_tmp; [L742] 0 _Bool x$r_buff0_thd0; [L743] 0 _Bool x$r_buff0_thd1; [L744] 0 _Bool x$r_buff0_thd2; [L745] 0 _Bool x$r_buff0_thd3; [L746] 0 _Bool x$r_buff0_thd4; [L747] 0 _Bool x$r_buff1_thd0; [L748] 0 _Bool x$r_buff1_thd1; [L749] 0 _Bool x$r_buff1_thd2; [L750] 0 _Bool x$r_buff1_thd3; [L751] 0 _Bool x$r_buff1_thd4; [L752] 0 _Bool x$read_delayed; [L753] 0 int *x$read_delayed_var; [L754] 0 int x$w_buff0; [L755] 0 _Bool x$w_buff0_used; [L756] 0 int x$w_buff1; [L757] 0 _Bool x$w_buff1_used; [L759] 0 int y = 0; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L871] 0 pthread_t t2245; [L872] FCALL, FORK 0 pthread_create(&t2245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2245, ((void *)0), P0, ((void *)0))=-2, t2245={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L873] 0 pthread_t t2246; [L874] FCALL, FORK 0 pthread_create(&t2246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2246, ((void *)0), P1, ((void *)0))=-1, t2245={6:0}, t2246={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L875] 0 pthread_t t2247; [L876] FCALL, FORK 0 pthread_create(&t2247, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2247, ((void *)0), P2, ((void *)0))=0, t2245={6:0}, t2246={7:0}, t2247={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L877] 0 pthread_t t2248; [L811] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 3 x$flush_delayed = weak$$choice2 [L814] EXPR 3 \read(x) [L814] 3 x$mem_tmp = x [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] EXPR 3 \read(x) [L815] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L815] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L816] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L817] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L818] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L819] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L821] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L822] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L823] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L824] EXPR 3 \read(x) [L824] 3 __unbuffered_p2_EAX = x [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] EXPR 3 \read(x) [L825] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L825] 3 x = x$flush_delayed ? x$mem_tmp : x [L826] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L829] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 \read(x) [L832] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L833] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L834] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L835] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L836] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L878] FCALL, FORK 0 pthread_create(&t2248, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2248, ((void *)0), P3, ((void *)0))=1, t2245={6:0}, t2246={7:0}, t2247={8:0}, t2248={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=1] [L846] 4 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L766] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L769] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 1 x$flush_delayed = weak$$choice2 [L772] EXPR 1 \read(x) [L772] 1 x$mem_tmp = x [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] EXPR 1 \read(x) [L773] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L773] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L774] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L775] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L776] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L777] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L778] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L779] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 1 \read(x) [L780] 1 __unbuffered_p0_EBX = x [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] EXPR 1 \read(x) [L781] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L781] 1 x = x$flush_delayed ? x$mem_tmp : x [L782] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L794] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 \read(x) [L797] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L797] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L797] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L798] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L799] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L800] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L801] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L804] EXPR 2 __unbuffered_cnt + 1 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L839] EXPR 3 __unbuffered_cnt + 1 [L839] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 3 return 0; [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 \read(x) [L849] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L849] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L849] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L850] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L851] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L852] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L853] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L856] EXPR 4 __unbuffered_cnt + 1 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L787] EXPR 1 __unbuffered_cnt + 1 [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L884] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L884] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L885] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L886] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L887] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L888] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2245={6:0}, t2246={7:0}, t2247={8:0}, t2248={5:0}, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] [L891] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L892] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L892] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L892] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L893] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe019_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff0_thd4=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$r_buff1_thd4=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=2] - UnprovableResult [Line: 787]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 787]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 804]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - 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, 195 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 126.8s, OverallIterations: 24, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 110.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 909 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 909 mSDsluCounter, 9 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 251 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2851 IncrementalHoareTripleChecker+Invalid, 3102 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 251 mSolverCounterUnsat, 7 mSDtfsCounter, 2851 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2743occurred in iteration=17, InterpolantAutomatonStates: 120, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.6s InterpolantComputationTime, 377 NumberOfCodeBlocks, 377 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 330 ConstructedInterpolants, 0 QuantifiedInterpolants, 5762 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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:58:16,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...