/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/mix004.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:36:21,414 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:36:21,501 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:36:21,506 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:36:21,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:36:21,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:36:21,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:36:21,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:36:21,538 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:36:21,545 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:36:21,545 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:36:21,545 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:36:21,546 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:36:21,547 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:36:21,547 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:36:21,547 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:36:21,547 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:36:21,548 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:36:21,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:36:21,548 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:36:21,548 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:36:21,549 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:36:21,549 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:36:21,549 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:36:21,550 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:36:21,550 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:36:21,550 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:36:21,550 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:36:21,550 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:36:21,551 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:36:21,552 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:36:21,552 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:36:21,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:36:21,552 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:36:21,552 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:36:21,553 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:36:21,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:36:21,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:36:21,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:36:21,855 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:36:21,855 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:36:21,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2023-08-27 03:36:23,052 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:36:23,324 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:36:23,325 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix004.oepc.i [2023-08-27 03:36:23,349 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7da4a3a/189f82925e4e491a8bd66acb2f1252cc/FLAG700700563 [2023-08-27 03:36:23,360 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2e7da4a3a/189f82925e4e491a8bd66acb2f1252cc [2023-08-27 03:36:23,362 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:36:23,364 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:36:23,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:36:23,365 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:36:23,367 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:36:23,368 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,368 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b548f79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23, skipping insertion in model container [2023-08-27 03:36:23,369 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,413 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:36:23,768 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:36:23,783 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:36:23,808 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:36:23,819 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:36:23,864 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:36:23,894 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:36:23,894 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:36:23,899 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:36:23,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23 WrapperNode [2023-08-27 03:36:23,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:36:23,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:36:23,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:36:23,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:36:23,907 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:36:23" (1/1) ... [2023-08-27 03:36:23,920 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:36:23" (1/1) ... [2023-08-27 03:36:23,944 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 155 [2023-08-27 03:36:23,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:36:23,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:36:23,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:36:23,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:36:23,953 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,953 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,967 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,969 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,971 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,973 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:36:23,977 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:36:23,977 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:36:23,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:36:23,978 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (1/1) ... [2023-08-27 03:36:23,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:36:24,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:36:24,027 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:36:24,052 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:36:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:36:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:36:24,067 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:36:24,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:36:24,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:36:24,068 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:36:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:36:24,068 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:36:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:36:24,068 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:36:24,068 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:36:24,069 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:36:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:36:24,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:36:24,069 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:36:24,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:36:24,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:36:24,071 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:36:24,203 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:36:24,205 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:36:24,620 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:36:24,703 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:36:24,703 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:36:24,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:36:24 BoogieIcfgContainer [2023-08-27 03:36:24,705 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:36:24,707 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:36:24,707 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:36:24,709 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:36:24,709 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:36:23" (1/3) ... [2023-08-27 03:36:24,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd52b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:36:24, skipping insertion in model container [2023-08-27 03:36:24,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:36:23" (2/3) ... [2023-08-27 03:36:24,710 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bd52b7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:36:24, skipping insertion in model container [2023-08-27 03:36:24,710 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:36:24" (3/3) ... [2023-08-27 03:36:24,711 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.oepc.i [2023-08-27 03:36:24,726 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:36:24,726 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:36:24,726 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:36:24,782 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:36:24,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 146 transitions, 312 flow [2023-08-27 03:36:24,896 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-08-27 03:36:24,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:36:24,902 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 118 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 03:36:24,903 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 146 transitions, 312 flow [2023-08-27 03:36:24,910 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 152 places, 142 transitions, 296 flow [2023-08-27 03:36:24,913 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:36:24,927 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 152 places, 142 transitions, 296 flow [2023-08-27 03:36:24,931 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 152 places, 142 transitions, 296 flow [2023-08-27 03:36:24,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 142 transitions, 296 flow [2023-08-27 03:36:24,977 INFO L124 PetriNetUnfolderBase]: 3/142 cut-off events. [2023-08-27 03:36:24,977 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:36:24,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155 conditions, 142 events. 3/142 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 116 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2023-08-27 03:36:24,983 INFO L119 LiptonReduction]: Number of co-enabled transitions 4682 [2023-08-27 03:36:29,191 INFO L134 LiptonReduction]: Checked pairs total: 18609 [2023-08-27 03:36:29,191 INFO L136 LiptonReduction]: Total number of compositions: 124 [2023-08-27 03:36:29,202 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:36:29,208 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;@40129c25, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:36:29,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:36:29,210 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:36:29,211 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-27 03:36:29,211 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:36:29,211 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:29,211 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:36:29,212 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:29,216 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash 638551, now seen corresponding path program 1 times [2023-08-27 03:36:29,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:29,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015046994] [2023-08-27 03:36:29,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:29,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:29,605 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:36:29,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:29,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015046994] [2023-08-27 03:36:29,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015046994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:29,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:29,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:36:29,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362419120] [2023-08-27 03:36:29,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:29,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:36:29,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:29,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:36:29,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:36:29,643 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 270 [2023-08-27 03:36:29,647 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:29,647 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:29,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 270 [2023-08-27 03:36:29,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:31,660 INFO L124 PetriNetUnfolderBase]: 12064/17900 cut-off events. [2023-08-27 03:36:31,661 INFO L125 PetriNetUnfolderBase]: For 142/142 co-relation queries the response was YES. [2023-08-27 03:36:31,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34343 conditions, 17900 events. 12064/17900 cut-off events. For 142/142 co-relation queries the response was YES. Maximal size of possible extension queue 859. Compared 123613 event pairs, 1764 based on Foata normal form. 0/14072 useless extension candidates. Maximal degree in co-relation 34331. Up to 13549 conditions per place. [2023-08-27 03:36:31,823 INFO L140 encePairwiseOnDemand]: 266/270 looper letters, 50 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-27 03:36:31,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 61 transitions, 247 flow [2023-08-27 03:36:31,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:36:31,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:36:31,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-08-27 03:36:31,841 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5160493827160494 [2023-08-27 03:36:31,842 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-08-27 03:36:31,843 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-08-27 03:36:31,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:31,848 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-08-27 03:36:31,852 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:31,856 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:31,857 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:31,858 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 418 transitions. [2023-08-27 03:36:31,859 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 61 transitions, 247 flow [2023-08-27 03:36:31,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 240 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:36:31,865 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-27 03:36:31,867 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-27 03:36:31,869 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-27 03:36:31,870 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-27 03:36:31,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:31,870 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:31,870 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:36:31,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:36:31,871 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:31,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:31,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1843680331, now seen corresponding path program 1 times [2023-08-27 03:36:31,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:31,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90463758] [2023-08-27 03:36:31,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:31,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:31,955 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:36:31,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:31,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90463758] [2023-08-27 03:36:31,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90463758] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:31,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:31,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:36:31,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143405044] [2023-08-27 03:36:31,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:31,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:36:31,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:31,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:36:31,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:36:31,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 270 [2023-08-27 03:36:31,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:31,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:31,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 270 [2023-08-27 03:36:31,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:33,593 INFO L124 PetriNetUnfolderBase]: 12225/16909 cut-off events. [2023-08-27 03:36:33,594 INFO L125 PetriNetUnfolderBase]: For 739/739 co-relation queries the response was YES. [2023-08-27 03:36:33,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34799 conditions, 16909 events. 12225/16909 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 97096 event pairs, 3437 based on Foata normal form. 0/11865 useless extension candidates. Maximal degree in co-relation 34789. Up to 14728 conditions per place. [2023-08-27 03:36:33,704 INFO L140 encePairwiseOnDemand]: 257/270 looper letters, 51 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-08-27 03:36:33,704 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 61 transitions, 254 flow [2023-08-27 03:36:33,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:36:33,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:36:33,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-27 03:36:33,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.508641975308642 [2023-08-27 03:36:33,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-27 03:36:33,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-27 03:36:33,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:33,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-27 03:36:33,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:33,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:33,711 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:33,711 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 412 transitions. [2023-08-27 03:36:33,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 61 transitions, 254 flow [2023-08-27 03:36:33,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:36:33,714 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 131 flow [2023-08-27 03:36:33,714 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-27 03:36:33,717 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-27 03:36:33,718 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 131 flow [2023-08-27 03:36:33,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.66666666666667) internal successors, (353), 3 states have internal predecessors, (353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:33,718 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:33,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:33,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:36:33,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:33,724 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:33,724 INFO L85 PathProgramCache]: Analyzing trace with hash -2009451287, now seen corresponding path program 1 times [2023-08-27 03:36:33,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:33,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489077283] [2023-08-27 03:36:33,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:33,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:33,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:34,011 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:36:34,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:34,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489077283] [2023-08-27 03:36:34,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489077283] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:34,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:34,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:36:34,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163715456] [2023-08-27 03:36:34,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:34,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:36:34,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:34,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:36:34,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:36:34,016 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 270 [2023-08-27 03:36:34,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:34,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:34,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 270 [2023-08-27 03:36:34,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:36,432 INFO L124 PetriNetUnfolderBase]: 24630/34850 cut-off events. [2023-08-27 03:36:36,432 INFO L125 PetriNetUnfolderBase]: For 3491/4225 co-relation queries the response was YES. [2023-08-27 03:36:36,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82053 conditions, 34850 events. 24630/34850 cut-off events. For 3491/4225 co-relation queries the response was YES. Maximal size of possible extension queue 1084. Compared 211522 event pairs, 11503 based on Foata normal form. 0/29361 useless extension candidates. Maximal degree in co-relation 82042. Up to 27797 conditions per place. [2023-08-27 03:36:36,662 INFO L140 encePairwiseOnDemand]: 261/270 looper letters, 65 selfloop transitions, 8 changer transitions 0/77 dead transitions. [2023-08-27 03:36:36,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 77 transitions, 381 flow [2023-08-27 03:36:36,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:36:36,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:36:36,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-27 03:36:36,664 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2023-08-27 03:36:36,664 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-27 03:36:36,664 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-27 03:36:36,665 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:36,665 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-27 03:36:36,666 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:36,667 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:36,668 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 270.0) internal successors, (1080), 4 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:36,668 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 131 flow. Second operand 3 states and 396 transitions. [2023-08-27 03:36:36,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 77 transitions, 381 flow [2023-08-27 03:36:36,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 77 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:36:36,673 INFO L231 Difference]: Finished difference. Result has 53 places, 49 transitions, 188 flow [2023-08-27 03:36:36,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=188, PETRI_PLACES=53, PETRI_TRANSITIONS=49} [2023-08-27 03:36:36,675 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 1 predicate places. [2023-08-27 03:36:36,675 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 49 transitions, 188 flow [2023-08-27 03:36:36,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:36,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:36,676 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:36,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:36:36,680 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:36,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:36,680 INFO L85 PathProgramCache]: Analyzing trace with hash -885346807, now seen corresponding path program 1 times [2023-08-27 03:36:36,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:36,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989655316] [2023-08-27 03:36:36,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:36,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:36,761 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:36:36,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:36,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989655316] [2023-08-27 03:36:36,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989655316] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:36,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:36,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:36:36,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338031633] [2023-08-27 03:36:36,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:36,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:36:36,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:36,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:36:36,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:36:36,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 270 [2023-08-27 03:36:36,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 49 transitions, 188 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:36,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:36,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 270 [2023-08-27 03:36:36,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:38,725 INFO L124 PetriNetUnfolderBase]: 16603/23844 cut-off events. [2023-08-27 03:36:38,725 INFO L125 PetriNetUnfolderBase]: For 7137/7853 co-relation queries the response was YES. [2023-08-27 03:36:38,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61304 conditions, 23844 events. 16603/23844 cut-off events. For 7137/7853 co-relation queries the response was YES. Maximal size of possible extension queue 946. Compared 151866 event pairs, 5140 based on Foata normal form. 10/20096 useless extension candidates. Maximal degree in co-relation 61290. Up to 17148 conditions per place. [2023-08-27 03:36:38,859 INFO L140 encePairwiseOnDemand]: 261/270 looper letters, 50 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2023-08-27 03:36:38,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 65 transitions, 340 flow [2023-08-27 03:36:38,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:36:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:36:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 520 transitions. [2023-08-27 03:36:38,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2023-08-27 03:36:38,863 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 520 transitions. [2023-08-27 03:36:38,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 520 transitions. [2023-08-27 03:36:38,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:38,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 520 transitions. [2023-08-27 03:36:38,864 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:38,866 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:38,867 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:38,867 INFO L175 Difference]: Start difference. First operand has 53 places, 49 transitions, 188 flow. Second operand 4 states and 520 transitions. [2023-08-27 03:36:38,867 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 65 transitions, 340 flow [2023-08-27 03:36:38,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:36:38,936 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 166 flow [2023-08-27 03:36:38,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-08-27 03:36:38,937 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-27 03:36:38,937 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 166 flow [2023-08-27 03:36:38,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:38,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:38,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:38,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:36:38,938 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:38,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1180806582, now seen corresponding path program 1 times [2023-08-27 03:36:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612623297] [2023-08-27 03:36:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:38,990 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:36:38,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:38,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612623297] [2023-08-27 03:36:38,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612623297] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:38,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:38,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:36:38,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795109162] [2023-08-27 03:36:38,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:38,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:36:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:38,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:36:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:36:38,992 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 270 [2023-08-27 03:36:38,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 166 flow. Second operand has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:38,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:38,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 270 [2023-08-27 03:36:38,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:40,578 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([479] L833-->L849: Formula: (let ((.cse3 (= (mod v_~a$r_buff1_thd4~0_48 256) 0)) (.cse10 (= (mod v_~a$r_buff0_thd4~0_48 256) 0))) (let ((.cse11 (not .cse10)) (.cse7 (and (= (mod v_~a$w_buff1_used~0_125 256) 0) .cse10)) (.cse8 (and .cse3 .cse10)) (.cse12 (= (mod v_~a$w_buff0_used~0_136 256) 0))) (let ((.cse5 (or .cse7 .cse8 .cse12)) (.cse6 (and .cse11 (not .cse12)))) (let ((.cse9 (ite .cse5 v_~a~0_100 (ite .cse6 v_~a$w_buff0~0_59 v_~a$w_buff1~0_52))) (.cse0 (not (= (mod v_~weak$$choice2~0_28 256) 0))) (.cse2 (= (mod v_~a$w_buff1_used~0_124 256) 0)) (.cse4 (= (mod v_~a$w_buff0_used~0_135 256) 0))) (and (= (ite .cse0 v_~a$r_buff1_thd4~0_48 (ite (let ((.cse1 (= (mod v_~a$r_buff0_thd4~0_47 256) 0))) (or (and .cse1 .cse2) (and .cse3 .cse1) .cse4)) v_~a$r_buff1_thd4~0_48 0)) v_~a$r_buff1_thd4~0_47) (= (ite .cse0 v_~a$w_buff0_used~0_136 (ite .cse5 v_~a$w_buff0_used~0_136 (ite .cse6 0 v_~a$w_buff0_used~0_136))) v_~a$w_buff0_used~0_135) (= v_~a$w_buff1_used~0_124 (ite .cse0 v_~a$w_buff1_used~0_125 (ite (or .cse7 .cse8 .cse4) v_~a$w_buff1_used~0_125 0))) (= v_~a~0_98 (ite .cse0 v_~a$mem_tmp~0_20 .cse9)) (= v_~a$w_buff1~0_52 v_~a$w_buff1~0_51) (= v_~a$w_buff0~0_59 v_~a$w_buff0~0_58) (= v_~a$flush_delayed~0_33 0) (= v_~a~0_100 v_~a$mem_tmp~0_20) (= .cse9 v_~__unbuffered_p3_EBX~0_12) (= v_~a$r_buff0_thd4~0_47 (ite .cse0 v_~a$r_buff0_thd4~0_48 (ite (or (and .cse10 .cse2) .cse8 .cse4) v_~a$r_buff0_thd4~0_48 (ite (and .cse11 (not .cse4)) 0 v_~a$r_buff0_thd4~0_48))))))))) InVars {~a~0=v_~a~0_100, ~a$w_buff1~0=v_~a$w_buff1~0_52, ~a$w_buff0~0=v_~a$w_buff0~0_59, ~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_48, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_136, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_125, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_48} OutVars{~a$r_buff1_thd4~0=v_~a$r_buff1_thd4~0_47, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_135, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_12, ~a$r_buff0_thd4~0=v_~a$r_buff0_thd4~0_47, ~a~0=v_~a~0_98, ~a$mem_tmp~0=v_~a$mem_tmp~0_20, ~weak$$choice0~0=v_~weak$$choice0~0_9, ~a$w_buff1~0=v_~a$w_buff1~0_51, ~a$flush_delayed~0=v_~a$flush_delayed~0_33, ~a$w_buff0~0=v_~a$w_buff0~0_58, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_124, ~weak$$choice2~0=v_~weak$$choice2~0_28, P3Thread1of1ForFork0_#t~nondet3=|v_P3Thread1of1ForFork0_#t~nondet3_1|, P3Thread1of1ForFork0_#t~nondet4=|v_P3Thread1of1ForFork0_#t~nondet4_1|} AuxVars[] AssignedVars[~a$r_buff1_thd4~0, ~a$w_buff0_used~0, ~__unbuffered_p3_EBX~0, ~a$r_buff0_thd4~0, ~a~0, ~a$mem_tmp~0, ~weak$$choice0~0, ~a$w_buff1~0, ~a$flush_delayed~0, ~a$w_buff0~0, ~a$w_buff1_used~0, ~weak$$choice2~0, P3Thread1of1ForFork0_#t~nondet3, P3Thread1of1ForFork0_#t~nondet4][78], [99#ULTIMATE.startErr0ASSERT_VIOLATIONASSERTtrue, Black: 165#(= ~__unbuffered_cnt~0 0), 105#P1EXITtrue, Black: 170#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 1)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p0_EAX~0 0))), 125#P0EXITtrue, 116#L849true, 177#(<= 1 ~__unbuffered_cnt~0), 101#L813true, 179#true, P3Thread1of1ForFork0InUse, P0Thread1of1ForFork3InUse, P1Thread1of1ForFork1InUse, P2Thread1of1ForFork2InUse]) [2023-08-27 03:36:40,578 INFO L294 olderBase$Statistics]: this new event has 25 ancestors and is cut-off event [2023-08-27 03:36:40,578 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-27 03:36:40,578 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-27 03:36:40,578 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-27 03:36:40,732 INFO L124 PetriNetUnfolderBase]: 12367/17768 cut-off events. [2023-08-27 03:36:40,733 INFO L125 PetriNetUnfolderBase]: For 6022/6449 co-relation queries the response was YES. [2023-08-27 03:36:40,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45243 conditions, 17768 events. 12367/17768 cut-off events. For 6022/6449 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 110187 event pairs, 4167 based on Foata normal form. 9/15575 useless extension candidates. Maximal degree in co-relation 45229. Up to 6801 conditions per place. [2023-08-27 03:36:40,984 INFO L140 encePairwiseOnDemand]: 261/270 looper letters, 68 selfloop transitions, 9 changer transitions 0/87 dead transitions. [2023-08-27 03:36:40,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 87 transitions, 438 flow [2023-08-27 03:36:40,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:36:40,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:36:40,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2023-08-27 03:36:40,986 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5009259259259259 [2023-08-27 03:36:40,987 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2023-08-27 03:36:40,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2023-08-27 03:36:40,987 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:40,987 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2023-08-27 03:36:40,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:40,990 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:40,991 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:40,991 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 166 flow. Second operand 4 states and 541 transitions. [2023-08-27 03:36:40,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 87 transitions, 438 flow [2023-08-27 03:36:40,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 87 transitions, 432 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:36:40,995 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 218 flow [2023-08-27 03:36:40,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=218, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2023-08-27 03:36:40,996 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 0 predicate places. [2023-08-27 03:36:40,996 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 218 flow [2023-08-27 03:36:40,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.5) internal successors, (474), 4 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:40,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:40,997 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:40,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:36:40,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:40,997 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:40,998 INFO L85 PathProgramCache]: Analyzing trace with hash 2097623794, now seen corresponding path program 1 times [2023-08-27 03:36:40,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:40,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442704661] [2023-08-27 03:36:40,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:40,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:41,160 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:36:41,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:41,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442704661] [2023-08-27 03:36:41,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442704661] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:41,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:36:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269995218] [2023-08-27 03:36:41,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:41,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:36:41,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:41,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:36:41,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:36:41,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 270 [2023-08-27 03:36:41,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 218 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:41,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:41,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 270 [2023-08-27 03:36:41,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:42,584 INFO L124 PetriNetUnfolderBase]: 16191/22020 cut-off events. [2023-08-27 03:36:42,584 INFO L125 PetriNetUnfolderBase]: For 17327/17327 co-relation queries the response was YES. [2023-08-27 03:36:42,624 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64326 conditions, 22020 events. 16191/22020 cut-off events. For 17327/17327 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 111146 event pairs, 4482 based on Foata normal form. 0/20942 useless extension candidates. Maximal degree in co-relation 64311. Up to 13447 conditions per place. [2023-08-27 03:36:42,680 INFO L140 encePairwiseOnDemand]: 261/270 looper letters, 92 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2023-08-27 03:36:42,680 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 101 transitions, 675 flow [2023-08-27 03:36:42,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:36:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:36:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-27 03:36:42,682 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4759259259259259 [2023-08-27 03:36:42,682 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-27 03:36:42,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-27 03:36:42,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:42,683 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-27 03:36:42,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:42,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:42,686 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:42,686 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 218 flow. Second operand 4 states and 514 transitions. [2023-08-27 03:36:42,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 101 transitions, 675 flow [2023-08-27 03:36:42,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 101 transitions, 629 flow, removed 11 selfloop flow, removed 2 redundant places. [2023-08-27 03:36:42,700 INFO L231 Difference]: Finished difference. Result has 56 places, 54 transitions, 268 flow [2023-08-27 03:36:42,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=268, PETRI_PLACES=56, PETRI_TRANSITIONS=54} [2023-08-27 03:36:42,701 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-27 03:36:42,701 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 54 transitions, 268 flow [2023-08-27 03:36:42,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:42,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:42,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:42,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:36:42,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:42,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:42,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1599611697, now seen corresponding path program 1 times [2023-08-27 03:36:42,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:42,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782526429] [2023-08-27 03:36:42,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:42,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:42,861 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:36:42,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:42,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782526429] [2023-08-27 03:36:42,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782526429] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:42,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:42,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:36:42,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422336100] [2023-08-27 03:36:42,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:42,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:36:42,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:42,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:36:42,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:36:42,863 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 270 [2023-08-27 03:36:42,864 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 54 transitions, 268 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:42,864 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:42,864 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 270 [2023-08-27 03:36:42,864 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:44,592 INFO L124 PetriNetUnfolderBase]: 15509/21132 cut-off events. [2023-08-27 03:36:44,593 INFO L125 PetriNetUnfolderBase]: For 16697/16697 co-relation queries the response was YES. [2023-08-27 03:36:44,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64002 conditions, 21132 events. 15509/21132 cut-off events. For 16697/16697 co-relation queries the response was YES. Maximal size of possible extension queue 585. Compared 108169 event pairs, 4196 based on Foata normal form. 206/20924 useless extension candidates. Maximal degree in co-relation 63984. Up to 13291 conditions per place. [2023-08-27 03:36:44,735 INFO L140 encePairwiseOnDemand]: 261/270 looper letters, 97 selfloop transitions, 14 changer transitions 0/111 dead transitions. [2023-08-27 03:36:44,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 111 transitions, 765 flow [2023-08-27 03:36:44,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:36:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:36:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 516 transitions. [2023-08-27 03:36:44,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4777777777777778 [2023-08-27 03:36:44,737 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 516 transitions. [2023-08-27 03:36:44,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 516 transitions. [2023-08-27 03:36:44,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:44,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 516 transitions. [2023-08-27 03:36:44,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.0) internal successors, (516), 4 states have internal predecessors, (516), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:44,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:44,741 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:44,741 INFO L175 Difference]: Start difference. First operand has 56 places, 54 transitions, 268 flow. Second operand 4 states and 516 transitions. [2023-08-27 03:36:44,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 111 transitions, 765 flow [2023-08-27 03:36:44,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 111 transitions, 760 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:36:44,787 INFO L231 Difference]: Finished difference. Result has 61 places, 62 transitions, 396 flow [2023-08-27 03:36:44,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=61, PETRI_TRANSITIONS=62} [2023-08-27 03:36:44,788 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 9 predicate places. [2023-08-27 03:36:44,788 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 62 transitions, 396 flow [2023-08-27 03:36:44,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:44,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:44,788 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:44,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:36:44,788 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:44,789 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:44,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1945706337, now seen corresponding path program 1 times [2023-08-27 03:36:44,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:44,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610786820] [2023-08-27 03:36:44,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:44,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:44,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:44,915 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:36:44,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:44,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610786820] [2023-08-27 03:36:44,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610786820] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:44,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:44,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:36:44,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432715191] [2023-08-27 03:36:44,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:44,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:36:44,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:44,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:36:44,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:36:44,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 270 [2023-08-27 03:36:44,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 62 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:44,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:44,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 270 [2023-08-27 03:36:44,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:45,995 INFO L124 PetriNetUnfolderBase]: 8256/12537 cut-off events. [2023-08-27 03:36:45,995 INFO L125 PetriNetUnfolderBase]: For 12127/12638 co-relation queries the response was YES. [2023-08-27 03:36:46,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37386 conditions, 12537 events. 8256/12537 cut-off events. For 12127/12638 co-relation queries the response was YES. Maximal size of possible extension queue 551. Compared 78423 event pairs, 1807 based on Foata normal form. 797/12484 useless extension candidates. Maximal degree in co-relation 37364. Up to 8425 conditions per place. [2023-08-27 03:36:46,060 INFO L140 encePairwiseOnDemand]: 263/270 looper letters, 82 selfloop transitions, 10 changer transitions 0/111 dead transitions. [2023-08-27 03:36:46,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 111 transitions, 748 flow [2023-08-27 03:36:46,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:36:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:36:46,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2023-08-27 03:36:46,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4748148148148148 [2023-08-27 03:36:46,062 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2023-08-27 03:36:46,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2023-08-27 03:36:46,062 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:46,062 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2023-08-27 03:36:46,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:46,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:46,066 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:46,066 INFO L175 Difference]: Start difference. First operand has 61 places, 62 transitions, 396 flow. Second operand 5 states and 641 transitions. [2023-08-27 03:36:46,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 111 transitions, 748 flow [2023-08-27 03:36:46,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 111 transitions, 744 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:36:46,088 INFO L231 Difference]: Finished difference. Result has 67 places, 66 transitions, 459 flow [2023-08-27 03:36:46,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=459, PETRI_PLACES=67, PETRI_TRANSITIONS=66} [2023-08-27 03:36:46,089 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-27 03:36:46,089 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 66 transitions, 459 flow [2023-08-27 03:36:46,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.25) internal successors, (461), 4 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:46,089 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:46,089 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:46,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:36:46,089 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:46,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:46,090 INFO L85 PathProgramCache]: Analyzing trace with hash 377962638, now seen corresponding path program 1 times [2023-08-27 03:36:46,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:46,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105797777] [2023-08-27 03:36:46,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:46,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:46,261 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:36:46,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:46,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105797777] [2023-08-27 03:36:46,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105797777] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:46,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:46,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:36:46,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019645124] [2023-08-27 03:36:46,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:46,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:36:46,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:46,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:36:46,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:36:46,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 270 [2023-08-27 03:36:46,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 66 transitions, 459 flow. Second operand has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:46,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:46,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 270 [2023-08-27 03:36:46,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:47,062 INFO L124 PetriNetUnfolderBase]: 5622/8925 cut-off events. [2023-08-27 03:36:47,063 INFO L125 PetriNetUnfolderBase]: For 11014/11153 co-relation queries the response was YES. [2023-08-27 03:36:47,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28735 conditions, 8925 events. 5622/8925 cut-off events. For 11014/11153 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 56915 event pairs, 1159 based on Foata normal form. 506/8639 useless extension candidates. Maximal degree in co-relation 28709. Up to 2836 conditions per place. [2023-08-27 03:36:47,113 INFO L140 encePairwiseOnDemand]: 263/270 looper letters, 96 selfloop transitions, 19 changer transitions 0/134 dead transitions. [2023-08-27 03:36:47,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 134 transitions, 887 flow [2023-08-27 03:36:47,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:36:47,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:36:47,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 896 transitions. [2023-08-27 03:36:47,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4740740740740741 [2023-08-27 03:36:47,116 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 896 transitions. [2023-08-27 03:36:47,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 896 transitions. [2023-08-27 03:36:47,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:47,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 896 transitions. [2023-08-27 03:36:47,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.0) internal successors, (896), 7 states have internal predecessors, (896), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:47,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:47,121 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:47,121 INFO L175 Difference]: Start difference. First operand has 67 places, 66 transitions, 459 flow. Second operand 7 states and 896 transitions. [2023-08-27 03:36:47,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 134 transitions, 887 flow [2023-08-27 03:36:47,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 134 transitions, 873 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:36:47,235 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 531 flow [2023-08-27 03:36:47,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=531, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2023-08-27 03:36:47,236 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-27 03:36:47,236 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 531 flow [2023-08-27 03:36:47,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.0) internal successors, (575), 5 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:47,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:47,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:47,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:36:47,237 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:47,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:47,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1775623048, now seen corresponding path program 1 times [2023-08-27 03:36:47,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:47,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713768346] [2023-08-27 03:36:47,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:47,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:47,313 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:36:47,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:47,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713768346] [2023-08-27 03:36:47,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713768346] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:47,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:47,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:36:47,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823139503] [2023-08-27 03:36:47,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:47,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:36:47,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:47,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:36:47,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:36:47,315 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 270 [2023-08-27 03:36:47,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 531 flow. Second operand has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:47,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:47,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 270 [2023-08-27 03:36:47,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:48,033 INFO L124 PetriNetUnfolderBase]: 5110/7994 cut-off events. [2023-08-27 03:36:48,033 INFO L125 PetriNetUnfolderBase]: For 14380/14514 co-relation queries the response was YES. [2023-08-27 03:36:48,057 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28178 conditions, 7994 events. 5110/7994 cut-off events. For 14380/14514 co-relation queries the response was YES. Maximal size of possible extension queue 351. Compared 49274 event pairs, 1416 based on Foata normal form. 0/7674 useless extension candidates. Maximal degree in co-relation 28149. Up to 2754 conditions per place. [2023-08-27 03:36:48,079 INFO L140 encePairwiseOnDemand]: 261/270 looper letters, 81 selfloop transitions, 21 changer transitions 0/121 dead transitions. [2023-08-27 03:36:48,080 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 121 transitions, 923 flow [2023-08-27 03:36:48,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:36:48,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:36:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 670 transitions. [2023-08-27 03:36:48,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4962962962962963 [2023-08-27 03:36:48,082 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 670 transitions. [2023-08-27 03:36:48,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 670 transitions. [2023-08-27 03:36:48,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:48,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 670 transitions. [2023-08-27 03:36:48,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.0) internal successors, (670), 5 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:48,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:48,086 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 270.0) internal successors, (1620), 6 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:48,086 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 531 flow. Second operand 5 states and 670 transitions. [2023-08-27 03:36:48,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 121 transitions, 923 flow [2023-08-27 03:36:48,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 121 transitions, 889 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-27 03:36:48,236 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 591 flow [2023-08-27 03:36:48,236 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=591, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2023-08-27 03:36:48,237 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 23 predicate places. [2023-08-27 03:36:48,237 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 591 flow [2023-08-27 03:36:48,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.0) internal successors, (595), 5 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:48,237 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:48,237 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:48,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:36:48,237 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:48,238 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:48,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1050025568, now seen corresponding path program 1 times [2023-08-27 03:36:48,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:48,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001470406] [2023-08-27 03:36:48,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:48,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:48,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:48,477 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:36:48,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:48,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001470406] [2023-08-27 03:36:48,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001470406] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:48,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:48,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:36:48,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129051733] [2023-08-27 03:36:48,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:48,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:36:48,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:48,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:36:48,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:36:48,480 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 270 [2023-08-27 03:36:48,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:48,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:48,481 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 270 [2023-08-27 03:36:48,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:49,793 INFO L124 PetriNetUnfolderBase]: 11231/16329 cut-off events. [2023-08-27 03:36:49,793 INFO L125 PetriNetUnfolderBase]: For 37429/37429 co-relation queries the response was YES. [2023-08-27 03:36:49,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61344 conditions, 16329 events. 11231/16329 cut-off events. For 37429/37429 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 94855 event pairs, 588 based on Foata normal form. 70/16335 useless extension candidates. Maximal degree in co-relation 61314. Up to 8640 conditions per place. [2023-08-27 03:36:49,878 INFO L140 encePairwiseOnDemand]: 260/270 looper letters, 177 selfloop transitions, 32 changer transitions 4/213 dead transitions. [2023-08-27 03:36:49,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 213 transitions, 1995 flow [2023-08-27 03:36:49,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:36:49,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:36:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2023-08-27 03:36:49,880 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47530864197530864 [2023-08-27 03:36:49,880 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2023-08-27 03:36:49,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2023-08-27 03:36:49,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:49,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2023-08-27 03:36:49,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:49,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:49,885 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:49,885 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 591 flow. Second operand 6 states and 770 transitions. [2023-08-27 03:36:49,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 213 transitions, 1995 flow [2023-08-27 03:36:50,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 213 transitions, 1837 flow, removed 36 selfloop flow, removed 3 redundant places. [2023-08-27 03:36:50,300 INFO L231 Difference]: Finished difference. Result has 80 places, 100 transitions, 922 flow [2023-08-27 03:36:50,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=922, PETRI_PLACES=80, PETRI_TRANSITIONS=100} [2023-08-27 03:36:50,300 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 28 predicate places. [2023-08-27 03:36:50,301 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 100 transitions, 922 flow [2023-08-27 03:36:50,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:50,301 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:50,301 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:50,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:36:50,301 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:50,302 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:50,302 INFO L85 PathProgramCache]: Analyzing trace with hash -487728485, now seen corresponding path program 1 times [2023-08-27 03:36:50,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:50,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785707814] [2023-08-27 03:36:50,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:50,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:50,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:50,526 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:36:50,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:50,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785707814] [2023-08-27 03:36:50,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785707814] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:50,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:50,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:36:50,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671723303] [2023-08-27 03:36:50,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:50,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:36:50,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:50,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:36:50,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:36:50,528 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 270 [2023-08-27 03:36:50,529 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 100 transitions, 922 flow. Second operand has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:50,529 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:50,529 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 270 [2023-08-27 03:36:50,529 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:52,463 INFO L124 PetriNetUnfolderBase]: 15693/23082 cut-off events. [2023-08-27 03:36:52,464 INFO L125 PetriNetUnfolderBase]: For 48145/48145 co-relation queries the response was YES. [2023-08-27 03:36:52,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85400 conditions, 23082 events. 15693/23082 cut-off events. For 48145/48145 co-relation queries the response was YES. Maximal size of possible extension queue 760. Compared 143019 event pairs, 950 based on Foata normal form. 80/23036 useless extension candidates. Maximal degree in co-relation 85367. Up to 11831 conditions per place. [2023-08-27 03:36:52,640 INFO L140 encePairwiseOnDemand]: 260/270 looper letters, 171 selfloop transitions, 63 changer transitions 4/238 dead transitions. [2023-08-27 03:36:52,640 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 238 transitions, 2420 flow [2023-08-27 03:36:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:36:52,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:36:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-08-27 03:36:52,642 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47098765432098766 [2023-08-27 03:36:52,642 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-08-27 03:36:52,642 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-08-27 03:36:52,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:52,643 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-08-27 03:36:52,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:52,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:52,647 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 270.0) internal successors, (1890), 7 states have internal predecessors, (1890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:52,647 INFO L175 Difference]: Start difference. First operand has 80 places, 100 transitions, 922 flow. Second operand 6 states and 763 transitions. [2023-08-27 03:36:52,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 238 transitions, 2420 flow [2023-08-27 03:36:53,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 238 transitions, 2404 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-08-27 03:36:53,594 INFO L231 Difference]: Finished difference. Result has 88 places, 132 transitions, 1552 flow [2023-08-27 03:36:53,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1552, PETRI_PLACES=88, PETRI_TRANSITIONS=132} [2023-08-27 03:36:53,595 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2023-08-27 03:36:53,595 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 132 transitions, 1552 flow [2023-08-27 03:36:53,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.2) internal successors, (561), 5 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:53,595 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:53,595 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:53,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:36:53,595 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:53,596 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:53,596 INFO L85 PathProgramCache]: Analyzing trace with hash 841351139, now seen corresponding path program 2 times [2023-08-27 03:36:53,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:53,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278682353] [2023-08-27 03:36:53,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:53,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:53,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:53,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:36:53,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:53,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278682353] [2023-08-27 03:36:53,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278682353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:53,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:53,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:36:53,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351507719] [2023-08-27 03:36:53,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:53,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:36:53,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:53,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:36:53,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:36:53,794 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 270 [2023-08-27 03:36:53,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 132 transitions, 1552 flow. Second operand has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:53,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:53,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 270 [2023-08-27 03:36:53,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:36:55,810 INFO L124 PetriNetUnfolderBase]: 9310/14698 cut-off events. [2023-08-27 03:36:55,811 INFO L125 PetriNetUnfolderBase]: For 26649/26999 co-relation queries the response was YES. [2023-08-27 03:36:55,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51559 conditions, 14698 events. 9310/14698 cut-off events. For 26649/26999 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 102956 event pairs, 1199 based on Foata normal form. 385/14665 useless extension candidates. Maximal degree in co-relation 51521. Up to 3524 conditions per place. [2023-08-27 03:36:55,932 INFO L140 encePairwiseOnDemand]: 263/270 looper letters, 129 selfloop transitions, 28 changer transitions 4/194 dead transitions. [2023-08-27 03:36:55,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 194 transitions, 1737 flow [2023-08-27 03:36:55,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:36:55,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:36:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1149 transitions. [2023-08-27 03:36:55,937 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4728395061728395 [2023-08-27 03:36:55,937 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1149 transitions. [2023-08-27 03:36:55,937 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1149 transitions. [2023-08-27 03:36:55,937 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:36:55,937 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1149 transitions. [2023-08-27 03:36:55,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.66666666666667) internal successors, (1149), 9 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:55,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:55,943 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 270.0) internal successors, (2700), 10 states have internal predecessors, (2700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:55,943 INFO L175 Difference]: Start difference. First operand has 88 places, 132 transitions, 1552 flow. Second operand 9 states and 1149 transitions. [2023-08-27 03:36:55,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 194 transitions, 1737 flow [2023-08-27 03:36:57,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 194 transitions, 1683 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-08-27 03:36:57,410 INFO L231 Difference]: Finished difference. Result has 98 places, 107 transitions, 1143 flow [2023-08-27 03:36:57,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=1037, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1143, PETRI_PLACES=98, PETRI_TRANSITIONS=107} [2023-08-27 03:36:57,411 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 46 predicate places. [2023-08-27 03:36:57,411 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 107 transitions, 1143 flow [2023-08-27 03:36:57,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.0) internal successors, (690), 6 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:57,411 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:36:57,412 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:36:57,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:36:57,412 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:36:57,412 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:36:57,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2091096586, now seen corresponding path program 1 times [2023-08-27 03:36:57,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:36:57,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179193129] [2023-08-27 03:36:57,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:36:57,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:36:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:36:58,174 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:36:58,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:36:58,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179193129] [2023-08-27 03:36:58,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179193129] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:36:58,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:36:58,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:36:58,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852130550] [2023-08-27 03:36:58,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:36:58,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:36:58,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:36:58,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:36:58,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:36:58,176 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 270 [2023-08-27 03:36:58,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 107 transitions, 1143 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:36:58,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:36:58,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 270 [2023-08-27 03:36:58,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:37:00,612 INFO L124 PetriNetUnfolderBase]: 13951/22226 cut-off events. [2023-08-27 03:37:00,612 INFO L125 PetriNetUnfolderBase]: For 69400/69873 co-relation queries the response was YES. [2023-08-27 03:37:00,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89781 conditions, 22226 events. 13951/22226 cut-off events. For 69400/69873 co-relation queries the response was YES. Maximal size of possible extension queue 1261. Compared 167663 event pairs, 2148 based on Foata normal form. 19/21420 useless extension candidates. Maximal degree in co-relation 89739. Up to 13479 conditions per place. [2023-08-27 03:37:00,875 INFO L140 encePairwiseOnDemand]: 262/270 looper letters, 213 selfloop transitions, 12 changer transitions 4/262 dead transitions. [2023-08-27 03:37:00,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 262 transitions, 2827 flow [2023-08-27 03:37:00,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:37:00,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:37:00,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 887 transitions. [2023-08-27 03:37:00,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4693121693121693 [2023-08-27 03:37:00,878 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 887 transitions. [2023-08-27 03:37:00,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 887 transitions. [2023-08-27 03:37:00,878 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:37:00,878 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 887 transitions. [2023-08-27 03:37:00,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.71428571428571) internal successors, (887), 7 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:00,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:00,882 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:00,882 INFO L175 Difference]: Start difference. First operand has 98 places, 107 transitions, 1143 flow. Second operand 7 states and 887 transitions. [2023-08-27 03:37:00,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 262 transitions, 2827 flow [2023-08-27 03:37:04,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 262 transitions, 2613 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-08-27 03:37:04,113 INFO L231 Difference]: Finished difference. Result has 103 places, 119 transitions, 1202 flow [2023-08-27 03:37:04,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1202, PETRI_PLACES=103, PETRI_TRANSITIONS=119} [2023-08-27 03:37:04,114 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 51 predicate places. [2023-08-27 03:37:04,114 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 119 transitions, 1202 flow [2023-08-27 03:37:04,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:04,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:37:04,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:37:04,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:37:04,114 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:37:04,115 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:37:04,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1014006094, now seen corresponding path program 2 times [2023-08-27 03:37:04,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:37:04,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110059000] [2023-08-27 03:37:04,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:37:04,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:37:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:37:04,333 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:37:04,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:37:04,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110059000] [2023-08-27 03:37:04,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110059000] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:37:04,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:37:04,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:37:04,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578899129] [2023-08-27 03:37:04,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:37:04,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:37:04,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:37:04,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:37:04,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:37:04,337 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 270 [2023-08-27 03:37:04,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 119 transitions, 1202 flow. Second operand has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:04,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:37:04,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 270 [2023-08-27 03:37:04,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:37:06,693 INFO L124 PetriNetUnfolderBase]: 13665/21500 cut-off events. [2023-08-27 03:37:06,693 INFO L125 PetriNetUnfolderBase]: For 55356/55817 co-relation queries the response was YES. [2023-08-27 03:37:06,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87729 conditions, 21500 events. 13665/21500 cut-off events. For 55356/55817 co-relation queries the response was YES. Maximal size of possible extension queue 1284. Compared 161538 event pairs, 1114 based on Foata normal form. 119/21199 useless extension candidates. Maximal degree in co-relation 87682. Up to 5505 conditions per place. [2023-08-27 03:37:06,925 INFO L140 encePairwiseOnDemand]: 259/270 looper letters, 102 selfloop transitions, 30 changer transitions 57/200 dead transitions. [2023-08-27 03:37:06,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 200 transitions, 1599 flow [2023-08-27 03:37:06,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 03:37:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 03:37:06,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1374 transitions. [2023-08-27 03:37:06,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4626262626262626 [2023-08-27 03:37:06,929 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1374 transitions. [2023-08-27 03:37:06,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1374 transitions. [2023-08-27 03:37:06,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:37:06,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1374 transitions. [2023-08-27 03:37:06,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 124.9090909090909) internal successors, (1374), 11 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:06,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 270.0) internal successors, (3240), 12 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:06,936 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 270.0) internal successors, (3240), 12 states have internal predecessors, (3240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:06,936 INFO L175 Difference]: Start difference. First operand has 103 places, 119 transitions, 1202 flow. Second operand 11 states and 1374 transitions. [2023-08-27 03:37:06,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 200 transitions, 1599 flow [2023-08-27 03:37:11,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 200 transitions, 1523 flow, removed 7 selfloop flow, removed 8 redundant places. [2023-08-27 03:37:11,845 INFO L231 Difference]: Finished difference. Result has 104 places, 68 transitions, 529 flow [2023-08-27 03:37:11,845 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=529, PETRI_PLACES=104, PETRI_TRANSITIONS=68} [2023-08-27 03:37:11,846 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 52 predicate places. [2023-08-27 03:37:11,846 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 68 transitions, 529 flow [2023-08-27 03:37:11,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:11,846 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:37:11,846 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:37:11,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:37:11,847 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:37:11,847 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:37:11,847 INFO L85 PathProgramCache]: Analyzing trace with hash -553656568, now seen corresponding path program 1 times [2023-08-27 03:37:11,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:37:11,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845841637] [2023-08-27 03:37:11,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:37:11,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:37:11,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:37:12,670 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:37:12,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:37:12,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845841637] [2023-08-27 03:37:12,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845841637] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:37:12,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:37:12,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:37:12,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771796364] [2023-08-27 03:37:12,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:37:12,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 03:37:12,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:37:12,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 03:37:12,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-27 03:37:12,679 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 270 [2023-08-27 03:37:12,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 68 transitions, 529 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:12,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:37:12,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 270 [2023-08-27 03:37:12,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:37:13,846 INFO L124 PetriNetUnfolderBase]: 6186/10088 cut-off events. [2023-08-27 03:37:13,846 INFO L125 PetriNetUnfolderBase]: For 31843/32250 co-relation queries the response was YES. [2023-08-27 03:37:13,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42778 conditions, 10088 events. 6186/10088 cut-off events. For 31843/32250 co-relation queries the response was YES. Maximal size of possible extension queue 580. Compared 70369 event pairs, 1587 based on Foata normal form. 107/9952 useless extension candidates. Maximal degree in co-relation 42745. Up to 4163 conditions per place. [2023-08-27 03:37:13,899 INFO L140 encePairwiseOnDemand]: 264/270 looper letters, 93 selfloop transitions, 6 changer transitions 66/175 dead transitions. [2023-08-27 03:37:13,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 175 transitions, 1763 flow [2023-08-27 03:37:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:37:13,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:37:13,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 840 transitions. [2023-08-27 03:37:13,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2023-08-27 03:37:13,902 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 840 transitions. [2023-08-27 03:37:13,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 840 transitions. [2023-08-27 03:37:13,902 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:37:13,902 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 840 transitions. [2023-08-27 03:37:13,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:13,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:13,906 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 270.0) internal successors, (2160), 8 states have internal predecessors, (2160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:13,907 INFO L175 Difference]: Start difference. First operand has 104 places, 68 transitions, 529 flow. Second operand 7 states and 840 transitions. [2023-08-27 03:37:13,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 175 transitions, 1763 flow [2023-08-27 03:37:14,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 175 transitions, 1362 flow, removed 44 selfloop flow, removed 16 redundant places. [2023-08-27 03:37:14,432 INFO L231 Difference]: Finished difference. Result has 88 places, 64 transitions, 381 flow [2023-08-27 03:37:14,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=381, PETRI_PLACES=88, PETRI_TRANSITIONS=64} [2023-08-27 03:37:14,432 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 36 predicate places. [2023-08-27 03:37:14,432 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 64 transitions, 381 flow [2023-08-27 03:37:14,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:14,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:37:14,433 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:37:14,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:37:14,433 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:37:14,433 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:37:14,433 INFO L85 PathProgramCache]: Analyzing trace with hash 646594678, now seen corresponding path program 2 times [2023-08-27 03:37:14,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:37:14,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490321385] [2023-08-27 03:37:14,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:37:14,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:37:14,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:37:14,607 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:37:14,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:37:14,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490321385] [2023-08-27 03:37:14,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490321385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:37:14,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:37:14,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:37:14,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831785514] [2023-08-27 03:37:14,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:37:14,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:37:14,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:37:14,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:37:14,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:37:14,609 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 270 [2023-08-27 03:37:14,610 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 64 transitions, 381 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:14,610 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:37:14,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 270 [2023-08-27 03:37:14,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:37:15,419 INFO L124 PetriNetUnfolderBase]: 5040/8290 cut-off events. [2023-08-27 03:37:15,419 INFO L125 PetriNetUnfolderBase]: For 16794/16911 co-relation queries the response was YES. [2023-08-27 03:37:15,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29897 conditions, 8290 events. 5040/8290 cut-off events. For 16794/16911 co-relation queries the response was YES. Maximal size of possible extension queue 414. Compared 55347 event pairs, 1469 based on Foata normal form. 1/8137 useless extension candidates. Maximal degree in co-relation 29870. Up to 3930 conditions per place. [2023-08-27 03:37:15,452 INFO L140 encePairwiseOnDemand]: 267/270 looper letters, 42 selfloop transitions, 1 changer transitions 94/141 dead transitions. [2023-08-27 03:37:15,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 141 transitions, 1114 flow [2023-08-27 03:37:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:37:15,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:37:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 527 transitions. [2023-08-27 03:37:15,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487962962962963 [2023-08-27 03:37:15,453 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 527 transitions. [2023-08-27 03:37:15,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 527 transitions. [2023-08-27 03:37:15,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:37:15,454 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 527 transitions. [2023-08-27 03:37:15,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.75) internal successors, (527), 4 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:15,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:15,457 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 270.0) internal successors, (1350), 5 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:15,457 INFO L175 Difference]: Start difference. First operand has 88 places, 64 transitions, 381 flow. Second operand 4 states and 527 transitions. [2023-08-27 03:37:15,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 141 transitions, 1114 flow [2023-08-27 03:37:15,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 141 transitions, 1082 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-27 03:37:15,576 INFO L231 Difference]: Finished difference. Result has 83 places, 43 transitions, 242 flow [2023-08-27 03:37:15,576 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=270, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=242, PETRI_PLACES=83, PETRI_TRANSITIONS=43} [2023-08-27 03:37:15,576 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 31 predicate places. [2023-08-27 03:37:15,576 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 43 transitions, 242 flow [2023-08-27 03:37:15,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:37:15,577 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:37:15,577 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:37:15,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:37:15,578 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:37:15,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:37:15,578 INFO L85 PathProgramCache]: Analyzing trace with hash -861016920, now seen corresponding path program 3 times [2023-08-27 03:37:15,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:37:15,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906538051] [2023-08-27 03:37:15,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:37:15,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:37:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:37:15,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:37:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:37:15,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:37:15,723 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:37:15,724 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:37:15,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 03:37:15,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:37:15,726 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 03:37:15,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:37:15,727 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:37:15,728 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 03:37:15,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:37:15,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 03:37:15,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:37:15,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 03:37:15,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:37:15,729 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:37:15,729 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:37:15,729 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:37:15,735 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:37:15,735 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:37:15,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:37:15 BasicIcfg [2023-08-27 03:37:15,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:37:15,835 INFO L158 Benchmark]: Toolchain (without parser) took 52471.15ms. Allocated memory was 396.4MB in the beginning and 6.9GB in the end (delta: 6.5GB). Free memory was 370.6MB in the beginning and 5.0GB in the end (delta: -4.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2023-08-27 03:37:15,835 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 396.4MB. Free memory is still 372.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:37:15,835 INFO L158 Benchmark]: CACSL2BoogieTranslator took 535.36ms. Allocated memory is still 396.4MB. Free memory was 370.6MB in the beginning and 346.1MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:37:15,835 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.69ms. Allocated memory is still 396.4MB. Free memory was 346.1MB in the beginning and 343.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:37:15,836 INFO L158 Benchmark]: Boogie Preprocessor took 31.61ms. Allocated memory is still 396.4MB. Free memory was 343.9MB in the beginning and 341.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:37:15,836 INFO L158 Benchmark]: RCFGBuilder took 728.02ms. Allocated memory is still 396.4MB. Free memory was 341.8MB in the beginning and 349.2MB in the end (delta: -7.4MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. [2023-08-27 03:37:15,836 INFO L158 Benchmark]: TraceAbstraction took 51127.73ms. Allocated memory was 396.4MB in the beginning and 6.9GB in the end (delta: 6.5GB). Free memory was 348.2MB in the beginning and 5.0GB in the end (delta: -4.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. [2023-08-27 03:37:15,837 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 396.4MB. Free memory is still 372.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 535.36ms. Allocated memory is still 396.4MB. Free memory was 370.6MB in the beginning and 346.1MB in the end (delta: 24.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.69ms. Allocated memory is still 396.4MB. Free memory was 346.1MB in the beginning and 343.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 31.61ms. Allocated memory is still 396.4MB. Free memory was 343.9MB in the beginning and 341.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 728.02ms. Allocated memory is still 396.4MB. Free memory was 341.8MB in the beginning and 349.2MB in the end (delta: -7.4MB). Peak memory consumption was 27.2MB. Max. memory is 16.0GB. * TraceAbstraction took 51127.73ms. Allocated memory was 396.4MB in the beginning and 6.9GB in the end (delta: 6.5GB). Free memory was 348.2MB in the beginning and 5.0GB in the end (delta: -4.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 152 PlacesBefore, 52 PlacesAfterwards, 142 TransitionsBefore, 40 TransitionsAfterwards, 4682 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 61 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 124 TotalNumberOfCompositions, 18609 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6436, independent: 6034, independent conditional: 0, independent unconditional: 6034, dependent: 402, dependent conditional: 0, dependent unconditional: 402, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2580, independent: 2506, independent conditional: 0, independent unconditional: 2506, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6436, independent: 3528, independent conditional: 0, independent unconditional: 3528, dependent: 328, dependent conditional: 0, dependent unconditional: 328, unknown: 2580, unknown conditional: 0, unknown unconditional: 2580] , Statistics on independence cache: Total cache size (in pairs): 273, Positive cache size: 246, Positive conditional cache size: 0, Positive unconditional cache size: 246, Negative cache size: 27, Negative conditional cache size: 0, Negative unconditional cache size: 27, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool a$flush_delayed; [L726] 0 int a$mem_tmp; [L727] 0 _Bool a$r_buff0_thd0; [L728] 0 _Bool a$r_buff0_thd1; [L729] 0 _Bool a$r_buff0_thd2; [L730] 0 _Bool a$r_buff0_thd3; [L731] 0 _Bool a$r_buff0_thd4; [L732] 0 _Bool a$r_buff1_thd0; [L733] 0 _Bool a$r_buff1_thd1; [L734] 0 _Bool a$r_buff1_thd2; [L735] 0 _Bool a$r_buff1_thd3; [L736] 0 _Bool a$r_buff1_thd4; [L737] 0 _Bool a$read_delayed; [L738] 0 int *a$read_delayed_var; [L739] 0 int a$w_buff0; [L740] 0 _Bool a$w_buff0_used; [L741] 0 int a$w_buff1; [L742] 0 _Bool a$w_buff1_used; [L743] 0 _Bool main$tmp_guard0; [L744] 0 _Bool main$tmp_guard1; [L746] 0 int x = 0; [L748] 0 int y = 0; [L750] 0 int z = 0; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L873] 0 pthread_t t89; [L874] FCALL, FORK 0 pthread_create(&t89, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t89, ((void *)0), P0, ((void *)0))=-3, t89={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t90; [L756] 1 a$w_buff1 = a$w_buff0 [L757] 1 a$w_buff0 = 1 [L758] 1 a$w_buff1_used = a$w_buff0_used [L759] 1 a$w_buff0_used = (_Bool)1 [L760] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L760] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L761] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L762] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L763] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L764] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L765] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L766] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L876] FCALL, FORK 0 pthread_create(&t90, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t90, ((void *)0), P1, ((void *)0))=-2, t89={5:0}, t90={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L769] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t91; [L878] FCALL, FORK 0 pthread_create(&t91, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t91, ((void *)0), P2, ((void *)0))=-1, t89={5:0}, t90={6:0}, t91={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L879] 0 pthread_t t92; [L880] FCALL, FORK 0 pthread_create(&t92, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t92, ((void *)0), P3, ((void *)0))=0, t89={5:0}, t90={6:0}, t91={7:0}, t92={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L786] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L789] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L806] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L812] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L829] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L835] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 4 a$flush_delayed = weak$$choice2 [L838] 4 a$mem_tmp = a [L839] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L840] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L841] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L842] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L843] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L845] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L846] 4 __unbuffered_p3_EBX = a [L847] 4 a = a$flush_delayed ? a$mem_tmp : a [L848] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L772] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L773] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L774] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L775] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L776] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L792] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L793] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L794] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L795] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L796] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L799] EXPR 2 __unbuffered_cnt + 1 [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L779] EXPR 1 __unbuffered_cnt + 1 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L815] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L816] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L817] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L818] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L819] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L851] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L852] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L853] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L854] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L855] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] [L822] EXPR 3 __unbuffered_cnt + 1 [L822] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L824] 3 return 0; [L858] EXPR 4 __unbuffered_cnt + 1 [L858] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L860] 4 return 0; [L882] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L884] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L884] RET 0 assume_abort_if_not(main$tmp_guard0) [L886] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L887] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L888] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L889] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L890] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t89={5:0}, t90={6:0}, t91={7:0}, t92={3:0}, weak$$choice2=0, x=1, y=1, z=1] [L893] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L895] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix004.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 779]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 799]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 822]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 191 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 50.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 42.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 897 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 897 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2290 IncrementalHoareTripleChecker+Invalid, 2395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 41 mSDtfsCounter, 2290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1552occurred in iteration=12, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 324 NumberOfCodeBlocks, 324 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 278 ConstructedInterpolants, 0 QuantifiedInterpolants, 1883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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:37:15,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...