/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:27:30,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:27:30,085 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:27:30,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:27:30,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:27:30,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:27:30,115 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:27:30,119 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:27:30,120 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:27:30,122 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:27:30,122 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:27:30,122 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:27:30,123 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:27:30,123 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:27:30,124 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:27:30,124 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:27:30,124 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:27:30,124 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:27:30,124 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:27:30,124 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:27:30,124 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:27:30,125 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:27:30,125 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:27:30,125 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:27:30,126 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:27:30,126 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:27:30,126 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:27:30,126 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:27:30,126 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:27:30,126 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:27:30,127 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:27:30,127 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:27:30,127 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:27:30,127 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:27:30,127 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:27:30,128 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:27:30,350 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:27:30,366 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:27:30,368 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:27:30,369 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:27:30,369 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:27:30,370 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i [2023-08-26 21:27:31,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:27:31,446 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:27:31,447 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe019_rmo.oepc.i [2023-08-26 21:27:31,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/898983df5/840919dd171d4c89aae9ec2054dc4618/FLAG4dca85a7f [2023-08-26 21:27:31,472 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/898983df5/840919dd171d4c89aae9ec2054dc4618 [2023-08-26 21:27:31,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:27:31,474 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:27:31,475 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:27:31,475 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:27:31,476 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:27:31,477 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:31,477 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ece7d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31, skipping insertion in model container [2023-08-26 21:27:31,477 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:31,547 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:27:31,857 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:27:31,868 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:27:31,891 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:27:31,892 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:27:31,911 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:27:31,934 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:27:31,934 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:27:31,939 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:27:31,939 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31 WrapperNode [2023-08-26 21:27:31,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:27:31,940 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:27:31,940 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:27:31,940 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:27:31,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:31,954 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:31,973 INFO L138 Inliner]: procedures = 177, calls = 86, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 188 [2023-08-26 21:27:31,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:27:31,973 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:27:31,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:27:31,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:27:31,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:31,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:31,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:31,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:32,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:32,007 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:32,009 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:32,010 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:32,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:27:32,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:27:32,025 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:27:32,025 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:27:32,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (1/1) ... [2023-08-26 21:27:32,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:27:32,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:27:32,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:27:32,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:27:32,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 21:27:32,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:27:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:27:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:27:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:27:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:27:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:27:32,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:27:32,072 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:27:32,072 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:27:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:27:32,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:27:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-26 21:27:32,073 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-26 21:27:32,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:27:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:27:32,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:27:32,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:27:32,075 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:27:32,186 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:27:32,187 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:27:32,560 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:27:32,718 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:27:32,718 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:27:32,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:27:32 BoogieIcfgContainer [2023-08-26 21:27:32,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:27:32,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:27:32,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:27:32,724 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:27:32,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:27:31" (1/3) ... [2023-08-26 21:27:32,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157e6fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:27:32, skipping insertion in model container [2023-08-26 21:27:32,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:27:31" (2/3) ... [2023-08-26 21:27:32,725 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@157e6fee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:27:32, skipping insertion in model container [2023-08-26 21:27:32,725 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:27:32" (3/3) ... [2023-08-26 21:27:32,726 INFO L112 eAbstractionObserver]: Analyzing ICFG safe019_rmo.oepc.i [2023-08-26 21:27:32,736 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:27:32,737 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-26 21:27:32,737 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:27:32,794 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:27:32,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 155 transitions, 330 flow [2023-08-26 21:27:32,898 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2023-08-26 21:27:32,898 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:27:32,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 3/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-26 21:27:32,904 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 155 transitions, 330 flow [2023-08-26 21:27:32,909 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 161 places, 151 transitions, 314 flow [2023-08-26 21:27:32,911 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:27:32,920 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 161 places, 151 transitions, 314 flow [2023-08-26 21:27:32,923 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 161 places, 151 transitions, 314 flow [2023-08-26 21:27:32,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 161 places, 151 transitions, 314 flow [2023-08-26 21:27:32,952 INFO L124 PetriNetUnfolderBase]: 3/151 cut-off events. [2023-08-26 21:27:32,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:27:32,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 3/151 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 89 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-08-26 21:27:32,955 INFO L119 LiptonReduction]: Number of co-enabled transitions 3664 [2023-08-26 21:27:38,881 INFO L134 LiptonReduction]: Checked pairs total: 12738 [2023-08-26 21:27:38,881 INFO L136 LiptonReduction]: Total number of compositions: 131 [2023-08-26 21:27:38,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:27:38,893 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;@7a5af570, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:27:38,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2023-08-26 21:27:38,896 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:27:38,896 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:27:38,897 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:27:38,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:38,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:27:38,897 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:38,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:38,900 INFO L85 PathProgramCache]: Analyzing trace with hash 814677158, now seen corresponding path program 1 times [2023-08-26 21:27:38,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:38,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920955256] [2023-08-26 21:27:38,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:38,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:39,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:39,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920955256] [2023-08-26 21:27:39,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920955256] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:39,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:39,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:27:39,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128155782] [2023-08-26 21:27:39,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:39,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:27:39,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:39,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:27:39,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:27:39,150 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-08-26 21:27:39,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:39,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:39,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-08-26 21:27:39,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:40,423 INFO L124 PetriNetUnfolderBase]: 10211/14166 cut-off events. [2023-08-26 21:27:40,423 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2023-08-26 21:27:40,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28530 conditions, 14166 events. 10211/14166 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 855. Compared 82087 event pairs, 2881 based on Foata normal form. 536/9301 useless extension candidates. Maximal degree in co-relation 28518. Up to 13269 conditions per place. [2023-08-26 21:27:40,493 INFO L140 encePairwiseOnDemand]: 272/286 looper letters, 49 selfloop transitions, 5 changer transitions 0/56 dead transitions. [2023-08-26 21:27:40,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 241 flow [2023-08-26 21:27:40,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:27:40,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:27:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 448 transitions. [2023-08-26 21:27:40,506 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5221445221445221 [2023-08-26 21:27:40,506 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 448 transitions. [2023-08-26 21:27:40,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 448 transitions. [2023-08-26 21:27:40,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:40,510 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 448 transitions. [2023-08-26 21:27:40,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:40,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:40,516 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 286.0) internal successors, (1144), 4 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:40,517 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 82 flow. Second operand 3 states and 448 transitions. [2023-08-26 21:27:40,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 241 flow [2023-08-26 21:27:40,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 56 transitions, 234 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:27:40,521 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 123 flow [2023-08-26 21:27:40,522 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-26 21:27:40,524 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-08-26 21:27:40,524 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 123 flow [2023-08-26 21:27:40,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:40,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:40,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:40,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:27:40,525 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:40,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:40,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1161937404, now seen corresponding path program 1 times [2023-08-26 21:27:40,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:40,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289201541] [2023-08-26 21:27:40,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:40,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:40,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:40,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:40,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:40,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289201541] [2023-08-26 21:27:40,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289201541] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:40,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:40,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:27:40,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719688601] [2023-08-26 21:27:40,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:40,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:27:40,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:40,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:27:40,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:27:40,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-08-26 21:27:40,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 123 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:40,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:40,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-08-26 21:27:40,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:41,411 INFO L124 PetriNetUnfolderBase]: 5621/7812 cut-off events. [2023-08-26 21:27:41,412 INFO L125 PetriNetUnfolderBase]: For 420/420 co-relation queries the response was YES. [2023-08-26 21:27:41,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19477 conditions, 7812 events. 5621/7812 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 427. Compared 41393 event pairs, 1317 based on Foata normal form. 0/5829 useless extension candidates. Maximal degree in co-relation 19466. Up to 6914 conditions per place. [2023-08-26 21:27:41,443 INFO L140 encePairwiseOnDemand]: 277/286 looper letters, 45 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2023-08-26 21:27:41,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 52 transitions, 249 flow [2023-08-26 21:27:41,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:27:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:27:41,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-26 21:27:41,445 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49475524475524474 [2023-08-26 21:27:41,445 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-26 21:27:41,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-26 21:27:41,445 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:41,445 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-26 21:27:41,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:41,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:41,448 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:41,448 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 123 flow. Second operand 4 states and 566 transitions. [2023-08-26 21:27:41,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 52 transitions, 249 flow [2023-08-26 21:27:41,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 52 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:27:41,450 INFO L231 Difference]: Finished difference. Result has 44 places, 34 transitions, 112 flow [2023-08-26 21:27:41,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=112, PETRI_PLACES=44, PETRI_TRANSITIONS=34} [2023-08-26 21:27:41,451 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -3 predicate places. [2023-08-26 21:27:41,451 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 34 transitions, 112 flow [2023-08-26 21:27:41,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:41,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:41,451 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:41,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:27:41,452 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:41,452 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:41,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1161937403, now seen corresponding path program 1 times [2023-08-26 21:27:41,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:41,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392655630] [2023-08-26 21:27:41,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:41,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:41,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:41,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:41,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392655630] [2023-08-26 21:27:41,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392655630] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:41,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:41,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:27:41,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135946023] [2023-08-26 21:27:41,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:41,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:27:41,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:41,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:27:41,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:27:41,506 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-08-26 21:27:41,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 34 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:41,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:41,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-08-26 21:27:41,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:42,045 INFO L124 PetriNetUnfolderBase]: 3389/4786 cut-off events. [2023-08-26 21:27:42,045 INFO L125 PetriNetUnfolderBase]: For 1302/1302 co-relation queries the response was YES. [2023-08-26 21:27:42,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11806 conditions, 4786 events. 3389/4786 cut-off events. For 1302/1302 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 23722 event pairs, 680 based on Foata normal form. 0/4085 useless extension candidates. Maximal degree in co-relation 11794. Up to 2243 conditions per place. [2023-08-26 21:27:42,059 INFO L140 encePairwiseOnDemand]: 277/286 looper letters, 61 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2023-08-26 21:27:42,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 72 transitions, 346 flow [2023-08-26 21:27:42,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:27:42,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:27:42,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2023-08-26 21:27:42,060 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5122377622377622 [2023-08-26 21:27:42,061 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2023-08-26 21:27:42,061 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2023-08-26 21:27:42,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:42,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2023-08-26 21:27:42,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:42,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:42,064 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:42,064 INFO L175 Difference]: Start difference. First operand has 44 places, 34 transitions, 112 flow. Second operand 4 states and 586 transitions. [2023-08-26 21:27:42,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 72 transitions, 346 flow [2023-08-26 21:27:42,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 72 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:27:42,066 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 164 flow [2023-08-26 21:27:42,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-26 21:27:42,066 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, -1 predicate places. [2023-08-26 21:27:42,067 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 164 flow [2023-08-26 21:27:42,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:42,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:42,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:42,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:27:42,067 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:42,068 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:42,068 INFO L85 PathProgramCache]: Analyzing trace with hash -343546106, now seen corresponding path program 1 times [2023-08-26 21:27:42,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:42,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221553468] [2023-08-26 21:27:42,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:42,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:42,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:42,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:42,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221553468] [2023-08-26 21:27:42,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221553468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:42,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:42,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:27:42,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299580957] [2023-08-26 21:27:42,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:42,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:27:42,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:42,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:27:42,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:27:42,304 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 286 [2023-08-26 21:27:42,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 164 flow. Second operand has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:42,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:42,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 286 [2023-08-26 21:27:42,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:42,857 INFO L124 PetriNetUnfolderBase]: 3861/5749 cut-off events. [2023-08-26 21:27:42,857 INFO L125 PetriNetUnfolderBase]: For 4707/4707 co-relation queries the response was YES. [2023-08-26 21:27:42,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16577 conditions, 5749 events. 3861/5749 cut-off events. For 4707/4707 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 32020 event pairs, 679 based on Foata normal form. 0/5008 useless extension candidates. Maximal degree in co-relation 16564. Up to 3788 conditions per place. [2023-08-26 21:27:42,877 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 94 selfloop transitions, 4 changer transitions 0/100 dead transitions. [2023-08-26 21:27:42,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 100 transitions, 676 flow [2023-08-26 21:27:42,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:27:42,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:27:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2023-08-26 21:27:42,879 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5048951048951049 [2023-08-26 21:27:42,879 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2023-08-26 21:27:42,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2023-08-26 21:27:42,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:42,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2023-08-26 21:27:42,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:42,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:42,883 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:42,883 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 164 flow. Second operand 5 states and 722 transitions. [2023-08-26 21:27:42,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 100 transitions, 676 flow [2023-08-26 21:27:42,885 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 100 transitions, 618 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-26 21:27:42,886 INFO L231 Difference]: Finished difference. Result has 51 places, 40 transitions, 170 flow [2023-08-26 21:27:42,886 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=170, PETRI_PLACES=51, PETRI_TRANSITIONS=40} [2023-08-26 21:27:42,887 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 4 predicate places. [2023-08-26 21:27:42,887 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 40 transitions, 170 flow [2023-08-26 21:27:42,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.0) internal successors, (532), 4 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:42,887 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:42,887 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:42,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:27:42,888 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:42,888 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:42,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2060024588, now seen corresponding path program 1 times [2023-08-26 21:27:42,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:42,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507036895] [2023-08-26 21:27:42,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:42,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:42,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:43,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:43,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:43,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507036895] [2023-08-26 21:27:43,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507036895] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:43,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:43,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:27:43,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196514402] [2023-08-26 21:27:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:43,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:27:43,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:43,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:27:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:27:43,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 286 [2023-08-26 21:27:43,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 40 transitions, 170 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:43,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:43,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 286 [2023-08-26 21:27:43,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:43,772 INFO L124 PetriNetUnfolderBase]: 4657/7063 cut-off events. [2023-08-26 21:27:43,773 INFO L125 PetriNetUnfolderBase]: For 4368/4368 co-relation queries the response was YES. [2023-08-26 21:27:43,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20064 conditions, 7063 events. 4657/7063 cut-off events. For 4368/4368 co-relation queries the response was YES. Maximal size of possible extension queue 357. Compared 41606 event pairs, 1129 based on Foata normal form. 145/6447 useless extension candidates. Maximal degree in co-relation 20048. Up to 4004 conditions per place. [2023-08-26 21:27:43,797 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 102 selfloop transitions, 5 changer transitions 0/109 dead transitions. [2023-08-26 21:27:43,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 109 transitions, 695 flow [2023-08-26 21:27:43,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:27:43,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:27:43,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 728 transitions. [2023-08-26 21:27:43,800 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.509090909090909 [2023-08-26 21:27:43,800 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 728 transitions. [2023-08-26 21:27:43,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 728 transitions. [2023-08-26 21:27:43,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:43,801 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 728 transitions. [2023-08-26 21:27:43,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 145.6) internal successors, (728), 5 states have internal predecessors, (728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:43,804 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:43,804 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:43,805 INFO L175 Difference]: Start difference. First operand has 51 places, 40 transitions, 170 flow. Second operand 5 states and 728 transitions. [2023-08-26 21:27:43,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 109 transitions, 695 flow [2023-08-26 21:27:43,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 109 transitions, 692 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:27:43,812 INFO L231 Difference]: Finished difference. Result has 57 places, 43 transitions, 206 flow [2023-08-26 21:27:43,813 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=57, PETRI_TRANSITIONS=43} [2023-08-26 21:27:43,814 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 10 predicate places. [2023-08-26 21:27:43,814 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 43 transitions, 206 flow [2023-08-26 21:27:43,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:43,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:43,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:43,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:27:43,815 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:43,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:43,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1345571331, now seen corresponding path program 1 times [2023-08-26 21:27:43,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:43,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473105039] [2023-08-26 21:27:43,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:43,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:43,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:44,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:44,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473105039] [2023-08-26 21:27:44,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473105039] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:44,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:44,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:27:44,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326142281] [2023-08-26 21:27:44,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:44,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:27:44,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:44,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:27:44,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:27:44,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 286 [2023-08-26 21:27:44,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 43 transitions, 206 flow. Second operand has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:44,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:44,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 286 [2023-08-26 21:27:44,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:45,266 INFO L124 PetriNetUnfolderBase]: 9507/14026 cut-off events. [2023-08-26 21:27:45,266 INFO L125 PetriNetUnfolderBase]: For 10197/10197 co-relation queries the response was YES. [2023-08-26 21:27:45,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41337 conditions, 14026 events. 9507/14026 cut-off events. For 10197/10197 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 86540 event pairs, 1516 based on Foata normal form. 145/12679 useless extension candidates. Maximal degree in co-relation 41317. Up to 3951 conditions per place. [2023-08-26 21:27:45,317 INFO L140 encePairwiseOnDemand]: 281/286 looper letters, 150 selfloop transitions, 13 changer transitions 0/164 dead transitions. [2023-08-26 21:27:45,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 164 transitions, 1108 flow [2023-08-26 21:27:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:27:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:27:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1002 transitions. [2023-08-26 21:27:45,319 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5004995004995005 [2023-08-26 21:27:45,319 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1002 transitions. [2023-08-26 21:27:45,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1002 transitions. [2023-08-26 21:27:45,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:45,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1002 transitions. [2023-08-26 21:27:45,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 143.14285714285714) internal successors, (1002), 7 states have internal predecessors, (1002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:45,323 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:45,324 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:45,324 INFO L175 Difference]: Start difference. First operand has 57 places, 43 transitions, 206 flow. Second operand 7 states and 1002 transitions. [2023-08-26 21:27:45,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 164 transitions, 1108 flow [2023-08-26 21:27:45,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 164 transitions, 1104 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:27:45,349 INFO L231 Difference]: Finished difference. Result has 65 places, 52 transitions, 317 flow [2023-08-26 21:27:45,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=317, PETRI_PLACES=65, PETRI_TRANSITIONS=52} [2023-08-26 21:27:45,351 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 18 predicate places. [2023-08-26 21:27:45,353 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 52 transitions, 317 flow [2023-08-26 21:27:45,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.8) internal successors, (649), 5 states have internal predecessors, (649), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:45,353 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:45,353 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:45,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:27:45,354 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:45,356 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:45,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1714256002, now seen corresponding path program 1 times [2023-08-26 21:27:45,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:45,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61570986] [2023-08-26 21:27:45,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:45,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:45,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:45,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61570986] [2023-08-26 21:27:45,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61570986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:45,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:45,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:27:45,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449690877] [2023-08-26 21:27:45,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:45,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:27:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:45,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:27:45,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:27:45,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-08-26 21:27:45,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 52 transitions, 317 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-26 21:27:45,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:45,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-08-26 21:27:45,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:46,292 INFO L124 PetriNetUnfolderBase]: 5647/8222 cut-off events. [2023-08-26 21:27:46,292 INFO L125 PetriNetUnfolderBase]: For 10231/10231 co-relation queries the response was YES. [2023-08-26 21:27:46,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26091 conditions, 8222 events. 5647/8222 cut-off events. For 10231/10231 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 49754 event pairs, 788 based on Foata normal form. 0/7893 useless extension candidates. Maximal degree in co-relation 26067. Up to 3052 conditions per place. [2023-08-26 21:27:46,324 INFO L140 encePairwiseOnDemand]: 277/286 looper letters, 124 selfloop transitions, 13 changer transitions 0/139 dead transitions. [2023-08-26 21:27:46,324 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 139 transitions, 1142 flow [2023-08-26 21:27:46,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:27:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:27:46,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 732 transitions. [2023-08-26 21:27:46,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5118881118881119 [2023-08-26 21:27:46,326 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 732 transitions. [2023-08-26 21:27:46,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 732 transitions. [2023-08-26 21:27:46,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:46,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 732 transitions. [2023-08-26 21:27:46,328 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 146.4) internal successors, (732), 5 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:46,330 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:46,330 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:46,330 INFO L175 Difference]: Start difference. First operand has 65 places, 52 transitions, 317 flow. Second operand 5 states and 732 transitions. [2023-08-26 21:27:46,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 139 transitions, 1142 flow [2023-08-26 21:27:46,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 139 transitions, 1126 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-26 21:27:46,344 INFO L231 Difference]: Finished difference. Result has 70 places, 56 transitions, 387 flow [2023-08-26 21:27:46,345 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=70, PETRI_TRANSITIONS=56} [2023-08-26 21:27:46,345 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 23 predicate places. [2023-08-26 21:27:46,345 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 56 transitions, 387 flow [2023-08-26 21:27:46,345 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-26 21:27:46,346 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:46,346 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:46,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:27:46,346 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:46,346 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1520427492, now seen corresponding path program 1 times [2023-08-26 21:27:46,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:46,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483919867] [2023-08-26 21:27:46,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:46,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:46,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:46,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:46,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483919867] [2023-08-26 21:27:46,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483919867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:46,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:46,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:27:46,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123053987] [2023-08-26 21:27:46,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:46,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:27:46,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:46,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:27:46,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:27:46,524 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2023-08-26 21:27:46,525 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 56 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:46,525 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:46,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2023-08-26 21:27:46,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:47,292 INFO L124 PetriNetUnfolderBase]: 4224/6487 cut-off events. [2023-08-26 21:27:47,293 INFO L125 PetriNetUnfolderBase]: For 13557/13557 co-relation queries the response was YES. [2023-08-26 21:27:47,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22731 conditions, 6487 events. 4224/6487 cut-off events. For 13557/13557 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 40104 event pairs, 722 based on Foata normal form. 224/6376 useless extension candidates. Maximal degree in co-relation 22704. Up to 3874 conditions per place. [2023-08-26 21:27:47,311 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 86 selfloop transitions, 6 changer transitions 0/94 dead transitions. [2023-08-26 21:27:47,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 94 transitions, 777 flow [2023-08-26 21:27:47,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:27:47,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:27:47,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2023-08-26 21:27:47,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49475524475524474 [2023-08-26 21:27:47,313 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2023-08-26 21:27:47,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2023-08-26 21:27:47,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:47,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2023-08-26 21:27:47,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:47,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:47,316 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 286.0) internal successors, (1430), 5 states have internal predecessors, (1430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:47,316 INFO L175 Difference]: Start difference. First operand has 70 places, 56 transitions, 387 flow. Second operand 4 states and 566 transitions. [2023-08-26 21:27:47,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 94 transitions, 777 flow [2023-08-26 21:27:47,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 94 transitions, 719 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-26 21:27:47,384 INFO L231 Difference]: Finished difference. Result has 72 places, 57 transitions, 383 flow [2023-08-26 21:27:47,384 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=353, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=383, PETRI_PLACES=72, PETRI_TRANSITIONS=57} [2023-08-26 21:27:47,385 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 25 predicate places. [2023-08-26 21:27:47,385 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 57 transitions, 383 flow [2023-08-26 21:27:47,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:47,385 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:47,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:47,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:27:47,386 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:47,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:47,389 INFO L85 PathProgramCache]: Analyzing trace with hash -113976080, now seen corresponding path program 1 times [2023-08-26 21:27:47,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:47,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56218732] [2023-08-26 21:27:47,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:47,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:47,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-26 21:27:47,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:47,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56218732] [2023-08-26 21:27:47,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56218732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:47,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:47,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:27:47,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335521370] [2023-08-26 21:27:47,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:47,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:27:47,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:47,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:27:47,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:27:47,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2023-08-26 21:27:47,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 57 transitions, 383 flow. Second operand has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:47,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:47,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2023-08-26 21:27:47,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:48,035 INFO L124 PetriNetUnfolderBase]: 2740/4323 cut-off events. [2023-08-26 21:27:48,035 INFO L125 PetriNetUnfolderBase]: For 7345/7345 co-relation queries the response was YES. [2023-08-26 21:27:48,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14832 conditions, 4323 events. 2740/4323 cut-off events. For 7345/7345 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 25693 event pairs, 423 based on Foata normal form. 176/4394 useless extension candidates. Maximal degree in co-relation 14803. Up to 1317 conditions per place. [2023-08-26 21:27:48,050 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 90 selfloop transitions, 10 changer transitions 0/102 dead transitions. [2023-08-26 21:27:48,051 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 773 flow [2023-08-26 21:27:48,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:27:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:27:48,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 708 transitions. [2023-08-26 21:27:48,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4951048951048951 [2023-08-26 21:27:48,053 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 708 transitions. [2023-08-26 21:27:48,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 708 transitions. [2023-08-26 21:27:48,053 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:48,053 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 708 transitions. [2023-08-26 21:27:48,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 141.6) internal successors, (708), 5 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:48,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:48,056 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:48,056 INFO L175 Difference]: Start difference. First operand has 72 places, 57 transitions, 383 flow. Second operand 5 states and 708 transitions. [2023-08-26 21:27:48,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 773 flow [2023-08-26 21:27:48,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 102 transitions, 765 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:27:48,089 INFO L231 Difference]: Finished difference. Result has 76 places, 57 transitions, 406 flow [2023-08-26 21:27:48,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=406, PETRI_PLACES=76, PETRI_TRANSITIONS=57} [2023-08-26 21:27:48,090 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 29 predicate places. [2023-08-26 21:27:48,090 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 57 transitions, 406 flow [2023-08-26 21:27:48,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.2) internal successors, (646), 5 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:48,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:48,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:48,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:27:48,090 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:48,091 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:48,091 INFO L85 PathProgramCache]: Analyzing trace with hash -78191083, now seen corresponding path program 1 times [2023-08-26 21:27:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:48,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317438418] [2023-08-26 21:27:48,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:48,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:48,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:48,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:48,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317438418] [2023-08-26 21:27:48,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317438418] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:48,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:48,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:27:48,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285139866] [2023-08-26 21:27:48,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:48,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:27:48,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:48,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:27:48,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:27:48,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 286 [2023-08-26 21:27:48,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 57 transitions, 406 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-26 21:27:48,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:48,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 286 [2023-08-26 21:27:48,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:49,017 INFO L124 PetriNetUnfolderBase]: 5117/8127 cut-off events. [2023-08-26 21:27:49,017 INFO L125 PetriNetUnfolderBase]: For 21343/21343 co-relation queries the response was YES. [2023-08-26 21:27:49,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30425 conditions, 8127 events. 5117/8127 cut-off events. For 21343/21343 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 53240 event pairs, 914 based on Foata normal form. 29/7952 useless extension candidates. Maximal degree in co-relation 30394. Up to 4329 conditions per place. [2023-08-26 21:27:49,050 INFO L140 encePairwiseOnDemand]: 282/286 looper letters, 127 selfloop transitions, 6 changer transitions 4/138 dead transitions. [2023-08-26 21:27:49,050 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 138 transitions, 1198 flow [2023-08-26 21:27:49,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:27:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:27:49,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 718 transitions. [2023-08-26 21:27:49,052 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5020979020979021 [2023-08-26 21:27:49,052 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 718 transitions. [2023-08-26 21:27:49,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 718 transitions. [2023-08-26 21:27:49,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:49,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 718 transitions. [2023-08-26 21:27:49,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 143.6) internal successors, (718), 5 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:49,055 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:49,055 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:49,055 INFO L175 Difference]: Start difference. First operand has 76 places, 57 transitions, 406 flow. Second operand 5 states and 718 transitions. [2023-08-26 21:27:49,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 138 transitions, 1198 flow [2023-08-26 21:27:49,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 138 transitions, 1160 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:27:49,113 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 453 flow [2023-08-26 21:27:49,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=453, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2023-08-26 21:27:49,113 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 33 predicate places. [2023-08-26 21:27:49,113 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 453 flow [2023-08-26 21:27:49,114 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-26 21:27:49,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:49,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:49,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:27:49,114 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:49,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1272509171, now seen corresponding path program 2 times [2023-08-26 21:27:49,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:49,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025704816] [2023-08-26 21:27:49,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:49,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:49,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:49,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:49,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025704816] [2023-08-26 21:27:49,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025704816] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:49,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:49,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:27:49,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61804325] [2023-08-26 21:27:49,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:49,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:27:49,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:49,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:27:49,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:27:49,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2023-08-26 21:27:49,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:49,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:49,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2023-08-26 21:27:49,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:49,840 INFO L124 PetriNetUnfolderBase]: 3343/5294 cut-off events. [2023-08-26 21:27:49,840 INFO L125 PetriNetUnfolderBase]: For 13336/13355 co-relation queries the response was YES. [2023-08-26 21:27:49,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20971 conditions, 5294 events. 3343/5294 cut-off events. For 13336/13355 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 33065 event pairs, 426 based on Foata normal form. 168/5228 useless extension candidates. Maximal degree in co-relation 20938. Up to 1663 conditions per place. [2023-08-26 21:27:49,858 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 90 selfloop transitions, 14 changer transitions 0/107 dead transitions. [2023-08-26 21:27:49,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 107 transitions, 841 flow [2023-08-26 21:27:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:27:49,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:27:49,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 848 transitions. [2023-08-26 21:27:49,860 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49417249417249415 [2023-08-26 21:27:49,860 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 848 transitions. [2023-08-26 21:27:49,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 848 transitions. [2023-08-26 21:27:49,861 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:49,861 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 848 transitions. [2023-08-26 21:27:49,862 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:49,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:49,864 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:49,864 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 453 flow. Second operand 6 states and 848 transitions. [2023-08-26 21:27:49,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 107 transitions, 841 flow [2023-08-26 21:27:49,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 107 transitions, 817 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-26 21:27:49,935 INFO L231 Difference]: Finished difference. Result has 84 places, 58 transitions, 442 flow [2023-08-26 21:27:49,935 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=389, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=442, PETRI_PLACES=84, PETRI_TRANSITIONS=58} [2023-08-26 21:27:49,935 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 37 predicate places. [2023-08-26 21:27:49,935 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 58 transitions, 442 flow [2023-08-26 21:27:49,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 128.83333333333334) internal successors, (773), 6 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:49,936 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:49,936 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:49,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:27:49,936 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:49,936 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1991292216, now seen corresponding path program 1 times [2023-08-26 21:27:49,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:49,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989716781] [2023-08-26 21:27:49,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:49,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:49,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:49,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:49,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989716781] [2023-08-26 21:27:49,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989716781] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:49,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:49,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:27:49,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957929430] [2023-08-26 21:27:49,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:49,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:27:49,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:49,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:27:49,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:27:49,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 286 [2023-08-26 21:27:50,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 58 transitions, 442 flow. Second operand has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:50,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:50,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 286 [2023-08-26 21:27:50,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:50,523 INFO L124 PetriNetUnfolderBase]: 3252/5041 cut-off events. [2023-08-26 21:27:50,523 INFO L125 PetriNetUnfolderBase]: For 17962/17977 co-relation queries the response was YES. [2023-08-26 21:27:50,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22369 conditions, 5041 events. 3252/5041 cut-off events. For 17962/17977 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 30732 event pairs, 412 based on Foata normal form. 12/4980 useless extension candidates. Maximal degree in co-relation 22334. Up to 1663 conditions per place. [2023-08-26 21:27:50,539 INFO L140 encePairwiseOnDemand]: 277/286 looper letters, 50 selfloop transitions, 17 changer transitions 28/98 dead transitions. [2023-08-26 21:27:50,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 98 transitions, 805 flow [2023-08-26 21:27:50,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:27:50,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:27:50,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 850 transitions. [2023-08-26 21:27:50,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49533799533799533 [2023-08-26 21:27:50,541 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 850 transitions. [2023-08-26 21:27:50,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 850 transitions. [2023-08-26 21:27:50,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:50,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 850 transitions. [2023-08-26 21:27:50,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 141.66666666666666) internal successors, (850), 6 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:50,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:50,545 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:50,545 INFO L175 Difference]: Start difference. First operand has 84 places, 58 transitions, 442 flow. Second operand 6 states and 850 transitions. [2023-08-26 21:27:50,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 98 transitions, 805 flow [2023-08-26 21:27:50,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 98 transitions, 781 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-26 21:27:50,704 INFO L231 Difference]: Finished difference. Result has 81 places, 37 transitions, 291 flow [2023-08-26 21:27:50,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=81, PETRI_TRANSITIONS=37} [2023-08-26 21:27:50,705 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 34 predicate places. [2023-08-26 21:27:50,705 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 37 transitions, 291 flow [2023-08-26 21:27:50,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 131.0) internal successors, (786), 6 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:50,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:50,705 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:50,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:27:50,705 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:50,706 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:50,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1746021141, now seen corresponding path program 1 times [2023-08-26 21:27:50,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:50,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098526126] [2023-08-26 21:27:50,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:50,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:50,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:51,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:51,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098526126] [2023-08-26 21:27:51,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098526126] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:51,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:51,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:27:51,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105578831] [2023-08-26 21:27:51,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:51,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:27:51,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:51,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:27:51,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:27:51,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 286 [2023-08-26 21:27:51,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 37 transitions, 291 flow. Second operand has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:51,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:51,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 286 [2023-08-26 21:27:51,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:51,734 INFO L124 PetriNetUnfolderBase]: 939/1580 cut-off events. [2023-08-26 21:27:51,734 INFO L125 PetriNetUnfolderBase]: For 8886/8890 co-relation queries the response was YES. [2023-08-26 21:27:51,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7727 conditions, 1580 events. 939/1580 cut-off events. For 8886/8890 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 7842 event pairs, 306 based on Foata normal form. 13/1584 useless extension candidates. Maximal degree in co-relation 7692. Up to 1081 conditions per place. [2023-08-26 21:27:51,741 INFO L140 encePairwiseOnDemand]: 278/286 looper letters, 51 selfloop transitions, 6 changer transitions 13/72 dead transitions. [2023-08-26 21:27:51,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 72 transitions, 725 flow [2023-08-26 21:27:51,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:27:51,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:27:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 750 transitions. [2023-08-26 21:27:51,746 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4370629370629371 [2023-08-26 21:27:51,746 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 750 transitions. [2023-08-26 21:27:51,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 750 transitions. [2023-08-26 21:27:51,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:51,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 750 transitions. [2023-08-26 21:27:51,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:51,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:51,749 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 286.0) internal successors, (2002), 7 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:51,750 INFO L175 Difference]: Start difference. First operand has 81 places, 37 transitions, 291 flow. Second operand 6 states and 750 transitions. [2023-08-26 21:27:51,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 72 transitions, 725 flow [2023-08-26 21:27:51,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 401 flow, removed 63 selfloop flow, removed 26 redundant places. [2023-08-26 21:27:51,759 INFO L231 Difference]: Finished difference. Result has 54 places, 41 transitions, 184 flow [2023-08-26 21:27:51,759 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=54, PETRI_TRANSITIONS=41} [2023-08-26 21:27:51,760 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-26 21:27:51,760 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 41 transitions, 184 flow [2023-08-26 21:27:51,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:51,760 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:51,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:51,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:27:51,761 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:51,761 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:51,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1419187022, now seen corresponding path program 1 times [2023-08-26 21:27:51,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:51,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263005564] [2023-08-26 21:27:51,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:51,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:51,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:51,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:51,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263005564] [2023-08-26 21:27:51,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263005564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:51,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:51,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:27:51,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428989588] [2023-08-26 21:27:51,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:51,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:27:51,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:51,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:27:51,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:27:51,947 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 286 [2023-08-26 21:27:51,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 41 transitions, 184 flow. Second operand has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:51,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:51,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 286 [2023-08-26 21:27:51,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:52,146 INFO L124 PetriNetUnfolderBase]: 801/1317 cut-off events. [2023-08-26 21:27:52,147 INFO L125 PetriNetUnfolderBase]: For 756/771 co-relation queries the response was YES. [2023-08-26 21:27:52,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4515 conditions, 1317 events. 801/1317 cut-off events. For 756/771 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 6547 event pairs, 74 based on Foata normal form. 45/1343 useless extension candidates. Maximal degree in co-relation 4501. Up to 469 conditions per place. [2023-08-26 21:27:52,150 INFO L140 encePairwiseOnDemand]: 279/286 looper letters, 51 selfloop transitions, 18 changer transitions 12/83 dead transitions. [2023-08-26 21:27:52,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 83 transitions, 531 flow [2023-08-26 21:27:52,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:27:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:27:52,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 948 transitions. [2023-08-26 21:27:52,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47352647352647353 [2023-08-26 21:27:52,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 948 transitions. [2023-08-26 21:27:52,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 948 transitions. [2023-08-26 21:27:52,152 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:52,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 948 transitions. [2023-08-26 21:27:52,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 135.42857142857142) internal successors, (948), 7 states have internal predecessors, (948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:52,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:52,156 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 286.0) internal successors, (2288), 8 states have internal predecessors, (2288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:52,156 INFO L175 Difference]: Start difference. First operand has 54 places, 41 transitions, 184 flow. Second operand 7 states and 948 transitions. [2023-08-26 21:27:52,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 83 transitions, 531 flow [2023-08-26 21:27:52,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 474 flow, removed 12 selfloop flow, removed 6 redundant places. [2023-08-26 21:27:52,158 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 203 flow [2023-08-26 21:27:52,158 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-26 21:27:52,159 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 7 predicate places. [2023-08-26 21:27:52,159 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 203 flow [2023-08-26 21:27:52,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 128.85714285714286) internal successors, (902), 7 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:52,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:52,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:52,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:27:52,160 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:52,160 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:52,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1608396312, now seen corresponding path program 1 times [2023-08-26 21:27:52,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:52,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970930005] [2023-08-26 21:27:52,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:52,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:52,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:27:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:27:53,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:27:53,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970930005] [2023-08-26 21:27:53,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970930005] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:27:53,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:27:53,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:27:53,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800657788] [2023-08-26 21:27:53,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:27:53,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:27:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:27:53,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:27:53,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:27:53,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 286 [2023-08-26 21:27:53,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 203 flow. Second operand has 8 states, 8 states have (on average 118.875) internal successors, (951), 8 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:53,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:27:53,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 286 [2023-08-26 21:27:53,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:27:53,300 INFO L124 PetriNetUnfolderBase]: 654/1120 cut-off events. [2023-08-26 21:27:53,300 INFO L125 PetriNetUnfolderBase]: For 1355/1356 co-relation queries the response was YES. [2023-08-26 21:27:53,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4128 conditions, 1120 events. 654/1120 cut-off events. For 1355/1356 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 5180 event pairs, 263 based on Foata normal form. 1/1113 useless extension candidates. Maximal degree in co-relation 4112. Up to 685 conditions per place. [2023-08-26 21:27:53,303 INFO L140 encePairwiseOnDemand]: 280/286 looper letters, 44 selfloop transitions, 4 changer transitions 12/61 dead transitions. [2023-08-26 21:27:53,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 61 transitions, 463 flow [2023-08-26 21:27:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:27:53,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:27:53,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-26 21:27:53,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4314685314685315 [2023-08-26 21:27:53,305 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-26 21:27:53,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-26 21:27:53,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:27:53,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-26 21:27:53,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:53,307 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:53,307 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 286.0) internal successors, (1716), 6 states have internal predecessors, (1716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:53,307 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 203 flow. Second operand 5 states and 617 transitions. [2023-08-26 21:27:53,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 61 transitions, 463 flow [2023-08-26 21:27:53,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 351 flow, removed 6 selfloop flow, removed 10 redundant places. [2023-08-26 21:27:53,310 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 157 flow [2023-08-26 21:27:53,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=286, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-26 21:27:53,311 INFO L281 CegarLoopForPetriNet]: 47 programPoint places, 2 predicate places. [2023-08-26 21:27:53,311 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 157 flow [2023-08-26 21:27:53,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 118.875) internal successors, (951), 8 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:27:53,320 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:27:53,320 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:53,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:27:53,320 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 17 more)] === [2023-08-26 21:27:53,321 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:27:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1637253896, now seen corresponding path program 2 times [2023-08-26 21:27:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:27:53,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526131550] [2023-08-26 21:27:53,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:27:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:27:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:27:53,393 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:27:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:27:53,486 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:27:53,488 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:27:53,489 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (20 of 21 remaining) [2023-08-26 21:27:53,490 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2023-08-26 21:27:53,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2023-08-26 21:27:53,492 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2023-08-26 21:27:53,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2023-08-26 21:27:53,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2023-08-26 21:27:53,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2023-08-26 21:27:53,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2023-08-26 21:27:53,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2023-08-26 21:27:53,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 21 remaining) [2023-08-26 21:27:53,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 21 remaining) [2023-08-26 21:27:53,493 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 21 remaining) [2023-08-26 21:27:53,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 21 remaining) [2023-08-26 21:27:53,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2023-08-26 21:27:53,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2023-08-26 21:27:53,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2023-08-26 21:27:53,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2023-08-26 21:27:53,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2023-08-26 21:27:53,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2023-08-26 21:27:53,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2023-08-26 21:27:53,494 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2023-08-26 21:27:53,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:27:53,494 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:27:53,498 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:27:53,498 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:27:53,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:27:53 BasicIcfg [2023-08-26 21:27:53,563 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:27:53,563 INFO L158 Benchmark]: Toolchain (without parser) took 22089.50ms. Allocated memory was 350.2MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 325.7MB in the beginning and 1.8GB in the end (delta: -1.4GB). Peak memory consumption was 286.5MB. Max. memory is 16.0GB. [2023-08-26 21:27:53,564 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 350.2MB. Free memory was 327.7MB in the beginning and 327.6MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:27:53,564 INFO L158 Benchmark]: CACSL2BoogieTranslator took 464.84ms. Allocated memory is still 350.2MB. Free memory was 325.3MB in the beginning and 300.9MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-26 21:27:53,564 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.15ms. Allocated memory is still 350.2MB. Free memory was 300.9MB in the beginning and 298.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:27:53,564 INFO L158 Benchmark]: Boogie Preprocessor took 50.80ms. Allocated memory is still 350.2MB. Free memory was 298.0MB in the beginning and 295.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:27:53,564 INFO L158 Benchmark]: RCFGBuilder took 695.30ms. Allocated memory is still 350.2MB. Free memory was 295.6MB in the beginning and 273.7MB in the end (delta: 21.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. [2023-08-26 21:27:53,564 INFO L158 Benchmark]: TraceAbstraction took 20841.42ms. Allocated memory was 350.2MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 272.5MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 231.7MB. Max. memory is 16.0GB. [2023-08-26 21:27:53,566 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.09ms. Allocated memory is still 350.2MB. Free memory was 327.7MB in the beginning and 327.6MB in the end (delta: 87.1kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 464.84ms. Allocated memory is still 350.2MB. Free memory was 325.3MB in the beginning and 300.9MB in the end (delta: 24.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.15ms. Allocated memory is still 350.2MB. Free memory was 300.9MB in the beginning and 298.0MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.80ms. Allocated memory is still 350.2MB. Free memory was 298.0MB in the beginning and 295.6MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 695.30ms. Allocated memory is still 350.2MB. Free memory was 295.6MB in the beginning and 273.7MB in the end (delta: 21.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.0GB. * TraceAbstraction took 20841.42ms. Allocated memory was 350.2MB in the beginning and 2.1GB in the end (delta: 1.7GB). Free memory was 272.5MB in the beginning and 1.8GB in the end (delta: -1.5GB). Peak memory consumption was 231.7MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 161 PlacesBefore, 47 PlacesAfterwards, 151 TransitionsBefore, 35 TransitionsAfterwards, 3664 CoEnabledTransitionPairs, 8 FixpointIterations, 61 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 131 TotalNumberOfCompositions, 12738 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4669, independent: 4313, independent conditional: 0, independent unconditional: 4313, dependent: 356, dependent conditional: 0, dependent unconditional: 356, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1886, independent: 1822, independent conditional: 0, independent unconditional: 1822, dependent: 64, dependent conditional: 0, dependent unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4669, independent: 2491, independent conditional: 0, independent unconditional: 2491, dependent: 292, dependent conditional: 0, dependent unconditional: 292, unknown: 1886, unknown conditional: 0, unknown unconditional: 1886] , Statistics on independence cache: Total cache size (in pairs): 213, Positive cache size: 185, Positive conditional cache size: 0, Positive unconditional cache size: 185, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p0_EBX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L736] 0 _Bool main$tmp_guard0; [L737] 0 _Bool main$tmp_guard1; [L739] 0 int x = 0; [L741] 0 int y = 0; [L742] 0 _Bool y$flush_delayed; [L743] 0 int y$mem_tmp; [L744] 0 _Bool y$r_buff0_thd0; [L745] 0 _Bool y$r_buff0_thd1; [L746] 0 _Bool y$r_buff0_thd2; [L747] 0 _Bool y$r_buff0_thd3; [L748] 0 _Bool y$r_buff0_thd4; [L749] 0 _Bool y$r_buff1_thd0; [L750] 0 _Bool y$r_buff1_thd1; [L751] 0 _Bool y$r_buff1_thd2; [L752] 0 _Bool y$r_buff1_thd3; [L753] 0 _Bool y$r_buff1_thd4; [L754] 0 _Bool y$read_delayed; [L755] 0 int *y$read_delayed_var; [L756] 0 int y$w_buff0; [L757] 0 _Bool y$w_buff0_used; [L758] 0 int y$w_buff1; [L759] 0 _Bool y$w_buff1_used; [L760] 0 _Bool weak$$choice0; [L761] 0 _Bool weak$$choice1; [L762] 0 _Bool weak$$choice2; [L853] 0 pthread_t t2241; [L854] FCALL, FORK 0 pthread_create(&t2241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2241, ((void *)0), P0, ((void *)0))=1, t2241={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L855] 0 pthread_t t2242; [L766] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L767] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L768] 1 y$flush_delayed = weak$$choice2 [L769] EXPR 1 \read(y) [L769] 1 y$mem_tmp = y [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L770] EXPR 1 \read(y) [L770] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L770] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L771] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L772] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L773] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L774] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L776] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L777] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L778] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L779] EXPR 1 \read(y) [L779] 1 __unbuffered_p0_EAX = y [L780] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L780] EXPR 1 \read(y) [L780] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L780] 1 y = y$flush_delayed ? y$mem_tmp : y [L781] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L789] EXPR 1 __unbuffered_cnt + 1 [L789] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 1 return 0; [L856] FCALL, FORK 0 pthread_create(&t2242, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2242, ((void *)0), P1, ((void *)0))=2, t2241={7:0}, t2242={5:0}, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L857] 0 pthread_t t2243; [L796] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L858] FCALL, FORK 0 pthread_create(&t2243, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2243, ((void *)0), P2, ((void *)0))=3, t2241={7:0}, t2242={5:0}, t2243={6:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L859] 0 pthread_t t2244; [L808] 3 __unbuffered_p2_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=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$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L860] FCALL, FORK 0 pthread_create(&t2244, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2244, ((void *)0), P3, ((void *)0))=4, t2241={7:0}, t2242={5:0}, t2243={6:0}, t2244={8:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L801] EXPR 2 __unbuffered_cnt + 1 [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L811] 3 y = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L814] EXPR 3 \read(y) [L814] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L814] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L818] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L821] EXPR 3 __unbuffered_cnt + 1 [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L828] 4 y = 2 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L831] EXPR 4 \read(y) [L831] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L831] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L831] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L832] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L833] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L834] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L835] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] EXPR 4 __unbuffered_cnt + 1 [L838] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 4 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2241={7:0}, t2242={5:0}, t2243={6:0}, t2244={8:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L866] EXPR 0 \read(y) [L866] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L866] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L866] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L867] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L868] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L869] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L870] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2241={7:0}, t2242={5:0}, t2243={6:0}, t2244={8:0}, weak$$choice1=0, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L873] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L874] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L875] 0 y$flush_delayed = weak$$choice2 [L876] EXPR 0 \read(y) [L876] 0 y$mem_tmp = y [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] EXPR 0 \read(y) [L877] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L877] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L878] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L879] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L880] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L881] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L883] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L884] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L885] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L885] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L885] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L886] EXPR 0 \read(y) [L886] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L887] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L887] EXPR 0 \read(y) [L887] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L887] 0 y = y$flush_delayed ? y$mem_tmp : y [L888] 0 y$flush_delayed = (_Bool)0 [L890] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "safe019_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=2, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 801]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 838]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 838]: 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 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: 860]: 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: 858]: 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: 856]: 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, 193 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.7s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 779 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 779 mSDsluCounter, 12 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 110 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1642 IncrementalHoareTripleChecker+Invalid, 1752 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 110 mSolverCounterUnsat, 7 mSDtfsCounter, 1642 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=453occurred in iteration=10, InterpolantAutomatonStates: 77, 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.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 215 ConstructedInterpolants, 0 QuantifiedInterpolants, 1336 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:27:53,603 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...