/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:53:16,783 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:53:16,862 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:53:16,865 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:53:16,866 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:53:16,894 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:53:16,895 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:53:16,895 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:53:16,896 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:53:16,896 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:53:16,897 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:53:16,897 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:53:16,897 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:53:16,898 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:53:16,898 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:53:16,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:53:16,900 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:53:16,900 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:53:16,901 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:53:16,901 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:53:16,901 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:53:16,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:53:16,903 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:53:16,903 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:53:16,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:53:16,904 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:53:16,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:53:16,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:53:16,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:53:16,905 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:53:16,905 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:53:16,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:53:16,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:53:16,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:53:16,906 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:53:16,906 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:53:17,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:53:17,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:53:17,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:53:17,235 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:53:17,235 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:53:17,236 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-08-27 03:53:18,415 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:53:18,651 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:53:18,651 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-08-27 03:53:18,665 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a677377/fed56dfaecd94116af3a40d8c67d80f5/FLAG0ea7a3d61 [2023-08-27 03:53:18,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a677377/fed56dfaecd94116af3a40d8c67d80f5 [2023-08-27 03:53:18,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:53:18,684 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:53:18,685 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:53:18,685 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:53:18,687 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:53:18,688 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:53:18" (1/1) ... [2023-08-27 03:53:18,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1d192d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:18, skipping insertion in model container [2023-08-27 03:53:18,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:53:18" (1/1) ... [2023-08-27 03:53:18,728 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:53:19,076 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:53:19,089 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:53:19,116 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:53:19,119 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 03:53:19,169 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:53:19,206 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:53:19,206 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:53:19,212 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:53:19,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19 WrapperNode [2023-08-27 03:53:19,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:53:19,214 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:53:19,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:53:19,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:53:19,220 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,278 INFO L138 Inliner]: procedures = 175, calls = 55, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 124 [2023-08-27 03:53:19,278 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:53:19,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:53:19,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:53:19,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:53:19,286 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,286 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,303 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,308 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,310 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,312 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:53:19,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:53:19,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:53:19,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:53:19,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (1/1) ... [2023-08-27 03:53:19,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:53:19,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:53:19,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:53:19,386 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:53:19,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-27 03:53:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:53:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:53:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:53:19,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:53:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:53:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:53:19,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:53:19,404 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:53:19,404 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:53:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:53:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:53:19,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:53:19,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:53:19,406 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:53:19,543 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:53:19,545 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:53:19,811 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:53:20,027 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:53:20,027 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:53:20,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:53:20 BoogieIcfgContainer [2023-08-27 03:53:20,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:53:20,031 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:53:20,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:53:20,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:53:20,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:53:18" (1/3) ... [2023-08-27 03:53:20,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693b659e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:53:20, skipping insertion in model container [2023-08-27 03:53:20,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:53:19" (2/3) ... [2023-08-27 03:53:20,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@693b659e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:53:20, skipping insertion in model container [2023-08-27 03:53:20,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:53:20" (3/3) ... [2023-08-27 03:53:20,037 INFO L112 eAbstractionObserver]: Analyzing ICFG safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.i [2023-08-27 03:53:20,051 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:53:20,051 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2023-08-27 03:53:20,051 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:53:20,099 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:53:20,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 111 transitions, 232 flow [2023-08-27 03:53:20,175 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2023-08-27 03:53:20,175 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:20,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 109 events. 3/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-27 03:53:20,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 111 transitions, 232 flow [2023-08-27 03:53:20,186 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 109 transitions, 224 flow [2023-08-27 03:53:20,188 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:53:20,196 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 113 places, 109 transitions, 224 flow [2023-08-27 03:53:20,198 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 113 places, 109 transitions, 224 flow [2023-08-27 03:53:20,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 109 transitions, 224 flow [2023-08-27 03:53:20,222 INFO L124 PetriNetUnfolderBase]: 3/109 cut-off events. [2023-08-27 03:53:20,222 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:20,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 109 events. 3/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 58 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 57. Up to 2 conditions per place. [2023-08-27 03:53:20,224 INFO L119 LiptonReduction]: Number of co-enabled transitions 1310 [2023-08-27 03:53:26,095 INFO L134 LiptonReduction]: Checked pairs total: 4032 [2023-08-27 03:53:26,096 INFO L136 LiptonReduction]: Total number of compositions: 103 [2023-08-27 03:53:26,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:53:26,112 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;@549a31ac, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:53:26,112 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2023-08-27 03:53:26,115 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:53:26,116 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 03:53:26,116 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:26,116 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:26,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:53:26,117 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-08-27 03:53:26,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:26,120 INFO L85 PathProgramCache]: Analyzing trace with hash 568436227, now seen corresponding path program 1 times [2023-08-27 03:53:26,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:26,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949799201] [2023-08-27 03:53:26,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:26,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:26,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:26,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:26,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949799201] [2023-08-27 03:53:26,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949799201] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:26,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:26,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:53:26,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972078382] [2023-08-27 03:53:26,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:26,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:53:26,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:26,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:53:26,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:53:26,437 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 214 [2023-08-27 03:53:26,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 44 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:26,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 214 [2023-08-27 03:53:26,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:26,547 INFO L124 PetriNetUnfolderBase]: 142/256 cut-off events. [2023-08-27 03:53:26,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:26,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 521 conditions, 256 events. 142/256 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1065 event pairs, 142 based on Foata normal form. 0/184 useless extension candidates. Maximal degree in co-relation 511. Up to 251 conditions per place. [2023-08-27 03:53:26,552 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 14 selfloop transitions, 1 changer transitions 0/17 dead transitions. [2023-08-27 03:53:26,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 17 transitions, 70 flow [2023-08-27 03:53:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:53:26,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:53:26,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-27 03:53:26,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46105919003115264 [2023-08-27 03:53:26,571 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-27 03:53:26,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-27 03:53:26,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:26,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-27 03:53:26,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,585 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,586 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 44 flow. Second operand 3 states and 296 transitions. [2023-08-27 03:53:26,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 17 transitions, 70 flow [2023-08-27 03:53:26,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 17 transitions, 68 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:26,589 INFO L231 Difference]: Finished difference. Result has 24 places, 17 transitions, 40 flow [2023-08-27 03:53:26,591 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=38, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=40, PETRI_PLACES=24, PETRI_TRANSITIONS=17} [2023-08-27 03:53:26,594 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, -2 predicate places. [2023-08-27 03:53:26,594 INFO L495 AbstractCegarLoop]: Abstraction has has 24 places, 17 transitions, 40 flow [2023-08-27 03:53:26,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:26,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:53:26,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:53:26,596 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-08-27 03:53:26,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:26,604 INFO L85 PathProgramCache]: Analyzing trace with hash 568436228, now seen corresponding path program 1 times [2023-08-27 03:53:26,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:26,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306447588] [2023-08-27 03:53:26,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:26,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:26,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:26,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:26,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306447588] [2023-08-27 03:53:26,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306447588] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:26,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:26,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:53:26,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325007219] [2023-08-27 03:53:26,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:26,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:53:26,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:26,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:53:26,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:53:26,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 214 [2023-08-27 03:53:26,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 24 places, 17 transitions, 40 flow. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:26,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 214 [2023-08-27 03:53:26,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:26,777 INFO L124 PetriNetUnfolderBase]: 86/166 cut-off events. [2023-08-27 03:53:26,777 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:53:26,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 166 events. 86/166 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 572 event pairs, 32 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 335. Up to 97 conditions per place. [2023-08-27 03:53:26,779 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 23 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2023-08-27 03:53:26,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 28 transitions, 116 flow [2023-08-27 03:53:26,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:53:26,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:53:26,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2023-08-27 03:53:26,782 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4781931464174455 [2023-08-27 03:53:26,782 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 307 transitions. [2023-08-27 03:53:26,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 307 transitions. [2023-08-27 03:53:26,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:26,783 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 307 transitions. [2023-08-27 03:53:26,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,785 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,785 INFO L175 Difference]: Start difference. First operand has 24 places, 17 transitions, 40 flow. Second operand 3 states and 307 transitions. [2023-08-27 03:53:26,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 28 transitions, 116 flow [2023-08-27 03:53:26,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 28 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:53:26,786 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 60 flow [2023-08-27 03:53:26,786 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=39, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=17, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-08-27 03:53:26,787 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2023-08-27 03:53:26,787 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 60 flow [2023-08-27 03:53:26,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:26,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:26,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:53:26,788 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-08-27 03:53:26,788 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:26,788 INFO L85 PathProgramCache]: Analyzing trace with hash 843008164, now seen corresponding path program 1 times [2023-08-27 03:53:26,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:26,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834310321] [2023-08-27 03:53:26,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:26,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:26,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:26,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834310321] [2023-08-27 03:53:26,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834310321] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:26,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:26,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:53:26,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566121175] [2023-08-27 03:53:26,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:26,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:53:26,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:26,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:53:26,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:53:26,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 214 [2023-08-27 03:53:26,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:26,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:26,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 214 [2023-08-27 03:53:26,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:27,059 INFO L124 PetriNetUnfolderBase]: 81/168 cut-off events. [2023-08-27 03:53:27,059 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-27 03:53:27,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 168 events. 81/168 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 637 event pairs, 18 based on Foata normal form. 0/146 useless extension candidates. Maximal degree in co-relation 401. Up to 127 conditions per place. [2023-08-27 03:53:27,062 INFO L140 encePairwiseOnDemand]: 211/214 looper letters, 20 selfloop transitions, 2 changer transitions 0/24 dead transitions. [2023-08-27 03:53:27,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 24 transitions, 117 flow [2023-08-27 03:53:27,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:53:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:53:27,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-27 03:53:27,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4766355140186916 [2023-08-27 03:53:27,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-27 03:53:27,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-27 03:53:27,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:27,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-27 03:53:27,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:27,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:27,068 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:27,068 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 60 flow. Second operand 3 states and 306 transitions. [2023-08-27 03:53:27,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 24 transitions, 117 flow [2023-08-27 03:53:27,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 24 transitions, 113 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:53:27,069 INFO L231 Difference]: Finished difference. Result has 28 places, 19 transitions, 65 flow [2023-08-27 03:53:27,070 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=57, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=65, PETRI_PLACES=28, PETRI_TRANSITIONS=19} [2023-08-27 03:53:27,071 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2023-08-27 03:53:27,071 INFO L495 AbstractCegarLoop]: Abstraction has has 28 places, 19 transitions, 65 flow [2023-08-27 03:53:27,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:27,071 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:27,072 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:27,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:53:27,075 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-08-27 03:53:27,076 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:27,076 INFO L85 PathProgramCache]: Analyzing trace with hash 363447235, now seen corresponding path program 1 times [2023-08-27 03:53:27,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:27,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402346453] [2023-08-27 03:53:27,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:27,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:27,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:27,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402346453] [2023-08-27 03:53:27,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402346453] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:27,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:27,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:53:27,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260783679] [2023-08-27 03:53:27,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:27,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:27,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:27,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:27,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:27,253 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 214 [2023-08-27 03:53:27,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 19 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:27,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:27,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 214 [2023-08-27 03:53:27,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:27,379 INFO L124 PetriNetUnfolderBase]: 130/263 cut-off events. [2023-08-27 03:53:27,379 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2023-08-27 03:53:27,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 263 events. 130/263 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1095 event pairs, 41 based on Foata normal form. 14/257 useless extension candidates. Maximal degree in co-relation 639. Up to 94 conditions per place. [2023-08-27 03:53:27,381 INFO L140 encePairwiseOnDemand]: 210/214 looper letters, 31 selfloop transitions, 3 changer transitions 2/37 dead transitions. [2023-08-27 03:53:27,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 37 transitions, 192 flow [2023-08-27 03:53:27,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 406 transitions. [2023-08-27 03:53:27,383 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4742990654205608 [2023-08-27 03:53:27,384 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 406 transitions. [2023-08-27 03:53:27,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 406 transitions. [2023-08-27 03:53:27,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:27,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 406 transitions. [2023-08-27 03:53:27,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:27,387 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:27,387 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:27,388 INFO L175 Difference]: Start difference. First operand has 28 places, 19 transitions, 65 flow. Second operand 4 states and 406 transitions. [2023-08-27 03:53:27,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 37 transitions, 192 flow [2023-08-27 03:53:27,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 37 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:27,389 INFO L231 Difference]: Finished difference. Result has 31 places, 20 transitions, 80 flow [2023-08-27 03:53:27,389 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=61, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=31, PETRI_TRANSITIONS=20} [2023-08-27 03:53:27,390 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 5 predicate places. [2023-08-27 03:53:27,390 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 20 transitions, 80 flow [2023-08-27 03:53:27,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.0) internal successors, (380), 4 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:27,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:27,391 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:27,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:53:27,391 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-08-27 03:53:27,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:27,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1917174877, now seen corresponding path program 1 times [2023-08-27 03:53:27,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:27,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450683473] [2023-08-27 03:53:27,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:27,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:28,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450683473] [2023-08-27 03:53:28,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450683473] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:28,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:28,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:53:28,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734584820] [2023-08-27 03:53:28,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:28,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:53:28,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:28,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:53:28,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:53:28,298 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 214 [2023-08-27 03:53:28,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 20 transitions, 80 flow. Second operand has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:28,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 214 [2023-08-27 03:53:28,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:28,442 INFO L124 PetriNetUnfolderBase]: 139/278 cut-off events. [2023-08-27 03:53:28,443 INFO L125 PetriNetUnfolderBase]: For 123/126 co-relation queries the response was YES. [2023-08-27 03:53:28,443 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 278 events. 139/278 cut-off events. For 123/126 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1138 event pairs, 26 based on Foata normal form. 5/265 useless extension candidates. Maximal degree in co-relation 728. Up to 202 conditions per place. [2023-08-27 03:53:28,444 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 31 selfloop transitions, 7 changer transitions 0/39 dead transitions. [2023-08-27 03:53:28,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 217 flow [2023-08-27 03:53:28,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:53:28,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:53:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 419 transitions. [2023-08-27 03:53:28,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39158878504672895 [2023-08-27 03:53:28,447 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 419 transitions. [2023-08-27 03:53:28,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 419 transitions. [2023-08-27 03:53:28,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:28,447 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 419 transitions. [2023-08-27 03:53:28,448 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 83.8) internal successors, (419), 5 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,450 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,451 INFO L175 Difference]: Start difference. First operand has 31 places, 20 transitions, 80 flow. Second operand 5 states and 419 transitions. [2023-08-27 03:53:28,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 217 flow [2023-08-27 03:53:28,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 39 transitions, 211 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:53:28,452 INFO L231 Difference]: Finished difference. Result has 35 places, 26 transitions, 117 flow [2023-08-27 03:53:28,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=117, PETRI_PLACES=35, PETRI_TRANSITIONS=26} [2023-08-27 03:53:28,453 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 9 predicate places. [2023-08-27 03:53:28,453 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 26 transitions, 117 flow [2023-08-27 03:53:28,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.5) internal successors, (471), 6 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:28,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:28,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:53:28,454 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-08-27 03:53:28,455 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash -2067281107, now seen corresponding path program 1 times [2023-08-27 03:53:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:28,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311290441] [2023-08-27 03:53:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:28,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:28,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:28,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:28,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311290441] [2023-08-27 03:53:28,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311290441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:28,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:28,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:53:28,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772389794] [2023-08-27 03:53:28,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:28,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:28,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:28,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:28,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:28,525 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 214 [2023-08-27 03:53:28,526 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 26 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,526 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:28,526 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 214 [2023-08-27 03:53:28,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:28,643 INFO L124 PetriNetUnfolderBase]: 110/221 cut-off events. [2023-08-27 03:53:28,643 INFO L125 PetriNetUnfolderBase]: For 168/176 co-relation queries the response was YES. [2023-08-27 03:53:28,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 221 events. 110/221 cut-off events. For 168/176 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 909 event pairs, 28 based on Foata normal form. 5/221 useless extension candidates. Maximal degree in co-relation 646. Up to 97 conditions per place. [2023-08-27 03:53:28,645 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 19 selfloop transitions, 5 changer transitions 12/38 dead transitions. [2023-08-27 03:53:28,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 38 transitions, 233 flow [2023-08-27 03:53:28,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 402 transitions. [2023-08-27 03:53:28,647 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4696261682242991 [2023-08-27 03:53:28,647 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 402 transitions. [2023-08-27 03:53:28,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 402 transitions. [2023-08-27 03:53:28,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:28,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 402 transitions. [2023-08-27 03:53:28,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,651 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,652 INFO L175 Difference]: Start difference. First operand has 35 places, 26 transitions, 117 flow. Second operand 4 states and 402 transitions. [2023-08-27 03:53:28,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 38 transitions, 233 flow [2023-08-27 03:53:28,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 38 transitions, 233 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:53:28,656 INFO L231 Difference]: Finished difference. Result has 36 places, 16 transitions, 83 flow [2023-08-27 03:53:28,656 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=36, PETRI_TRANSITIONS=16} [2023-08-27 03:53:28,658 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 10 predicate places. [2023-08-27 03:53:28,658 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 16 transitions, 83 flow [2023-08-27 03:53:28,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:28,659 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:28,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:53:28,659 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-08-27 03:53:28,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:28,659 INFO L85 PathProgramCache]: Analyzing trace with hash -2121526207, now seen corresponding path program 1 times [2023-08-27 03:53:28,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:28,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64937732] [2023-08-27 03:53:28,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:28,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:28,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:28,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:28,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:28,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64937732] [2023-08-27 03:53:28,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64937732] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:28,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:28,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:53:28,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226561871] [2023-08-27 03:53:28,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:28,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:53:28,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:28,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:53:28,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:53:28,829 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 214 [2023-08-27 03:53:28,829 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 16 transitions, 83 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,829 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:28,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 214 [2023-08-27 03:53:28,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:28,879 INFO L124 PetriNetUnfolderBase]: 24/67 cut-off events. [2023-08-27 03:53:28,879 INFO L125 PetriNetUnfolderBase]: For 84/85 co-relation queries the response was YES. [2023-08-27 03:53:28,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 236 conditions, 67 events. 24/67 cut-off events. For 84/85 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 180 event pairs, 5 based on Foata normal form. 9/75 useless extension candidates. Maximal degree in co-relation 220. Up to 26 conditions per place. [2023-08-27 03:53:28,880 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 18 selfloop transitions, 4 changer transitions 1/25 dead transitions. [2023-08-27 03:53:28,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 163 flow [2023-08-27 03:53:28,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:53:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:53:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-08-27 03:53:28,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4544392523364486 [2023-08-27 03:53:28,881 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-08-27 03:53:28,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-08-27 03:53:28,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:28,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-08-27 03:53:28,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,884 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,885 INFO L175 Difference]: Start difference. First operand has 36 places, 16 transitions, 83 flow. Second operand 4 states and 389 transitions. [2023-08-27 03:53:28,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 163 flow [2023-08-27 03:53:28,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 25 transitions, 126 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-08-27 03:53:28,888 INFO L231 Difference]: Finished difference. Result has 30 places, 16 transitions, 72 flow [2023-08-27 03:53:28,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=16} [2023-08-27 03:53:28,889 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2023-08-27 03:53:28,889 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 16 transitions, 72 flow [2023-08-27 03:53:28,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:28,890 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:28,890 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:28,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:53:28,891 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-08-27 03:53:28,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:28,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1745038924, now seen corresponding path program 1 times [2023-08-27 03:53:28,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:28,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622943822] [2023-08-27 03:53:28,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:28,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:53:29,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:53:29,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:53:29,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622943822] [2023-08-27 03:53:29,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622943822] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:53:29,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:53:29,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:53:29,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181682464] [2023-08-27 03:53:29,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:53:29,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:53:29,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:53:29,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:53:29,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:53:29,068 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 214 [2023-08-27 03:53:29,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 16 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:29,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:53:29,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 214 [2023-08-27 03:53:29,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:53:29,118 INFO L124 PetriNetUnfolderBase]: 10/36 cut-off events. [2023-08-27 03:53:29,118 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-27 03:53:29,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 36 events. 10/36 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 53 event pairs, 2 based on Foata normal form. 5/40 useless extension candidates. Maximal degree in co-relation 113. Up to 16 conditions per place. [2023-08-27 03:53:29,118 INFO L140 encePairwiseOnDemand]: 209/214 looper letters, 12 selfloop transitions, 6 changer transitions 1/21 dead transitions. [2023-08-27 03:53:29,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 21 transitions, 127 flow [2023-08-27 03:53:29,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:53:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:53:29,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 476 transitions. [2023-08-27 03:53:29,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44485981308411215 [2023-08-27 03:53:29,123 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 476 transitions. [2023-08-27 03:53:29,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 476 transitions. [2023-08-27 03:53:29,123 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:53:29,123 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 476 transitions. [2023-08-27 03:53:29,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:29,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:29,126 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:29,126 INFO L175 Difference]: Start difference. First operand has 30 places, 16 transitions, 72 flow. Second operand 5 states and 476 transitions. [2023-08-27 03:53:29,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 21 transitions, 127 flow [2023-08-27 03:53:29,127 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 21 transitions, 101 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-08-27 03:53:29,128 INFO L231 Difference]: Finished difference. Result has 30 places, 16 transitions, 72 flow [2023-08-27 03:53:29,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=16, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=72, PETRI_PLACES=30, PETRI_TRANSITIONS=16} [2023-08-27 03:53:29,131 INFO L281 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2023-08-27 03:53:29,131 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 16 transitions, 72 flow [2023-08-27 03:53:29,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:53:29,131 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:53:29,131 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:29,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:53:29,131 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 7 more)] === [2023-08-27 03:53:29,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:53:29,132 INFO L85 PathProgramCache]: Analyzing trace with hash -173228735, now seen corresponding path program 1 times [2023-08-27 03:53:29,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:53:29,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774387748] [2023-08-27 03:53:29,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:53:29,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:53:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:53:29,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:53:29,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:53:29,257 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:53:29,257 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:53:29,258 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (10 of 11 remaining) [2023-08-27 03:53:29,259 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2023-08-27 03:53:29,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2023-08-27 03:53:29,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2023-08-27 03:53:29,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2023-08-27 03:53:29,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 11 remaining) [2023-08-27 03:53:29,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 11 remaining) [2023-08-27 03:53:29,260 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2023-08-27 03:53:29,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2023-08-27 03:53:29,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2023-08-27 03:53:29,261 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2023-08-27 03:53:29,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:53:29,261 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:53:29,266 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:53:29,266 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:53:29,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:53:29 BasicIcfg [2023-08-27 03:53:29,309 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:53:29,310 INFO L158 Benchmark]: Toolchain (without parser) took 10626.35ms. Allocated memory was 352.3MB in the beginning and 564.1MB in the end (delta: 211.8MB). Free memory was 327.4MB in the beginning and 359.4MB in the end (delta: -32.0MB). Peak memory consumption was 179.2MB. Max. memory is 16.0GB. [2023-08-27 03:53:29,310 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 352.3MB. Free memory is still 328.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:53:29,310 INFO L158 Benchmark]: CACSL2BoogieTranslator took 528.15ms. Allocated memory is still 352.3MB. Free memory was 327.4MB in the beginning and 304.9MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. [2023-08-27 03:53:29,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.69ms. Allocated memory is still 352.3MB. Free memory was 304.9MB in the beginning and 302.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 03:53:29,311 INFO L158 Benchmark]: Boogie Preprocessor took 37.02ms. Allocated memory is still 352.3MB. Free memory was 302.2MB in the beginning and 300.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:53:29,311 INFO L158 Benchmark]: RCFGBuilder took 696.81ms. Allocated memory is still 352.3MB. Free memory was 300.6MB in the beginning and 307.0MB in the end (delta: -6.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-27 03:53:29,311 INFO L158 Benchmark]: TraceAbstraction took 9278.15ms. Allocated memory was 352.3MB in the beginning and 564.1MB in the end (delta: 211.8MB). Free memory was 305.9MB in the beginning and 359.4MB in the end (delta: -53.5MB). Peak memory consumption was 158.3MB. Max. memory is 16.0GB. [2023-08-27 03:53:29,313 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 352.3MB. Free memory is still 328.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 528.15ms. Allocated memory is still 352.3MB. Free memory was 327.4MB in the beginning and 304.9MB in the end (delta: 22.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 64.69ms. Allocated memory is still 352.3MB. Free memory was 304.9MB in the beginning and 302.2MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.02ms. Allocated memory is still 352.3MB. Free memory was 302.2MB in the beginning and 300.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.0GB. * RCFGBuilder took 696.81ms. Allocated memory is still 352.3MB. Free memory was 300.6MB in the beginning and 307.0MB in the end (delta: -6.4MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 9278.15ms. Allocated memory was 352.3MB in the beginning and 564.1MB in the end (delta: 211.8MB). Free memory was 305.9MB in the beginning and 359.4MB in the end (delta: -53.5MB). Peak memory consumption was 158.3MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 113 PlacesBefore, 26 PlacesAfterwards, 109 TransitionsBefore, 19 TransitionsAfterwards, 1310 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 103 TotalNumberOfCompositions, 4032 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2073, independent: 1888, independent conditional: 0, independent unconditional: 1888, dependent: 185, dependent conditional: 0, dependent unconditional: 185, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 750, independent: 709, independent conditional: 0, independent unconditional: 709, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2073, independent: 1179, independent conditional: 0, independent unconditional: 1179, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 750, unknown conditional: 0, unknown unconditional: 750] , Statistics on independence cache: Total cache size (in pairs): 73, Positive cache size: 59, Positive conditional cache size: 0, Positive unconditional cache size: 59, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L712] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L713] 0 int __unbuffered_p0_EAX$mem_tmp; [L714] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L720] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L721] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L722] 0 int __unbuffered_p0_EAX$w_buff0; [L723] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L724] 0 int __unbuffered_p0_EAX$w_buff1; [L725] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L727] 0 int __unbuffered_p1_EAX = 0; [L728] 0 _Bool main$tmp_guard0; [L729] 0 _Bool main$tmp_guard1; [L731] 0 int x = 0; [L733] 0 int y = 0; [L734] 0 _Bool y$flush_delayed; [L735] 0 int y$mem_tmp; [L736] 0 _Bool y$r_buff0_thd0; [L737] 0 _Bool y$r_buff0_thd1; [L738] 0 _Bool y$r_buff0_thd2; [L739] 0 _Bool y$r_buff1_thd0; [L740] 0 _Bool y$r_buff1_thd1; [L741] 0 _Bool y$r_buff1_thd2; [L742] 0 _Bool y$read_delayed; [L743] 0 int *y$read_delayed_var; [L744] 0 int y$w_buff0; [L745] 0 _Bool y$w_buff0_used; [L746] 0 int y$w_buff1; [L747] 0 _Bool y$w_buff1_used; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice1; [L750] 0 _Bool weak$$choice2; [L812] 0 pthread_t t1929; [L813] FCALL, FORK 0 pthread_create(&t1929, ((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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1929, ((void *)0), P0, ((void *)0))=-1, t1929={6: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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}] [L754] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L755] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L756] 1 y$flush_delayed = weak$$choice2 [L757] EXPR 1 \read(y) [L757] 1 y$mem_tmp = y [L758] 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) [L758] EXPR 1 \read(y) [L758] 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) [L758] 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) [L759] 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)) [L760] 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)) [L761] 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)) [L762] 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)) [L763] 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)) [L764] 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)) [L765] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L766] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L767] EXPR 1 \read(y) [L767] 1 __unbuffered_p0_EAX = y [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] EXPR 1 \read(y) [L768] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L768] 1 y = y$flush_delayed ? y$mem_tmp : y [L769] 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] 0 pthread_t t1930; [L815] FCALL, FORK 0 pthread_create(&t1930, ((void *)0), P1, ((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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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_p1_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1930, ((void *)0), P1, ((void *)0))=0, t1929={6:0}, t1930={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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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}] [L772] 1 x = 1 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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_p1_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] 2 __unbuffered_p1_EAX = 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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_p1_EAX=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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}] [L787] 2 y = 1 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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_p1_EAX=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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}] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 \read(y) [L790] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L794] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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_p1_EAX=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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}] [L777] EXPR 1 __unbuffered_cnt + 1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L797] EXPR 2 __unbuffered_cnt + 1 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={6:0}, t1930={5: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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}] [L819] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L819] RET 0 assume_abort_if_not(main$tmp_guard0) [L821] 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) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] EXPR 0 \read(y) [L821] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L821] 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) [L821] 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) [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 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}, __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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1929={6:0}, t1930={5: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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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}] [L828] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L829] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L829] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L829] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L830] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1) [L832] 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", "safe006_rmo.oepc_rmo.opt-thin000_rmo.oepc_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) 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_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=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=1, __unbuffered_p1_EAX=1, 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=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 777]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 797]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 813]: 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: 815]: 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 5 procedures, 130 locations, 11 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: 9.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 1 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=117occurred in iteration=5, InterpolantAutomatonStates: 31, 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.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 367 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:53:29,337 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...