/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/mix023_tso.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:43:01,701 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:43:01,762 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:43:01,767 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:43:01,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:43:01,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:43:01,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:43:01,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:43:01,791 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:43:01,793 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:43:01,793 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:43:01,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:43:01,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:43:01,795 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:43:01,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:43:01,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:43:01,795 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:43:01,795 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:43:01,795 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:43:01,796 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:43:01,796 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:43:01,796 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:43:01,797 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:43:01,797 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:43:01,797 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:43:01,797 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:43:01,797 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:43:01,797 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:43:01,798 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:43:01,798 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:43:01,798 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:43:01,799 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:43:01,799 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:43:01,799 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:43:01,799 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:43:01,799 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:43:02,008 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:43:02,020 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:43:02,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:43:02,022 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:43:02,022 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:43:02,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-08-27 03:43:02,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:43:03,167 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:43:03,167 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix023_tso.i [2023-08-27 03:43:03,190 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266d85546/cea3604e6ccd4bcdb930fad7fa0d65f5/FLAG328e96d4c [2023-08-27 03:43:03,461 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/266d85546/cea3604e6ccd4bcdb930fad7fa0d65f5 [2023-08-27 03:43:03,463 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:43:03,464 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:43:03,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:43:03,465 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:43:03,467 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:43:03,467 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:43:03" (1/1) ... [2023-08-27 03:43:03,468 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ac387ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:03, skipping insertion in model container [2023-08-27 03:43:03,468 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:43:03" (1/1) ... [2023-08-27 03:43:03,510 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:43:03,879 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:43:03,897 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:43:03,924 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:43:03,925 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:43:03,977 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:43:04,004 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:43:04,005 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:43:04,009 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:43:04,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04 WrapperNode [2023-08-27 03:43:04,010 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:43:04,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:43:04,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:43:04,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:43:04,016 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:43:04" (1/1) ... [2023-08-27 03:43:04,046 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:43:04" (1/1) ... [2023-08-27 03:43:04,088 INFO L138 Inliner]: procedures = 177, calls = 73, calls flagged for inlining = 7, calls inlined = 9, statements flattened = 295 [2023-08-27 03:43:04,088 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:43:04,089 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:43:04,089 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:43:04,089 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:43:04,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (1/1) ... [2023-08-27 03:43:04,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (1/1) ... [2023-08-27 03:43:04,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (1/1) ... [2023-08-27 03:43:04,111 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (1/1) ... [2023-08-27 03:43:04,120 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (1/1) ... [2023-08-27 03:43:04,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (1/1) ... [2023-08-27 03:43:04,124 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (1/1) ... [2023-08-27 03:43:04,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (1/1) ... [2023-08-27 03:43:04,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:43:04,130 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:43:04,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:43:04,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:43:04,130 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (1/1) ... [2023-08-27 03:43:04,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:43:04,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:43:04,177 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:43:04,185 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:43:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:43:04,208 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:43:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:43:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:43:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:43:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:43:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:43:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:43:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:43:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:43:04,209 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:43:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:43:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:43:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:43:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:43:04,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:43:04,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:43:04,213 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:43:04,326 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:43:04,328 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:43:04,752 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:43:04,924 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:43:04,925 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:43:04,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:43:04 BoogieIcfgContainer [2023-08-27 03:43:04,928 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:43:04,930 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:43:04,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:43:04,933 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:43:04,933 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:43:03" (1/3) ... [2023-08-27 03:43:04,933 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4d7653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:43:04, skipping insertion in model container [2023-08-27 03:43:04,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:43:04" (2/3) ... [2023-08-27 03:43:04,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b4d7653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:43:04, skipping insertion in model container [2023-08-27 03:43:04,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:43:04" (3/3) ... [2023-08-27 03:43:04,935 INFO L112 eAbstractionObserver]: Analyzing ICFG mix023_tso.i [2023-08-27 03:43:04,949 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:43:04,949 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-08-27 03:43:04,950 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:43:05,030 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:43:05,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 173 places, 163 transitions, 346 flow [2023-08-27 03:43:05,142 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2023-08-27 03:43:05,142 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:43:05,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-08-27 03:43:05,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 173 places, 163 transitions, 346 flow [2023-08-27 03:43:05,154 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 159 transitions, 330 flow [2023-08-27 03:43:05,157 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:43:05,169 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 169 places, 159 transitions, 330 flow [2023-08-27 03:43:05,171 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 169 places, 159 transitions, 330 flow [2023-08-27 03:43:05,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 169 places, 159 transitions, 330 flow [2023-08-27 03:43:05,205 INFO L124 PetriNetUnfolderBase]: 3/159 cut-off events. [2023-08-27 03:43:05,206 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:43:05,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 172 conditions, 159 events. 3/159 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 117 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 102. Up to 2 conditions per place. [2023-08-27 03:43:05,211 INFO L119 LiptonReduction]: Number of co-enabled transitions 4808 [2023-08-27 03:43:10,239 INFO L134 LiptonReduction]: Checked pairs total: 18731 [2023-08-27 03:43:10,239 INFO L136 LiptonReduction]: Total number of compositions: 136 [2023-08-27 03:43:10,251 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:43:10,256 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;@2ca06801, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:43:10,256 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-08-27 03:43:10,259 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:43:10,259 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-27 03:43:10,259 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:43:10,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:10,260 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:43:10,260 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:10,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:10,263 INFO L85 PathProgramCache]: Analyzing trace with hash 835619122, now seen corresponding path program 1 times [2023-08-27 03:43:10,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:10,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674700986] [2023-08-27 03:43:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:10,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:10,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:10,547 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:43:10,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:10,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674700986] [2023-08-27 03:43:10,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674700986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:10,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:10,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:43:10,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046074517] [2023-08-27 03:43:10,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:10,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:43:10,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:10,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:43:10,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:43:10,569 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 299 [2023-08-27 03:43:10,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:10,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:10,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 299 [2023-08-27 03:43:10,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:13,430 INFO L124 PetriNetUnfolderBase]: 20517/28982 cut-off events. [2023-08-27 03:43:13,430 INFO L125 PetriNetUnfolderBase]: For 166/166 co-relation queries the response was YES. [2023-08-27 03:43:13,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56548 conditions, 28982 events. 20517/28982 cut-off events. For 166/166 co-relation queries the response was YES. Maximal size of possible extension queue 1208. Compared 181022 event pairs, 7212 based on Foata normal form. 0/22337 useless extension candidates. Maximal degree in co-relation 56536. Up to 23566 conditions per place. [2023-08-27 03:43:13,569 INFO L140 encePairwiseOnDemand]: 295/299 looper letters, 53 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-27 03:43:13,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 254 flow [2023-08-27 03:43:13,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:43:13,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:43:13,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 460 transitions. [2023-08-27 03:43:13,582 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5128205128205128 [2023-08-27 03:43:13,582 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 460 transitions. [2023-08-27 03:43:13,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 460 transitions. [2023-08-27 03:43:13,585 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:13,586 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 460 transitions. [2023-08-27 03:43:13,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 153.33333333333334) internal successors, (460), 3 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:13,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:13,593 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:13,594 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 3 states and 460 transitions. [2023-08-27 03:43:13,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 254 flow [2023-08-27 03:43:13,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 63 transitions, 248 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:43:13,600 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 92 flow [2023-08-27 03:43:13,601 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-27 03:43:13,604 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -3 predicate places. [2023-08-27 03:43:13,604 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 92 flow [2023-08-27 03:43:13,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.66666666666666) internal successors, (407), 3 states have internal predecessors, (407), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:13,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:13,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:43:13,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:43:13,605 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:13,610 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:13,610 INFO L85 PathProgramCache]: Analyzing trace with hash 132378398, now seen corresponding path program 1 times [2023-08-27 03:43:13,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:13,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291846371] [2023-08-27 03:43:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:13,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:13,672 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:43:13,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:13,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291846371] [2023-08-27 03:43:13,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291846371] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:13,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:13,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:43:13,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258883274] [2023-08-27 03:43:13,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:13,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:43:13,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:13,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:43:13,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:43:13,676 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-08-27 03:43:13,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:13,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:13,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-08-27 03:43:13,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:16,531 INFO L124 PetriNetUnfolderBase]: 20517/27516 cut-off events. [2023-08-27 03:43:16,532 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2023-08-27 03:43:16,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56190 conditions, 27516 events. 20517/27516 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 151514 event pairs, 20517 based on Foata normal form. 0/20724 useless extension candidates. Maximal degree in co-relation 56180. Up to 27188 conditions per place. [2023-08-27 03:43:16,719 INFO L140 encePairwiseOnDemand]: 294/299 looper letters, 31 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2023-08-27 03:43:16,719 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 148 flow [2023-08-27 03:43:16,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:43:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:43:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2023-08-27 03:43:16,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47157190635451507 [2023-08-27 03:43:16,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2023-08-27 03:43:16,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2023-08-27 03:43:16,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:16,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2023-08-27 03:43:16,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:16,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:16,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:16,725 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 92 flow. Second operand 3 states and 423 transitions. [2023-08-27 03:43:16,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 148 flow [2023-08-27 03:43:16,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:43:16,727 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 82 flow [2023-08-27 03:43:16,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2023-08-27 03:43:16,729 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -7 predicate places. [2023-08-27 03:43:16,730 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 82 flow [2023-08-27 03:43:16,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:16,730 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:16,734 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:43:16,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:43:16,734 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:16,735 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:16,735 INFO L85 PathProgramCache]: Analyzing trace with hash 132378399, now seen corresponding path program 1 times [2023-08-27 03:43:16,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:16,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165677293] [2023-08-27 03:43:16,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:16,783 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:43:16,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:16,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165677293] [2023-08-27 03:43:16,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165677293] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:16,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:16,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:43:16,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055577186] [2023-08-27 03:43:16,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:16,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:43:16,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:16,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:43:16,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:43:16,786 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-08-27 03:43:16,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:16,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:16,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-08-27 03:43:16,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:18,556 INFO L124 PetriNetUnfolderBase]: 13319/18176 cut-off events. [2023-08-27 03:43:18,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:43:18,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36530 conditions, 18176 events. 13319/18176 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 100712 event pairs, 3947 based on Foata normal form. 0/14684 useless extension candidates. Maximal degree in co-relation 36524. Up to 13779 conditions per place. [2023-08-27 03:43:18,655 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 53 selfloop transitions, 5 changer transitions 0/62 dead transitions. [2023-08-27 03:43:18,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 62 transitions, 256 flow [2023-08-27 03:43:18,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:43:18,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:43:18,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2023-08-27 03:43:18,657 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5005574136008919 [2023-08-27 03:43:18,657 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2023-08-27 03:43:18,657 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2023-08-27 03:43:18,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:18,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2023-08-27 03:43:18,658 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:18,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:18,660 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:18,660 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 82 flow. Second operand 3 states and 449 transitions. [2023-08-27 03:43:18,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 62 transitions, 256 flow [2023-08-27 03:43:18,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 62 transitions, 255 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:43:18,661 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 120 flow [2023-08-27 03:43:18,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-27 03:43:18,662 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-08-27 03:43:18,662 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 120 flow [2023-08-27 03:43:18,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:18,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:18,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:18,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:43:18,662 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:18,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:18,663 INFO L85 PathProgramCache]: Analyzing trace with hash 777487763, now seen corresponding path program 1 times [2023-08-27 03:43:18,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:18,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360546782] [2023-08-27 03:43:18,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:18,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:18,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:18,739 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:43:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360546782] [2023-08-27 03:43:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360546782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:18,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:18,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:43:18,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681063422] [2023-08-27 03:43:18,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:18,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:43:18,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:18,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:43:18,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:43:18,743 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 299 [2023-08-27 03:43:18,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:18,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:18,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 299 [2023-08-27 03:43:18,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:20,283 INFO L124 PetriNetUnfolderBase]: 11391/16180 cut-off events. [2023-08-27 03:43:20,283 INFO L125 PetriNetUnfolderBase]: For 1485/1485 co-relation queries the response was YES. [2023-08-27 03:43:20,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37876 conditions, 16180 events. 11391/16180 cut-off events. For 1485/1485 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 95854 event pairs, 1789 based on Foata normal form. 0/13652 useless extension candidates. Maximal degree in co-relation 37868. Up to 12789 conditions per place. [2023-08-27 03:43:20,405 INFO L140 encePairwiseOnDemand]: 296/299 looper letters, 54 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-08-27 03:43:20,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 293 flow [2023-08-27 03:43:20,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:43:20,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:43:20,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2023-08-27 03:43:20,407 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5039018952062431 [2023-08-27 03:43:20,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 452 transitions. [2023-08-27 03:43:20,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 452 transitions. [2023-08-27 03:43:20,408 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:20,408 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 452 transitions. [2023-08-27 03:43:20,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 150.66666666666666) internal successors, (452), 3 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:20,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:20,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 299.0) internal successors, (1196), 4 states have internal predecessors, (1196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:20,411 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 120 flow. Second operand 3 states and 452 transitions. [2023-08-27 03:43:20,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 293 flow [2023-08-27 03:43:20,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 285 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:43:20,416 INFO L231 Difference]: Finished difference. Result has 49 places, 39 transitions, 117 flow [2023-08-27 03:43:20,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=47, 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=117, PETRI_PLACES=49, PETRI_TRANSITIONS=39} [2023-08-27 03:43:20,417 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-08-27 03:43:20,417 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 39 transitions, 117 flow [2023-08-27 03:43:20,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:20,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:20,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:20,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:43:20,418 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:20,418 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:20,418 INFO L85 PathProgramCache]: Analyzing trace with hash -617875270, now seen corresponding path program 1 times [2023-08-27 03:43:20,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:20,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119528469] [2023-08-27 03:43:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:20,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:20,679 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:43:20,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:20,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119528469] [2023-08-27 03:43:20,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119528469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:20,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:20,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:43:20,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123022378] [2023-08-27 03:43:20,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:20,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:43:20,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:20,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:43:20,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:43:20,681 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 299 [2023-08-27 03:43:20,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 39 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:20,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:20,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 299 [2023-08-27 03:43:20,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:22,389 INFO L124 PetriNetUnfolderBase]: 11951/16748 cut-off events. [2023-08-27 03:43:22,389 INFO L125 PetriNetUnfolderBase]: For 2418/2418 co-relation queries the response was YES. [2023-08-27 03:43:22,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39069 conditions, 16748 events. 11951/16748 cut-off events. For 2418/2418 co-relation queries the response was YES. Maximal size of possible extension queue 626. Compared 95713 event pairs, 2653 based on Foata normal form. 0/14248 useless extension candidates. Maximal degree in co-relation 39060. Up to 8237 conditions per place. [2023-08-27 03:43:22,495 INFO L140 encePairwiseOnDemand]: 294/299 looper letters, 89 selfloop transitions, 5 changer transitions 0/98 dead transitions. [2023-08-27 03:43:22,495 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 98 transitions, 485 flow [2023-08-27 03:43:22,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:43:22,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:43:22,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 742 transitions. [2023-08-27 03:43:22,500 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4963210702341137 [2023-08-27 03:43:22,501 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 742 transitions. [2023-08-27 03:43:22,501 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 742 transitions. [2023-08-27 03:43:22,501 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:22,501 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 742 transitions. [2023-08-27 03:43:22,503 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.4) internal successors, (742), 5 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:22,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:22,506 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:22,506 INFO L175 Difference]: Start difference. First operand has 49 places, 39 transitions, 117 flow. Second operand 5 states and 742 transitions. [2023-08-27 03:43:22,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 98 transitions, 485 flow [2023-08-27 03:43:22,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 98 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:43:22,515 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 147 flow [2023-08-27 03:43:22,515 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-08-27 03:43:22,517 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-08-27 03:43:22,517 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 147 flow [2023-08-27 03:43:22,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 135.0) internal successors, (540), 4 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:22,518 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:22,518 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:22,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:43:22,518 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:22,518 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:22,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1635364790, now seen corresponding path program 1 times [2023-08-27 03:43:22,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:22,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550928058] [2023-08-27 03:43:22,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:22,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:22,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:22,571 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:43:22,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:22,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550928058] [2023-08-27 03:43:22,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550928058] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:22,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:22,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:43:22,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031245315] [2023-08-27 03:43:22,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:22,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:43:22,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:22,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:43:22,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:43:22,575 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-08-27 03:43:22,575 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:22,575 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:22,575 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-08-27 03:43:22,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:23,659 INFO L124 PetriNetUnfolderBase]: 8291/11466 cut-off events. [2023-08-27 03:43:23,659 INFO L125 PetriNetUnfolderBase]: For 4475/4475 co-relation queries the response was YES. [2023-08-27 03:43:23,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28987 conditions, 11466 events. 8291/11466 cut-off events. For 4475/4475 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 62381 event pairs, 2426 based on Foata normal form. 0/10987 useless extension candidates. Maximal degree in co-relation 28974. Up to 4376 conditions per place. [2023-08-27 03:43:23,734 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 79 selfloop transitions, 9 changer transitions 0/92 dead transitions. [2023-08-27 03:43:23,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 92 transitions, 489 flow [2023-08-27 03:43:23,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:43:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:43:23,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 599 transitions. [2023-08-27 03:43:23,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5008361204013378 [2023-08-27 03:43:23,736 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 599 transitions. [2023-08-27 03:43:23,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 599 transitions. [2023-08-27 03:43:23,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:23,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 599 transitions. [2023-08-27 03:43:23,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 149.75) internal successors, (599), 4 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:23,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:23,740 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 299.0) internal successors, (1495), 5 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:23,740 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 147 flow. Second operand 4 states and 599 transitions. [2023-08-27 03:43:23,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 92 transitions, 489 flow [2023-08-27 03:43:23,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 92 transitions, 489 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:43:23,757 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 205 flow [2023-08-27 03:43:23,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=205, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-08-27 03:43:23,757 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 5 predicate places. [2023-08-27 03:43:23,757 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 205 flow [2023-08-27 03:43:23,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:23,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:23,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:23,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:43:23,758 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:23,758 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:23,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1317202849, now seen corresponding path program 1 times [2023-08-27 03:43:23,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:23,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111578419] [2023-08-27 03:43:23,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:23,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:31,910 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:43:31,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:31,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111578419] [2023-08-27 03:43:31,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111578419] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:31,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:31,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:43:31,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803996111] [2023-08-27 03:43:31,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:31,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:43:31,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:31,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:43:31,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:43:31,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 299 [2023-08-27 03:43:31,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 205 flow. Second operand has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:31,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:31,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 299 [2023-08-27 03:43:31,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:34,519 INFO L124 PetriNetUnfolderBase]: 21923/29340 cut-off events. [2023-08-27 03:43:34,520 INFO L125 PetriNetUnfolderBase]: For 28524/28524 co-relation queries the response was YES. [2023-08-27 03:43:34,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80566 conditions, 29340 events. 21923/29340 cut-off events. For 28524/28524 co-relation queries the response was YES. Maximal size of possible extension queue 767. Compared 150301 event pairs, 3750 based on Foata normal form. 658/29398 useless extension candidates. Maximal degree in co-relation 80550. Up to 14498 conditions per place. [2023-08-27 03:43:34,724 INFO L140 encePairwiseOnDemand]: 294/299 looper letters, 125 selfloop transitions, 7 changer transitions 0/132 dead transitions. [2023-08-27 03:43:34,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 132 transitions, 855 flow [2023-08-27 03:43:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:43:34,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:43:34,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-27 03:43:34,732 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43812709030100333 [2023-08-27 03:43:34,732 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-27 03:43:34,732 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-27 03:43:34,732 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:34,732 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-27 03:43:34,733 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:34,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:34,740 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:34,742 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 205 flow. Second operand 5 states and 655 transitions. [2023-08-27 03:43:34,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 132 transitions, 855 flow [2023-08-27 03:43:34,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 132 transitions, 797 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-27 03:43:34,891 INFO L231 Difference]: Finished difference. Result has 65 places, 51 transitions, 249 flow [2023-08-27 03:43:34,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=249, PETRI_PLACES=65, PETRI_TRANSITIONS=51} [2023-08-27 03:43:34,893 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 11 predicate places. [2023-08-27 03:43:34,893 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 51 transitions, 249 flow [2023-08-27 03:43:34,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:34,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:34,894 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:43:34,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:43:34,894 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:34,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:34,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1330496674, now seen corresponding path program 1 times [2023-08-27 03:43:34,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:34,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083989663] [2023-08-27 03:43:34,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:34,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:35,140 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:43:35,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:35,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083989663] [2023-08-27 03:43:35,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083989663] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:35,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:35,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:43:35,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889587317] [2023-08-27 03:43:35,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:35,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:43:35,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:35,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:43:35,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:43:35,142 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 299 [2023-08-27 03:43:35,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 51 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:35,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:35,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 299 [2023-08-27 03:43:35,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:36,146 INFO L124 PetriNetUnfolderBase]: 6767/9874 cut-off events. [2023-08-27 03:43:36,146 INFO L125 PetriNetUnfolderBase]: For 10496/10496 co-relation queries the response was YES. [2023-08-27 03:43:36,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29198 conditions, 9874 events. 6767/9874 cut-off events. For 10496/10496 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 56865 event pairs, 1338 based on Foata normal form. 452/9759 useless extension candidates. Maximal degree in co-relation 29178. Up to 7535 conditions per place. [2023-08-27 03:43:36,210 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 90 selfloop transitions, 10 changer transitions 0/104 dead transitions. [2023-08-27 03:43:36,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 104 transitions, 641 flow [2023-08-27 03:43:36,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:43:36,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:43:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 721 transitions. [2023-08-27 03:43:36,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4822742474916388 [2023-08-27 03:43:36,212 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 721 transitions. [2023-08-27 03:43:36,212 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 721 transitions. [2023-08-27 03:43:36,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:36,212 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 721 transitions. [2023-08-27 03:43:36,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.2) internal successors, (721), 5 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:36,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:36,215 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:36,215 INFO L175 Difference]: Start difference. First operand has 65 places, 51 transitions, 249 flow. Second operand 5 states and 721 transitions. [2023-08-27 03:43:36,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 104 transitions, 641 flow [2023-08-27 03:43:36,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 104 transitions, 641 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:43:36,243 INFO L231 Difference]: Finished difference. Result has 72 places, 56 transitions, 316 flow [2023-08-27 03:43:36,243 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=72, PETRI_TRANSITIONS=56} [2023-08-27 03:43:36,244 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 18 predicate places. [2023-08-27 03:43:36,244 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 56 transitions, 316 flow [2023-08-27 03:43:36,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:36,244 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:36,244 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:43:36,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:43:36,245 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:36,245 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:36,245 INFO L85 PathProgramCache]: Analyzing trace with hash -497462640, now seen corresponding path program 1 times [2023-08-27 03:43:36,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:36,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053519890] [2023-08-27 03:43:36,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:36,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:36,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:36,306 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:43:36,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:36,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053519890] [2023-08-27 03:43:36,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053519890] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:36,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:36,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:43:36,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303494510] [2023-08-27 03:43:36,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:36,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:43:36,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:36,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:43:36,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:43:36,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-08-27 03:43:36,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 56 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:36,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:36,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-08-27 03:43:36,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:37,269 INFO L124 PetriNetUnfolderBase]: 5983/8661 cut-off events. [2023-08-27 03:43:37,269 INFO L125 PetriNetUnfolderBase]: For 11407/11407 co-relation queries the response was YES. [2023-08-27 03:43:37,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26607 conditions, 8661 events. 5983/8661 cut-off events. For 11407/11407 co-relation queries the response was YES. Maximal size of possible extension queue 401. Compared 49583 event pairs, 885 based on Foata normal form. 0/8596 useless extension candidates. Maximal degree in co-relation 26582. Up to 4034 conditions per place. [2023-08-27 03:43:37,300 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 106 selfloop transitions, 17 changer transitions 0/127 dead transitions. [2023-08-27 03:43:37,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 127 transitions, 888 flow [2023-08-27 03:43:37,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:43:37,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:43:37,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 745 transitions. [2023-08-27 03:43:37,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4983277591973244 [2023-08-27 03:43:37,302 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 745 transitions. [2023-08-27 03:43:37,302 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 745 transitions. [2023-08-27 03:43:37,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:37,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 745 transitions. [2023-08-27 03:43:37,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.0) internal successors, (745), 5 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:37,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:37,305 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:37,305 INFO L175 Difference]: Start difference. First operand has 72 places, 56 transitions, 316 flow. Second operand 5 states and 745 transitions. [2023-08-27 03:43:37,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 127 transitions, 888 flow [2023-08-27 03:43:37,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 127 transitions, 874 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:43:37,334 INFO L231 Difference]: Finished difference. Result has 75 places, 60 transitions, 384 flow [2023-08-27 03:43:37,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=384, PETRI_PLACES=75, PETRI_TRANSITIONS=60} [2023-08-27 03:43:37,335 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 21 predicate places. [2023-08-27 03:43:37,335 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 60 transitions, 384 flow [2023-08-27 03:43:37,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 132.2) internal successors, (661), 5 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:37,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:37,335 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:43:37,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:43:37,335 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:37,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:37,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1597225684, now seen corresponding path program 1 times [2023-08-27 03:43:37,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:37,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225684334] [2023-08-27 03:43:37,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:37,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:37,559 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:43:37,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:37,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225684334] [2023-08-27 03:43:37,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225684334] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:37,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:37,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:43:37,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385834467] [2023-08-27 03:43:37,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:37,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:43:37,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:37,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:43:37,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:43:37,563 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 299 [2023-08-27 03:43:37,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 60 transitions, 384 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:37,564 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:37,564 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 299 [2023-08-27 03:43:37,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:38,275 INFO L124 PetriNetUnfolderBase]: 3707/5569 cut-off events. [2023-08-27 03:43:38,275 INFO L125 PetriNetUnfolderBase]: For 9081/9081 co-relation queries the response was YES. [2023-08-27 03:43:38,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18620 conditions, 5569 events. 3707/5569 cut-off events. For 9081/9081 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 31052 event pairs, 556 based on Foata normal form. 260/5762 useless extension candidates. Maximal degree in co-relation 18594. Up to 1774 conditions per place. [2023-08-27 03:43:38,305 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 110 selfloop transitions, 19 changer transitions 4/137 dead transitions. [2023-08-27 03:43:38,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 137 transitions, 952 flow [2023-08-27 03:43:38,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:43:38,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:43:38,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1008 transitions. [2023-08-27 03:43:38,307 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4816053511705686 [2023-08-27 03:43:38,308 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1008 transitions. [2023-08-27 03:43:38,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1008 transitions. [2023-08-27 03:43:38,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:38,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1008 transitions. [2023-08-27 03:43:38,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 144.0) internal successors, (1008), 7 states have internal predecessors, (1008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:38,311 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:38,312 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:38,312 INFO L175 Difference]: Start difference. First operand has 75 places, 60 transitions, 384 flow. Second operand 7 states and 1008 transitions. [2023-08-27 03:43:38,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 137 transitions, 952 flow [2023-08-27 03:43:38,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 137 transitions, 886 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 03:43:38,385 INFO L231 Difference]: Finished difference. Result has 81 places, 65 transitions, 436 flow [2023-08-27 03:43:38,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=436, PETRI_PLACES=81, PETRI_TRANSITIONS=65} [2023-08-27 03:43:38,386 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 27 predicate places. [2023-08-27 03:43:38,386 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 65 transitions, 436 flow [2023-08-27 03:43:38,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:38,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:38,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:38,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:43:38,387 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:38,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:38,387 INFO L85 PathProgramCache]: Analyzing trace with hash -747836825, now seen corresponding path program 1 times [2023-08-27 03:43:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938968510] [2023-08-27 03:43:38,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:38,642 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:43:38,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:38,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938968510] [2023-08-27 03:43:38,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938968510] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:38,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:38,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:43:38,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889338905] [2023-08-27 03:43:38,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:38,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:43:38,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:38,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:43:38,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:43:38,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 299 [2023-08-27 03:43:38,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 65 transitions, 436 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:43:38,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:38,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 299 [2023-08-27 03:43:38,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:39,301 INFO L124 PetriNetUnfolderBase]: 3074/4600 cut-off events. [2023-08-27 03:43:39,302 INFO L125 PetriNetUnfolderBase]: For 8930/8930 co-relation queries the response was YES. [2023-08-27 03:43:39,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15899 conditions, 4600 events. 3074/4600 cut-off events. For 8930/8930 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 24910 event pairs, 478 based on Foata normal form. 92/4629 useless extension candidates. Maximal degree in co-relation 15870. Up to 1052 conditions per place. [2023-08-27 03:43:39,327 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 122 selfloop transitions, 28 changer transitions 4/158 dead transitions. [2023-08-27 03:43:39,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 158 transitions, 1046 flow [2023-08-27 03:43:39,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:43:39,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:43:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1293 transitions. [2023-08-27 03:43:39,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48049052396878483 [2023-08-27 03:43:39,329 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1293 transitions. [2023-08-27 03:43:39,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1293 transitions. [2023-08-27 03:43:39,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:39,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1293 transitions. [2023-08-27 03:43:39,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 143.66666666666666) internal successors, (1293), 9 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:39,334 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:39,334 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:39,335 INFO L175 Difference]: Start difference. First operand has 81 places, 65 transitions, 436 flow. Second operand 9 states and 1293 transitions. [2023-08-27 03:43:39,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 158 transitions, 1046 flow [2023-08-27 03:43:39,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 158 transitions, 1012 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 03:43:39,428 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 492 flow [2023-08-27 03:43:39,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=492, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2023-08-27 03:43:39,428 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 34 predicate places. [2023-08-27 03:43:39,429 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 492 flow [2023-08-27 03:43:39,429 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:43:39,429 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:39,429 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:39,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:43:39,429 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:39,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1589747585, now seen corresponding path program 1 times [2023-08-27 03:43:39,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:39,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26718509] [2023-08-27 03:43:39,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:39,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:39,516 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:43:39,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:39,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26718509] [2023-08-27 03:43:39,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26718509] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:39,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:39,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:43:39,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449166421] [2023-08-27 03:43:39,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:39,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:43:39,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:43:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:43:39,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-08-27 03:43:39,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 492 flow. Second operand has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:39,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:39,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-08-27 03:43:39,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:40,121 INFO L124 PetriNetUnfolderBase]: 3052/4576 cut-off events. [2023-08-27 03:43:40,121 INFO L125 PetriNetUnfolderBase]: For 9715/9715 co-relation queries the response was YES. [2023-08-27 03:43:40,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16465 conditions, 4576 events. 3052/4576 cut-off events. For 9715/9715 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 24975 event pairs, 861 based on Foata normal form. 0/4551 useless extension candidates. Maximal degree in co-relation 16433. Up to 1844 conditions per place. [2023-08-27 03:43:40,141 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 67 selfloop transitions, 17 changer transitions 25/113 dead transitions. [2023-08-27 03:43:40,142 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 113 transitions, 862 flow [2023-08-27 03:43:40,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:43:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:43:40,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 867 transitions. [2023-08-27 03:43:40,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48327759197324416 [2023-08-27 03:43:40,144 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 867 transitions. [2023-08-27 03:43:40,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 867 transitions. [2023-08-27 03:43:40,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:40,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 867 transitions. [2023-08-27 03:43:40,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 144.5) internal successors, (867), 6 states have internal predecessors, (867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:40,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:40,147 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:40,147 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 492 flow. Second operand 6 states and 867 transitions. [2023-08-27 03:43:40,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 113 transitions, 862 flow [2023-08-27 03:43:40,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 113 transitions, 808 flow, removed 2 selfloop flow, removed 6 redundant places. [2023-08-27 03:43:40,278 INFO L231 Difference]: Finished difference. Result has 83 places, 42 transitions, 260 flow [2023-08-27 03:43:40,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=406, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=260, PETRI_PLACES=83, PETRI_TRANSITIONS=42} [2023-08-27 03:43:40,279 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2023-08-27 03:43:40,279 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 42 transitions, 260 flow [2023-08-27 03:43:40,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 132.66666666666666) internal successors, (796), 6 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:40,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:40,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:40,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:43:40,280 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:40,280 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:40,280 INFO L85 PathProgramCache]: Analyzing trace with hash -291883875, now seen corresponding path program 1 times [2023-08-27 03:43:40,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:40,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617363741] [2023-08-27 03:43:40,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:40,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:46,387 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:43:46,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:46,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617363741] [2023-08-27 03:43:46,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617363741] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:46,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:46,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:43:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280425399] [2023-08-27 03:43:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:46,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:43:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:43:46,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:43:46,389 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 299 [2023-08-27 03:43:46,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 42 transitions, 260 flow. Second operand has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:46,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:46,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 299 [2023-08-27 03:43:46,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:47,417 INFO L124 PetriNetUnfolderBase]: 3720/5468 cut-off events. [2023-08-27 03:43:47,417 INFO L125 PetriNetUnfolderBase]: For 10560/10560 co-relation queries the response was YES. [2023-08-27 03:43:47,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17426 conditions, 5468 events. 3720/5468 cut-off events. For 10560/10560 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 26042 event pairs, 664 based on Foata normal form. 13/5481 useless extension candidates. Maximal degree in co-relation 17394. Up to 3466 conditions per place. [2023-08-27 03:43:47,441 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 87 selfloop transitions, 11 changer transitions 39/137 dead transitions. [2023-08-27 03:43:47,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 137 transitions, 1023 flow [2023-08-27 03:43:47,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:43:47,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:43:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 871 transitions. [2023-08-27 03:43:47,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4161490683229814 [2023-08-27 03:43:47,443 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 871 transitions. [2023-08-27 03:43:47,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 871 transitions. [2023-08-27 03:43:47,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:47,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 871 transitions. [2023-08-27 03:43:47,445 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.42857142857143) internal successors, (871), 7 states have internal predecessors, (871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:47,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:47,447 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 299.0) internal successors, (2392), 8 states have internal predecessors, (2392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:47,447 INFO L175 Difference]: Start difference. First operand has 83 places, 42 transitions, 260 flow. Second operand 7 states and 871 transitions. [2023-08-27 03:43:47,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 137 transitions, 1023 flow [2023-08-27 03:43:47,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 137 transitions, 745 flow, removed 66 selfloop flow, removed 23 redundant places. [2023-08-27 03:43:47,499 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 234 flow [2023-08-27 03:43:47,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=234, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2023-08-27 03:43:47,499 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 6 predicate places. [2023-08-27 03:43:47,499 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 234 flow [2023-08-27 03:43:47,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.33333333333333) internal successors, (680), 6 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:47,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:47,500 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:47,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:43:47,500 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:47,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:47,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1878699083, now seen corresponding path program 2 times [2023-08-27 03:43:47,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:47,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745642579] [2023-08-27 03:43:47,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:47,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:48,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:43:48,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:48,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745642579] [2023-08-27 03:43:48,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745642579] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:48,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:48,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-08-27 03:43:48,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709123862] [2023-08-27 03:43:48,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:48,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-27 03:43:48,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:48,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-27 03:43:48,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-08-27 03:43:48,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 299 [2023-08-27 03:43:48,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 234 flow. Second operand has 10 states, 10 states have (on average 120.4) internal successors, (1204), 10 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:48,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:48,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 299 [2023-08-27 03:43:48,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:50,090 INFO L124 PetriNetUnfolderBase]: 6062/9305 cut-off events. [2023-08-27 03:43:50,091 INFO L125 PetriNetUnfolderBase]: For 8882/8882 co-relation queries the response was YES. [2023-08-27 03:43:50,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28879 conditions, 9305 events. 6062/9305 cut-off events. For 8882/8882 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 55261 event pairs, 879 based on Foata normal form. 18/9277 useless extension candidates. Maximal degree in co-relation 28861. Up to 3295 conditions per place. [2023-08-27 03:43:50,149 INFO L140 encePairwiseOnDemand]: 285/299 looper letters, 172 selfloop transitions, 62 changer transitions 24/261 dead transitions. [2023-08-27 03:43:50,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 261 transitions, 1598 flow [2023-08-27 03:43:50,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-27 03:43:50,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-27 03:43:50,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2206 transitions. [2023-08-27 03:43:50,153 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43399567184733423 [2023-08-27 03:43:50,154 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2206 transitions. [2023-08-27 03:43:50,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2206 transitions. [2023-08-27 03:43:50,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:50,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2206 transitions. [2023-08-27 03:43:50,157 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 129.76470588235293) internal successors, (2206), 17 states have internal predecessors, (2206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:50,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 299.0) internal successors, (5382), 18 states have internal predecessors, (5382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:50,162 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 299.0) internal successors, (5382), 18 states have internal predecessors, (5382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:50,162 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 234 flow. Second operand 17 states and 2206 transitions. [2023-08-27 03:43:50,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 261 transitions, 1598 flow [2023-08-27 03:43:50,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 261 transitions, 1590 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-27 03:43:50,281 INFO L231 Difference]: Finished difference. Result has 87 places, 114 transitions, 746 flow [2023-08-27 03:43:50,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=746, PETRI_PLACES=87, PETRI_TRANSITIONS=114} [2023-08-27 03:43:50,281 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 33 predicate places. [2023-08-27 03:43:50,281 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 114 transitions, 746 flow [2023-08-27 03:43:50,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 120.4) internal successors, (1204), 10 states have internal predecessors, (1204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:50,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:50,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:50,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:43:50,282 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:50,282 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:50,282 INFO L85 PathProgramCache]: Analyzing trace with hash 736057642, now seen corresponding path program 1 times [2023-08-27 03:43:50,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:50,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340334679] [2023-08-27 03:43:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:50,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:50,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:50,475 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:43:50,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:50,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340334679] [2023-08-27 03:43:50,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340334679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:50,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:50,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:43:50,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190238846] [2023-08-27 03:43:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:50,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:43:50,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:43:50,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:43:50,478 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 299 [2023-08-27 03:43:50,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 114 transitions, 746 flow. Second operand has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:50,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:50,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 299 [2023-08-27 03:43:50,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:52,015 INFO L124 PetriNetUnfolderBase]: 8568/13378 cut-off events. [2023-08-27 03:43:52,015 INFO L125 PetriNetUnfolderBase]: For 49743/50022 co-relation queries the response was YES. [2023-08-27 03:43:52,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57577 conditions, 13378 events. 8568/13378 cut-off events. For 49743/50022 co-relation queries the response was YES. Maximal size of possible extension queue 640. Compared 88932 event pairs, 1325 based on Foata normal form. 249/13374 useless extension candidates. Maximal degree in co-relation 57545. Up to 6839 conditions per place. [2023-08-27 03:43:52,082 INFO L140 encePairwiseOnDemand]: 295/299 looper letters, 161 selfloop transitions, 2 changer transitions 62/243 dead transitions. [2023-08-27 03:43:52,082 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 243 transitions, 2040 flow [2023-08-27 03:43:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:43:52,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:43:52,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2023-08-27 03:43:52,084 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47959866220735786 [2023-08-27 03:43:52,084 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 717 transitions. [2023-08-27 03:43:52,084 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 717 transitions. [2023-08-27 03:43:52,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:52,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 717 transitions. [2023-08-27 03:43:52,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.4) internal successors, (717), 5 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:52,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:52,087 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:52,087 INFO L175 Difference]: Start difference. First operand has 87 places, 114 transitions, 746 flow. Second operand 5 states and 717 transitions. [2023-08-27 03:43:52,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 243 transitions, 2040 flow [2023-08-27 03:43:52,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 243 transitions, 1956 flow, removed 42 selfloop flow, removed 1 redundant places. [2023-08-27 03:43:52,397 INFO L231 Difference]: Finished difference. Result has 91 places, 109 transitions, 679 flow [2023-08-27 03:43:52,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=712, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=679, PETRI_PLACES=91, PETRI_TRANSITIONS=109} [2023-08-27 03:43:52,398 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 37 predicate places. [2023-08-27 03:43:52,398 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 109 transitions, 679 flow [2023-08-27 03:43:52,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.8) internal successors, (669), 5 states have internal predecessors, (669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:52,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:52,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:52,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:43:52,398 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:52,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:52,399 INFO L85 PathProgramCache]: Analyzing trace with hash 115829831, now seen corresponding path program 3 times [2023-08-27 03:43:52,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:52,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668951678] [2023-08-27 03:43:52,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:52,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:52,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:52,601 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:43:52,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:52,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668951678] [2023-08-27 03:43:52,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668951678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:52,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:52,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:43:52,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607062224] [2023-08-27 03:43:52,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:52,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:43:52,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:52,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:43:52,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:43:52,606 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 299 [2023-08-27 03:43:52,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 109 transitions, 679 flow. Second operand has 7 states, 7 states have (on average 130.28571428571428) internal successors, (912), 7 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:52,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:52,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 299 [2023-08-27 03:43:52,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:53,870 INFO L124 PetriNetUnfolderBase]: 7358/11316 cut-off events. [2023-08-27 03:43:53,870 INFO L125 PetriNetUnfolderBase]: For 46852/47139 co-relation queries the response was YES. [2023-08-27 03:43:53,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50549 conditions, 11316 events. 7358/11316 cut-off events. For 46852/47139 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 75194 event pairs, 716 based on Foata normal form. 346/11285 useless extension candidates. Maximal degree in co-relation 50514. Up to 4453 conditions per place. [2023-08-27 03:43:53,918 INFO L140 encePairwiseOnDemand]: 292/299 looper letters, 109 selfloop transitions, 18 changer transitions 107/244 dead transitions. [2023-08-27 03:43:53,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 244 transitions, 2016 flow [2023-08-27 03:43:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:43:53,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:43:53,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1113 transitions. [2023-08-27 03:43:53,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4653010033444816 [2023-08-27 03:43:53,920 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1113 transitions. [2023-08-27 03:43:53,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1113 transitions. [2023-08-27 03:43:53,921 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:53,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1113 transitions. [2023-08-27 03:43:53,922 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 139.125) internal successors, (1113), 8 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:53,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:53,924 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 299.0) internal successors, (2691), 9 states have internal predecessors, (2691), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:53,924 INFO L175 Difference]: Start difference. First operand has 91 places, 109 transitions, 679 flow. Second operand 8 states and 1113 transitions. [2023-08-27 03:43:53,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 244 transitions, 2016 flow [2023-08-27 03:43:54,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 244 transitions, 1946 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-27 03:43:54,391 INFO L231 Difference]: Finished difference. Result has 96 places, 74 transitions, 488 flow [2023-08-27 03:43:54,391 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=488, PETRI_PLACES=96, PETRI_TRANSITIONS=74} [2023-08-27 03:43:54,392 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 42 predicate places. [2023-08-27 03:43:54,392 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 74 transitions, 488 flow [2023-08-27 03:43:54,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 130.28571428571428) internal successors, (912), 7 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:54,392 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:54,392 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:54,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:43:54,392 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:54,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:54,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1177037218, now seen corresponding path program 1 times [2023-08-27 03:43:54,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:54,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919735249] [2023-08-27 03:43:54,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:54,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:55,347 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:43:55,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:55,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919735249] [2023-08-27 03:43:55,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919735249] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:55,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:55,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:43:55,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943903402] [2023-08-27 03:43:55,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:55,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 03:43:55,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:55,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 03:43:55,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-27 03:43:55,349 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 299 [2023-08-27 03:43:55,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 74 transitions, 488 flow. Second operand has 9 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:55,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:55,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 299 [2023-08-27 03:43:55,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:56,145 INFO L124 PetriNetUnfolderBase]: 3912/6310 cut-off events. [2023-08-27 03:43:56,145 INFO L125 PetriNetUnfolderBase]: For 25951/26054 co-relation queries the response was YES. [2023-08-27 03:43:56,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29329 conditions, 6310 events. 3912/6310 cut-off events. For 25951/26054 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 38942 event pairs, 914 based on Foata normal form. 2/6111 useless extension candidates. Maximal degree in co-relation 29293. Up to 3620 conditions per place. [2023-08-27 03:43:56,173 INFO L140 encePairwiseOnDemand]: 291/299 looper letters, 86 selfloop transitions, 21 changer transitions 21/136 dead transitions. [2023-08-27 03:43:56,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 136 transitions, 1190 flow [2023-08-27 03:43:56,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:43:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:43:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 803 transitions. [2023-08-27 03:43:56,175 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.447603121516165 [2023-08-27 03:43:56,175 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 803 transitions. [2023-08-27 03:43:56,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 803 transitions. [2023-08-27 03:43:56,175 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:56,175 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 803 transitions. [2023-08-27 03:43:56,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:56,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:56,178 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:56,178 INFO L175 Difference]: Start difference. First operand has 96 places, 74 transitions, 488 flow. Second operand 6 states and 803 transitions. [2023-08-27 03:43:56,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 136 transitions, 1190 flow [2023-08-27 03:43:56,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 136 transitions, 1050 flow, removed 25 selfloop flow, removed 13 redundant places. [2023-08-27 03:43:56,302 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 551 flow [2023-08-27 03:43:56,303 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=551, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2023-08-27 03:43:56,303 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 29 predicate places. [2023-08-27 03:43:56,303 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 551 flow [2023-08-27 03:43:56,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:56,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:56,303 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:56,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:43:56,303 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:56,304 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:56,304 INFO L85 PathProgramCache]: Analyzing trace with hash -758076888, now seen corresponding path program 2 times [2023-08-27 03:43:56,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:56,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642165629] [2023-08-27 03:43:56,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:56,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:56,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:57,123 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:43:57,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:57,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642165629] [2023-08-27 03:43:57,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642165629] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:57,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:57,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:43:57,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925258394] [2023-08-27 03:43:57,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:57,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 03:43:57,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:57,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 03:43:57,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-08-27 03:43:57,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 299 [2023-08-27 03:43:57,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 551 flow. Second operand has 9 states, 9 states have (on average 121.11111111111111) internal successors, (1090), 9 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:57,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:57,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 299 [2023-08-27 03:43:57,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:43:58,361 INFO L124 PetriNetUnfolderBase]: 6814/11059 cut-off events. [2023-08-27 03:43:58,361 INFO L125 PetriNetUnfolderBase]: For 43967/43967 co-relation queries the response was YES. [2023-08-27 03:43:58,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50612 conditions, 11059 events. 6814/11059 cut-off events. For 43967/43967 co-relation queries the response was YES. Maximal size of possible extension queue 569. Compared 74580 event pairs, 1691 based on Foata normal form. 1/10895 useless extension candidates. Maximal degree in co-relation 50581. Up to 4931 conditions per place. [2023-08-27 03:43:58,407 INFO L140 encePairwiseOnDemand]: 290/299 looper letters, 148 selfloop transitions, 31 changer transitions 63/244 dead transitions. [2023-08-27 03:43:58,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 244 transitions, 2254 flow [2023-08-27 03:43:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:43:58,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:43:58,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1166 transitions. [2023-08-27 03:43:58,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43329617242660723 [2023-08-27 03:43:58,410 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1166 transitions. [2023-08-27 03:43:58,410 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1166 transitions. [2023-08-27 03:43:58,410 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:43:58,410 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1166 transitions. [2023-08-27 03:43:58,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 129.55555555555554) internal successors, (1166), 9 states have internal predecessors, (1166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:58,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:58,414 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 299.0) internal successors, (2990), 10 states have internal predecessors, (2990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:58,414 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 551 flow. Second operand 9 states and 1166 transitions. [2023-08-27 03:43:58,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 244 transitions, 2254 flow [2023-08-27 03:43:58,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 244 transitions, 2231 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-08-27 03:43:58,805 INFO L231 Difference]: Finished difference. Result has 92 places, 97 transitions, 826 flow [2023-08-27 03:43:58,805 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=540, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=826, PETRI_PLACES=92, PETRI_TRANSITIONS=97} [2023-08-27 03:43:58,805 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 38 predicate places. [2023-08-27 03:43:58,805 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 97 transitions, 826 flow [2023-08-27 03:43:58,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 121.11111111111111) internal successors, (1090), 9 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:58,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:43:58,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:43:58,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:43:58,806 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:43:58,806 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:43:58,806 INFO L85 PathProgramCache]: Analyzing trace with hash 856279446, now seen corresponding path program 3 times [2023-08-27 03:43:58,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:43:58,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076012196] [2023-08-27 03:43:58,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:43:58,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:43:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:43:59,655 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:43:59,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:43:59,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076012196] [2023-08-27 03:43:59,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076012196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:43:59,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:43:59,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:43:59,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731706147] [2023-08-27 03:43:59,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:43:59,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 03:43:59,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:43:59,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 03:43:59,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-08-27 03:43:59,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 299 [2023-08-27 03:43:59,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 97 transitions, 826 flow. Second operand has 9 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:43:59,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:43:59,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 299 [2023-08-27 03:43:59,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:44:01,014 INFO L124 PetriNetUnfolderBase]: 6915/11530 cut-off events. [2023-08-27 03:44:01,015 INFO L125 PetriNetUnfolderBase]: For 63372/63644 co-relation queries the response was YES. [2023-08-27 03:44:01,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57071 conditions, 11530 events. 6915/11530 cut-off events. For 63372/63644 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 83828 event pairs, 1646 based on Foata normal form. 85/11290 useless extension candidates. Maximal degree in co-relation 57036. Up to 6880 conditions per place. [2023-08-27 03:44:01,079 INFO L140 encePairwiseOnDemand]: 291/299 looper letters, 100 selfloop transitions, 29 changer transitions 29/170 dead transitions. [2023-08-27 03:44:01,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 170 transitions, 1683 flow [2023-08-27 03:44:01,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:44:01,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:44:01,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 802 transitions. [2023-08-27 03:44:01,080 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44704570791527315 [2023-08-27 03:44:01,080 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 802 transitions. [2023-08-27 03:44:01,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 802 transitions. [2023-08-27 03:44:01,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:44:01,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 802 transitions. [2023-08-27 03:44:01,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:01,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:01,083 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 299.0) internal successors, (2093), 7 states have internal predecessors, (2093), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:01,083 INFO L175 Difference]: Start difference. First operand has 92 places, 97 transitions, 826 flow. Second operand 6 states and 802 transitions. [2023-08-27 03:44:01,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 170 transitions, 1683 flow [2023-08-27 03:44:01,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 170 transitions, 1648 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 03:44:01,660 INFO L231 Difference]: Finished difference. Result has 95 places, 108 transitions, 1032 flow [2023-08-27 03:44:01,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1032, PETRI_PLACES=95, PETRI_TRANSITIONS=108} [2023-08-27 03:44:01,661 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 41 predicate places. [2023-08-27 03:44:01,661 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 108 transitions, 1032 flow [2023-08-27 03:44:01,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:01,661 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:44:01,661 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:44:01,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 03:44:01,662 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:44:01,662 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:44:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1455399546, now seen corresponding path program 4 times [2023-08-27 03:44:01,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:44:01,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235878729] [2023-08-27 03:44:01,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:44:01,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:44:01,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:44:02,710 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:44:02,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:44:02,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235878729] [2023-08-27 03:44:02,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235878729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:44:02,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:44:02,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 03:44:02,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586828717] [2023-08-27 03:44:02,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:44:02,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 03:44:02,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:44:02,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 03:44:02,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-08-27 03:44:02,712 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 299 [2023-08-27 03:44:02,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 108 transitions, 1032 flow. Second operand has 9 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:02,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:44:02,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 299 [2023-08-27 03:44:02,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:44:03,988 INFO L124 PetriNetUnfolderBase]: 6949/11658 cut-off events. [2023-08-27 03:44:03,989 INFO L125 PetriNetUnfolderBase]: For 74172/74469 co-relation queries the response was YES. [2023-08-27 03:44:04,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60926 conditions, 11658 events. 6949/11658 cut-off events. For 74172/74469 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 85535 event pairs, 2549 based on Foata normal form. 107/11452 useless extension candidates. Maximal degree in co-relation 60889. Up to 5714 conditions per place. [2023-08-27 03:44:04,042 INFO L140 encePairwiseOnDemand]: 293/299 looper letters, 91 selfloop transitions, 21 changer transitions 30/154 dead transitions. [2023-08-27 03:44:04,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 154 transitions, 1691 flow [2023-08-27 03:44:04,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:44:04,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:44:04,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 663 transitions. [2023-08-27 03:44:04,043 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434782608695652 [2023-08-27 03:44:04,043 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 663 transitions. [2023-08-27 03:44:04,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 663 transitions. [2023-08-27 03:44:04,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:44:04,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 663 transitions. [2023-08-27 03:44:04,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.6) internal successors, (663), 5 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:04,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:04,046 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 299.0) internal successors, (1794), 6 states have internal predecessors, (1794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:04,046 INFO L175 Difference]: Start difference. First operand has 95 places, 108 transitions, 1032 flow. Second operand 5 states and 663 transitions. [2023-08-27 03:44:04,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 154 transitions, 1691 flow [2023-08-27 03:44:04,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 154 transitions, 1668 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-08-27 03:44:04,646 INFO L231 Difference]: Finished difference. Result has 97 places, 111 transitions, 1135 flow [2023-08-27 03:44:04,646 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=299, PETRI_DIFFERENCE_MINUEND_FLOW=1013, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1135, PETRI_PLACES=97, PETRI_TRANSITIONS=111} [2023-08-27 03:44:04,646 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 43 predicate places. [2023-08-27 03:44:04,646 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 111 transitions, 1135 flow [2023-08-27 03:44:04,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 126.0) internal successors, (1134), 9 states have internal predecessors, (1134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:44:04,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:44:04,647 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:44:04,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 03:44:04,647 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 21 more)] === [2023-08-27 03:44:04,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:44:04,647 INFO L85 PathProgramCache]: Analyzing trace with hash 907552940, now seen corresponding path program 5 times [2023-08-27 03:44:04,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:44:04,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148601256] [2023-08-27 03:44:04,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:44:04,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:44:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:44:04,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:44:04,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:44:04,783 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:44:04,783 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:44:04,783 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (24 of 25 remaining) [2023-08-27 03:44:04,784 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 25 remaining) [2023-08-27 03:44:04,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 25 remaining) [2023-08-27 03:44:04,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (21 of 25 remaining) [2023-08-27 03:44:04,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 25 remaining) [2023-08-27 03:44:04,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 25 remaining) [2023-08-27 03:44:04,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 25 remaining) [2023-08-27 03:44:04,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 25 remaining) [2023-08-27 03:44:04,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (16 of 25 remaining) [2023-08-27 03:44:04,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 25 remaining) [2023-08-27 03:44:04,785 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (7 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 25 remaining) [2023-08-27 03:44:04,786 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 25 remaining) [2023-08-27 03:44:04,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 25 remaining) [2023-08-27 03:44:04,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 25 remaining) [2023-08-27 03:44:04,787 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 25 remaining) [2023-08-27 03:44:04,787 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-08-27 03:44:04,787 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:44:04,790 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:44:04,790 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:44:04,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:44:04 BasicIcfg [2023-08-27 03:44:04,854 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:44:04,854 INFO L158 Benchmark]: Toolchain (without parser) took 61390.19ms. Allocated memory was 335.5MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 308.4MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2023-08-27 03:44:04,854 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 335.5MB. Free memory is still 311.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:44:04,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 545.54ms. Allocated memory is still 335.5MB. Free memory was 308.0MB in the beginning and 278.9MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 03:44:04,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.34ms. Allocated memory is still 335.5MB. Free memory was 278.9MB in the beginning and 274.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:44:04,855 INFO L158 Benchmark]: Boogie Preprocessor took 40.32ms. Allocated memory is still 335.5MB. Free memory was 274.7MB in the beginning and 271.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:44:04,855 INFO L158 Benchmark]: RCFGBuilder took 798.91ms. Allocated memory is still 335.5MB. Free memory was 271.8MB in the beginning and 243.4MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 16.0GB. [2023-08-27 03:44:04,855 INFO L158 Benchmark]: TraceAbstraction took 59923.35ms. Allocated memory was 335.5MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 242.2MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. [2023-08-27 03:44:04,856 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 335.5MB. Free memory is still 311.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 545.54ms. Allocated memory is still 335.5MB. Free memory was 308.0MB in the beginning and 278.9MB in the end (delta: 29.1MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 77.34ms. Allocated memory is still 335.5MB. Free memory was 278.9MB in the beginning and 274.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 40.32ms. Allocated memory is still 335.5MB. Free memory was 274.7MB in the beginning and 271.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 798.91ms. Allocated memory is still 335.5MB. Free memory was 271.8MB in the beginning and 243.4MB in the end (delta: 28.4MB). Peak memory consumption was 28.3MB. Max. memory is 16.0GB. * TraceAbstraction took 59923.35ms. Allocated memory was 335.5MB in the beginning and 5.8GB in the end (delta: 5.5GB). Free memory was 242.2MB in the beginning and 2.4GB in the end (delta: -2.2GB). Peak memory consumption was 3.3GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 169 PlacesBefore, 54 PlacesAfterwards, 159 TransitionsBefore, 42 TransitionsAfterwards, 4808 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 136 TotalNumberOfCompositions, 18731 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5626, independent: 5241, independent conditional: 0, independent unconditional: 5241, dependent: 385, dependent conditional: 0, dependent unconditional: 385, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2480, independent: 2411, independent conditional: 0, independent unconditional: 2411, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5626, independent: 2830, independent conditional: 0, independent unconditional: 2830, dependent: 316, dependent conditional: 0, dependent unconditional: 316, unknown: 2480, unknown conditional: 0, unknown unconditional: 2480] , Statistics on independence cache: Total cache size (in pairs): 261, Positive cache size: 225, Positive conditional cache size: 0, Positive unconditional cache size: 225, Negative cache size: 36, Negative conditional cache size: 0, Negative unconditional cache size: 36, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p1_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L725] 0 _Bool x$flush_delayed; [L726] 0 int x$mem_tmp; [L727] 0 _Bool x$r_buff0_thd0; [L728] 0 _Bool x$r_buff0_thd1; [L729] 0 _Bool x$r_buff0_thd2; [L730] 0 _Bool x$r_buff0_thd3; [L731] 0 _Bool x$r_buff0_thd4; [L732] 0 _Bool x$r_buff1_thd0; [L733] 0 _Bool x$r_buff1_thd1; [L734] 0 _Bool x$r_buff1_thd2; [L735] 0 _Bool x$r_buff1_thd3; [L736] 0 _Bool x$r_buff1_thd4; [L737] 0 _Bool x$read_delayed; [L738] 0 int *x$read_delayed_var; [L739] 0 int x$w_buff0; [L740] 0 _Bool x$w_buff0_used; [L741] 0 int x$w_buff1; [L742] 0 _Bool x$w_buff1_used; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice2; [L920] 0 pthread_t t625; [L921] FCALL, FORK 0 pthread_create(&t625, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t625, ((void *)0), P0, ((void *)0))=-3, t625={5:0}, weak$$choice0=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L922] 0 pthread_t t626; [L923] FCALL, FORK 0 pthread_create(&t626, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t626, ((void *)0), P1, ((void *)0))=-2, t625={5:0}, t626={6:0}, weak$$choice0=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L790] 2 x$w_buff1 = x$w_buff0 [L791] 2 x$w_buff0 = 2 [L792] 2 x$w_buff1_used = x$w_buff0_used [L793] 2 x$w_buff0_used = (_Bool)1 [L794] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L794] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L795] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L796] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L797] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L798] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L799] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L924] 0 pthread_t t627; [L803] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 2 x$flush_delayed = weak$$choice2 [L806] 2 x$mem_tmp = x [L807] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L808] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L809] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L810] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L811] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L812] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L813] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L814] 2 __unbuffered_p1_EAX = x [L815] 2 x = x$flush_delayed ? x$mem_tmp : x [L816] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L925] FCALL, FORK 0 pthread_create(&t627, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t627, ((void *)0), P2, ((void *)0))=-1, t625={5:0}, t626={6:0}, t627={7:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L819] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L836] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L839] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L842] 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) [L843] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L844] 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 [L845] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L846] 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 [L847] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L848] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L849] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L850] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L851] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L926] 0 pthread_t t628; [L927] FCALL, FORK 0 pthread_create(&t628, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t628, ((void *)0), P3, ((void *)0))=0, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L861] 4 z$w_buff1 = z$w_buff0 [L862] 4 z$w_buff0 = 2 [L863] 4 z$w_buff1_used = z$w_buff0_used [L864] 4 z$w_buff0_used = (_Bool)1 [L865] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L865] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L866] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L867] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L868] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L869] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L870] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L871] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L875] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L876] 4 z$flush_delayed = weak$$choice2 [L877] 4 z$mem_tmp = z [L878] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L879] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L880] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L881] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L882] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L883] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L884] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L885] 4 __unbuffered_p3_EAX = z [L886] 4 z = z$flush_delayed ? z$mem_tmp : z [L887] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L890] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L770] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=1] [L893] 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) [L894] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L895] 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 [L896] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L897] 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 [L898] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L899] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L900] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L901] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L902] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L773] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L822] 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) [L823] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L824] 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 [L825] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L826] 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_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L829] EXPR 2 __unbuffered_cnt + 1 [L829] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 2 return 0; [L776] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L777] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L778] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L779] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L780] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L783] EXPR 1 __unbuffered_cnt + 1 [L783] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 1 return 0; [L854] EXPR 3 __unbuffered_cnt + 1 [L854] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 3 return 0; [L905] EXPR 4 __unbuffered_cnt + 1 [L905] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L907] 4 return 0; [L929] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L931] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L931] RET 0 assume_abort_if_not(main$tmp_guard0) [L933] 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) [L934] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L935] 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 [L936] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L937] 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 [L938] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L939] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L940] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L941] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L942] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t625={5:0}, t626={6:0}, t627={7:0}, t628={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=1, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] [L945] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L946] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L947] 0 z$flush_delayed = weak$$choice2 [L948] 0 z$mem_tmp = z [L949] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L950] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L951] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L952] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L953] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L954] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L955] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L956] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L957] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L958] 0 x$flush_delayed = weak$$choice2 [L959] 0 x$mem_tmp = x [L960] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L961] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L962] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L963] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L964] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L965] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L966] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L967] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L968] 0 z = z$flush_delayed ? z$mem_tmp : z [L969] 0 z$flush_delayed = (_Bool)0 [L970] 0 x = x$flush_delayed ? x$mem_tmp : x [L971] 0 x$flush_delayed = (_Bool)0 [L973] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix023_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:52}, \read(__PRETTY_FUNCTION__)={51:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, 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=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=2] - UnprovableResult [Line: 783]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 783]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 905]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 905]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 925]: 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: 927]: 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: 923]: 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: 921]: 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, 209 locations, 25 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: 59.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 33.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1163 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1163 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 183 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3085 IncrementalHoareTripleChecker+Invalid, 3268 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 183 mSolverCounterUnsat, 34 mSDtfsCounter, 3085 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1135occurred in iteration=20, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 421 NumberOfCodeBlocks, 421 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 371 ConstructedInterpolants, 0 QuantifiedInterpolants, 4940 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:44:04,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...