/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 PROGRAM_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/mix003.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 09:56:44,859 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 09:56:44,891 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 09:56:44,894 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 09:56:44,894 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 09:56:44,908 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 09:56:44,909 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 09:56:44,909 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 09:56:44,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 09:56:44,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 09:56:44,910 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 09:56:44,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 09:56:44,910 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 09:56:44,911 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 09:56:44,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 09:56:44,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 09:56:44,911 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 09:56:44,911 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 09:56:44,912 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 09:56:44,912 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 09:56:44,912 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 09:56:44,912 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 09:56:44,913 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 09:56:44,913 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 09:56:44,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 09:56:44,913 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 09:56:44,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 09:56:44,913 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:56:44,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 09:56:44,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 09:56:44,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 09:56:44,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 09:56:44,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 09:56:44,914 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 09:56:44,914 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 09:56:44,915 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 -> PROGRAM_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 09:56:45,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 09:56:45,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 09:56:45,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 09:56:45,179 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 09:56:45,179 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 09:56:45,180 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2023-08-27 09:56:46,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 09:56:46,520 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 09:56:46,521 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix003.oepc.i [2023-08-27 09:56:46,541 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0197649/32e55fa2711140519788647c56a482c2/FLAGf22fc669e [2023-08-27 09:56:46,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da0197649/32e55fa2711140519788647c56a482c2 [2023-08-27 09:56:46,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 09:56:46,558 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 09:56:46,559 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 09:56:46,559 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 09:56:46,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 09:56:46,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:46,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@196aa7a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46, skipping insertion in model container [2023-08-27 09:56:46,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:46,609 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 09:56:46,902 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:56:46,915 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 09:56:46,931 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 09:56:46,932 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 09:56:46,952 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:56:46,972 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 09:56:46,973 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 09:56:46,977 INFO L206 MainTranslator]: Completed translation [2023-08-27 09:56:46,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46 WrapperNode [2023-08-27 09:56:46,977 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 09:56:46,978 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 09:56:46,978 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 09:56:46,978 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 09:56:46,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:46,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,007 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 139 [2023-08-27 09:56:47,007 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 09:56:47,008 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 09:56:47,008 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 09:56:47,008 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 09:56:47,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,020 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,020 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,033 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,035 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,035 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,038 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 09:56:47,038 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 09:56:47,038 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 09:56:47,038 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 09:56:47,039 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (1/1) ... [2023-08-27 09:56:47,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:56:47,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:56:47,076 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 09:56:47,095 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 09:56:47,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 09:56:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 09:56:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 09:56:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 09:56:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 09:56:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 09:56:47,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 09:56:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 09:56:47,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 09:56:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 09:56:47,105 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 09:56:47,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 09:56:47,106 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 09:56:47,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 09:56:47,106 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 09:56:47,107 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 09:56:47,198 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 09:56:47,199 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 09:56:47,441 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 09:56:47,552 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 09:56:47,552 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 09:56:47,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:56:47 BoogieIcfgContainer [2023-08-27 09:56:47,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 09:56:47,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 09:56:47,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 09:56:47,558 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 09:56:47,558 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:56:46" (1/3) ... [2023-08-27 09:56:47,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0243e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:56:47, skipping insertion in model container [2023-08-27 09:56:47,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:56:46" (2/3) ... [2023-08-27 09:56:47,559 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f0243e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:56:47, skipping insertion in model container [2023-08-27 09:56:47,559 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:56:47" (3/3) ... [2023-08-27 09:56:47,560 INFO L112 eAbstractionObserver]: Analyzing ICFG mix003.oepc.i [2023-08-27 09:56:47,570 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 09:56:47,571 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 09:56:47,571 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 09:56:47,614 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 09:56:47,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 123 transitions, 261 flow [2023-08-27 09:56:47,694 INFO L124 PetriNetUnfolderBase]: 3/120 cut-off events. [2023-08-27 09:56:47,694 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:56:47,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-27 09:56:47,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 123 transitions, 261 flow [2023-08-27 09:56:47,704 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 120 transitions, 249 flow [2023-08-27 09:56:47,707 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 09:56:47,719 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 120 transitions, 249 flow [2023-08-27 09:56:47,722 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 120 transitions, 249 flow [2023-08-27 09:56:47,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 120 transitions, 249 flow [2023-08-27 09:56:47,756 INFO L124 PetriNetUnfolderBase]: 3/120 cut-off events. [2023-08-27 09:56:47,756 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:56:47,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 94 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-27 09:56:47,759 INFO L119 LiptonReduction]: Number of co-enabled transitions 3000 [2023-08-27 09:56:50,675 INFO L134 LiptonReduction]: Checked pairs total: 11055 [2023-08-27 09:56:50,675 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-27 09:56:50,691 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 09:56:50,696 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;@4c352fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 09:56:50,696 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 09:56:50,699 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 09:56:50,699 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 09:56:50,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:56:50,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:50,700 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 09:56:50,700 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:50,703 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:50,703 INFO L85 PathProgramCache]: Analyzing trace with hash 556532, now seen corresponding path program 1 times [2023-08-27 09:56:50,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:50,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317842240] [2023-08-27 09:56:50,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:50,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:50,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:51,148 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 09:56:51,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:51,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317842240] [2023-08-27 09:56:51,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317842240] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:51,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:51,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:56:51,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662193382] [2023-08-27 09:56:51,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:51,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:56:51,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:51,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:56:51,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:56:51,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 235 [2023-08-27 09:56:51,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:51,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 235 [2023-08-27 09:56:51,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:51,510 INFO L124 PetriNetUnfolderBase]: 1764/2933 cut-off events. [2023-08-27 09:56:51,510 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-08-27 09:56:51,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5575 conditions, 2933 events. 1764/2933 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 18423 event pairs, 224 based on Foata normal form. 0/2329 useless extension candidates. Maximal degree in co-relation 5564. Up to 2189 conditions per place. [2023-08-27 09:56:51,532 INFO L140 encePairwiseOnDemand]: 231/235 looper letters, 38 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-27 09:56:51,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 47 transitions, 189 flow [2023-08-27 09:56:51,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:56:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:56:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2023-08-27 09:56:51,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4950354609929078 [2023-08-27 09:56:51,543 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 349 transitions. [2023-08-27 09:56:51,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 349 transitions. [2023-08-27 09:56:51,545 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:51,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 349 transitions. [2023-08-27 09:56:51,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,555 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 3 states and 349 transitions. [2023-08-27 09:56:51,556 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 47 transitions, 189 flow [2023-08-27 09:56:51,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 184 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 09:56:51,559 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 70 flow [2023-08-27 09:56:51,560 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2023-08-27 09:56:51,563 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -2 predicate places. [2023-08-27 09:56:51,563 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 70 flow [2023-08-27 09:56:51,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:51,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 09:56:51,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 09:56:51,564 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:51,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:51,570 INFO L85 PathProgramCache]: Analyzing trace with hash -599806285, now seen corresponding path program 1 times [2023-08-27 09:56:51,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:51,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153359941] [2023-08-27 09:56:51,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:51,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:51,635 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 09:56:51,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:51,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153359941] [2023-08-27 09:56:51,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153359941] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:51,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:51,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:56:51,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354337532] [2023-08-27 09:56:51,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:51,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:56:51,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:51,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:56:51,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:56:51,638 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-27 09:56:51,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:51,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-27 09:56:51,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:51,874 INFO L124 PetriNetUnfolderBase]: 1395/2156 cut-off events. [2023-08-27 09:56:51,875 INFO L125 PetriNetUnfolderBase]: For 129/129 co-relation queries the response was YES. [2023-08-27 09:56:51,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4474 conditions, 2156 events. 1395/2156 cut-off events. For 129/129 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 10977 event pairs, 463 based on Foata normal form. 0/1640 useless extension candidates. Maximal degree in co-relation 4464. Up to 1562 conditions per place. [2023-08-27 09:56:51,883 INFO L140 encePairwiseOnDemand]: 225/235 looper letters, 40 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-27 09:56:51,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 48 transitions, 200 flow [2023-08-27 09:56:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:56:51,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:56:51,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 344 transitions. [2023-08-27 09:56:51,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4879432624113475 [2023-08-27 09:56:51,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 344 transitions. [2023-08-27 09:56:51,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 344 transitions. [2023-08-27 09:56:51,888 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:51,888 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 344 transitions. [2023-08-27 09:56:51,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.66666666666667) internal successors, (344), 3 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,891 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,891 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,891 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 70 flow. Second operand 3 states and 344 transitions. [2023-08-27 09:56:51,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 48 transitions, 200 flow [2023-08-27 09:56:51,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 48 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:56:51,893 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 102 flow [2023-08-27 09:56:51,893 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-08-27 09:56:51,894 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2023-08-27 09:56:51,895 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 102 flow [2023-08-27 09:56:51,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:51,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:51,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:56:51,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 09:56:51,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:51,901 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:51,901 INFO L85 PathProgramCache]: Analyzing trace with hash 722287072, now seen corresponding path program 1 times [2023-08-27 09:56:51,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:51,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072865246] [2023-08-27 09:56:51,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:51,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:51,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:52,072 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 09:56:52,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:52,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072865246] [2023-08-27 09:56:52,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072865246] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:52,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:52,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:56:52,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861439996] [2023-08-27 09:56:52,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:52,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:56:52,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:52,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:56:52,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:56:52,076 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 235 [2023-08-27 09:56:52,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:52,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 235 [2023-08-27 09:56:52,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:52,306 INFO L124 PetriNetUnfolderBase]: 1310/2076 cut-off events. [2023-08-27 09:56:52,307 INFO L125 PetriNetUnfolderBase]: For 223/256 co-relation queries the response was YES. [2023-08-27 09:56:52,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4954 conditions, 2076 events. 1310/2076 cut-off events. For 223/256 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10781 event pairs, 413 based on Foata normal form. 0/1768 useless extension candidates. Maximal degree in co-relation 4943. Up to 1438 conditions per place. [2023-08-27 09:56:52,315 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 38 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-27 09:56:52,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 222 flow [2023-08-27 09:56:52,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:56:52,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:56:52,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2023-08-27 09:56:52,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4765957446808511 [2023-08-27 09:56:52,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2023-08-27 09:56:52,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2023-08-27 09:56:52,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:52,317 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2023-08-27 09:56:52,318 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,319 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,319 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 235.0) internal successors, (940), 4 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,320 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 102 flow. Second operand 3 states and 336 transitions. [2023-08-27 09:56:52,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 222 flow [2023-08-27 09:56:52,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 46 transitions, 216 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:56:52,322 INFO L231 Difference]: Finished difference. Result has 42 places, 33 transitions, 106 flow [2023-08-27 09:56:52,322 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=42, PETRI_TRANSITIONS=33} [2023-08-27 09:56:52,323 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2023-08-27 09:56:52,323 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 33 transitions, 106 flow [2023-08-27 09:56:52,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,323 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:52,324 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:56:52,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 09:56:52,327 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:52,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:52,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1705990583, now seen corresponding path program 1 times [2023-08-27 09:56:52,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:52,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794831469] [2023-08-27 09:56:52,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:52,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:52,458 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 09:56:52,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:52,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794831469] [2023-08-27 09:56:52,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794831469] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:52,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:52,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:56:52,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30167445] [2023-08-27 09:56:52,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:52,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:56:52,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:52,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:56:52,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:56:52,462 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 235 [2023-08-27 09:56:52,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 33 transitions, 106 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:52,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 235 [2023-08-27 09:56:52,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:52,790 INFO L124 PetriNetUnfolderBase]: 2439/3784 cut-off events. [2023-08-27 09:56:52,790 INFO L125 PetriNetUnfolderBase]: For 632/673 co-relation queries the response was YES. [2023-08-27 09:56:52,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8920 conditions, 3784 events. 2439/3784 cut-off events. For 632/673 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19536 event pairs, 654 based on Foata normal form. 44/3554 useless extension candidates. Maximal degree in co-relation 8907. Up to 2431 conditions per place. [2023-08-27 09:56:52,803 INFO L140 encePairwiseOnDemand]: 227/235 looper letters, 59 selfloop transitions, 7 changer transitions 0/69 dead transitions. [2023-08-27 09:56:52,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 69 transitions, 348 flow [2023-08-27 09:56:52,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:56:52,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:56:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 431 transitions. [2023-08-27 09:56:52,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45851063829787236 [2023-08-27 09:56:52,804 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 431 transitions. [2023-08-27 09:56:52,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 431 transitions. [2023-08-27 09:56:52,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:52,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 431 transitions. [2023-08-27 09:56:52,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.75) internal successors, (431), 4 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,807 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,808 INFO L175 Difference]: Start difference. First operand has 42 places, 33 transitions, 106 flow. Second operand 4 states and 431 transitions. [2023-08-27 09:56:52,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 69 transitions, 348 flow [2023-08-27 09:56:52,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 69 transitions, 340 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:56:52,810 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 153 flow [2023-08-27 09:56:52,810 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2023-08-27 09:56:52,811 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2023-08-27 09:56:52,811 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 153 flow [2023-08-27 09:56:52,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:52,811 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:56:52,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 09:56:52,812 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:52,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:52,812 INFO L85 PathProgramCache]: Analyzing trace with hash 270451717, now seen corresponding path program 1 times [2023-08-27 09:56:52,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:52,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539436867] [2023-08-27 09:56:52,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:52,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:52,851 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 09:56:52,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:52,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539436867] [2023-08-27 09:56:52,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539436867] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:52,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:52,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:56:52,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662341495] [2023-08-27 09:56:52,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:52,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:56:52,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:52,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:56:52,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:56:52,853 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-27 09:56:52,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:52,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:52,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-27 09:56:52,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:53,094 INFO L124 PetriNetUnfolderBase]: 1669/2647 cut-off events. [2023-08-27 09:56:53,094 INFO L125 PetriNetUnfolderBase]: For 1135/1209 co-relation queries the response was YES. [2023-08-27 09:56:53,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6996 conditions, 2647 events. 1669/2647 cut-off events. For 1135/1209 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 14253 event pairs, 630 based on Foata normal form. 1/2329 useless extension candidates. Maximal degree in co-relation 6980. Up to 1613 conditions per place. [2023-08-27 09:56:53,106 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 41 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-27 09:56:53,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 52 transitions, 285 flow [2023-08-27 09:56:53,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:56:53,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:56:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-08-27 09:56:53,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46382978723404256 [2023-08-27 09:56:53,107 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-08-27 09:56:53,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-08-27 09:56:53,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:53,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-08-27 09:56:53,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,110 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,110 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 153 flow. Second operand 4 states and 436 transitions. [2023-08-27 09:56:53,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 52 transitions, 285 flow [2023-08-27 09:56:53,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 283 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:56:53,112 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 147 flow [2023-08-27 09:56:53,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-27 09:56:53,113 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-27 09:56:53,113 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 147 flow [2023-08-27 09:56:53,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,113 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:53,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:56:53,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 09:56:53,114 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:53,114 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:53,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1048711640, now seen corresponding path program 1 times [2023-08-27 09:56:53,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:53,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103647193] [2023-08-27 09:56:53,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:53,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:53,151 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 09:56:53,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:53,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103647193] [2023-08-27 09:56:53,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103647193] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:53,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:53,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:56:53,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700101754] [2023-08-27 09:56:53,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:53,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:56:53,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:53,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:56:53,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:56:53,153 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 235 [2023-08-27 09:56:53,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:53,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 235 [2023-08-27 09:56:53,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:53,380 INFO L124 PetriNetUnfolderBase]: 1409/2216 cut-off events. [2023-08-27 09:56:53,380 INFO L125 PetriNetUnfolderBase]: For 1418/1484 co-relation queries the response was YES. [2023-08-27 09:56:53,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 2216 events. 1409/2216 cut-off events. For 1418/1484 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 11583 event pairs, 588 based on Foata normal form. 1/2089 useless extension candidates. Maximal degree in co-relation 6057. Up to 901 conditions per place. [2023-08-27 09:56:53,390 INFO L140 encePairwiseOnDemand]: 228/235 looper letters, 56 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2023-08-27 09:56:53,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 70 transitions, 387 flow [2023-08-27 09:56:53,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:56:53,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:56:53,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 452 transitions. [2023-08-27 09:56:53,391 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4808510638297872 [2023-08-27 09:56:53,391 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 452 transitions. [2023-08-27 09:56:53,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 452 transitions. [2023-08-27 09:56:53,392 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:53,392 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 452 transitions. [2023-08-27 09:56:53,392 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,394 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,394 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,394 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 147 flow. Second operand 4 states and 452 transitions. [2023-08-27 09:56:53,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 70 transitions, 387 flow [2023-08-27 09:56:53,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 70 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:56:53,396 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 186 flow [2023-08-27 09:56:53,396 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=186, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-27 09:56:53,397 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-27 09:56:53,397 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 186 flow [2023-08-27 09:56:53,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:53,397 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:56:53,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 09:56:53,397 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:53,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:53,398 INFO L85 PathProgramCache]: Analyzing trace with hash -74010068, now seen corresponding path program 1 times [2023-08-27 09:56:53,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:53,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090741448] [2023-08-27 09:56:53,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:53,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:53,499 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 09:56:53,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:53,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090741448] [2023-08-27 09:56:53,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090741448] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:53,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:53,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:56:53,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470487702] [2023-08-27 09:56:53,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:53,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:56:53,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:53,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:56:53,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:56:53,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-27 09:56:53,501 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 186 flow. Second operand has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:53,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-27 09:56:53,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:53,736 INFO L124 PetriNetUnfolderBase]: 863/1504 cut-off events. [2023-08-27 09:56:53,736 INFO L125 PetriNetUnfolderBase]: For 1181/1210 co-relation queries the response was YES. [2023-08-27 09:56:53,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4474 conditions, 1504 events. 863/1504 cut-off events. For 1181/1210 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 7923 event pairs, 201 based on Foata normal form. 128/1571 useless extension candidates. Maximal degree in co-relation 4456. Up to 905 conditions per place. [2023-08-27 09:56:53,749 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 58 selfloop transitions, 8 changer transitions 3/76 dead transitions. [2023-08-27 09:56:53,749 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 76 transitions, 467 flow [2023-08-27 09:56:53,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:56:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:56:53,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 543 transitions. [2023-08-27 09:56:53,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4621276595744681 [2023-08-27 09:56:53,751 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 543 transitions. [2023-08-27 09:56:53,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 543 transitions. [2023-08-27 09:56:53,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:53,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 543 transitions. [2023-08-27 09:56:53,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,754 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 235.0) internal successors, (1410), 6 states have internal predecessors, (1410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,754 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 186 flow. Second operand 5 states and 543 transitions. [2023-08-27 09:56:53,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 76 transitions, 467 flow [2023-08-27 09:56:53,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 76 transitions, 441 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 09:56:53,756 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 229 flow [2023-08-27 09:56:53,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=229, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-08-27 09:56:53,757 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2023-08-27 09:56:53,757 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 229 flow [2023-08-27 09:56:53,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.75) internal successors, (395), 4 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:53,757 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:53,757 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:56:53,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 09:56:53,757 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:53,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:53,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1730196180, now seen corresponding path program 1 times [2023-08-27 09:56:53,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:53,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657087969] [2023-08-27 09:56:53,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:53,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:53,882 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 09:56:53,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:53,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657087969] [2023-08-27 09:56:53,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657087969] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:53,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:53,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:56:53,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692296985] [2023-08-27 09:56:53,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:53,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:56:53,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:53,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:56:53,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:56:53,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-27 09:56:53,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 229 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 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 09:56:53,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:53,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-27 09:56:53,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:54,085 INFO L124 PetriNetUnfolderBase]: 569/1035 cut-off events. [2023-08-27 09:56:54,086 INFO L125 PetriNetUnfolderBase]: For 1168/1192 co-relation queries the response was YES. [2023-08-27 09:56:54,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3296 conditions, 1035 events. 569/1035 cut-off events. For 1168/1192 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5166 event pairs, 139 based on Foata normal form. 67/1054 useless extension candidates. Maximal degree in co-relation 3275. Up to 230 conditions per place. [2023-08-27 09:56:54,091 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 68 selfloop transitions, 15 changer transitions 3/93 dead transitions. [2023-08-27 09:56:54,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 93 transitions, 551 flow [2023-08-27 09:56:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 09:56:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 09:56:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 758 transitions. [2023-08-27 09:56:54,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.460790273556231 [2023-08-27 09:56:54,093 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 758 transitions. [2023-08-27 09:56:54,093 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 758 transitions. [2023-08-27 09:56:54,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:54,093 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 758 transitions. [2023-08-27 09:56:54,094 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.28571428571429) internal successors, (758), 7 states have internal predecessors, (758), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:54,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:54,096 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 235.0) internal successors, (1880), 8 states have internal predecessors, (1880), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:54,096 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 229 flow. Second operand 7 states and 758 transitions. [2023-08-27 09:56:54,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 93 transitions, 551 flow [2023-08-27 09:56:54,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 93 transitions, 540 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:56:54,100 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 287 flow [2023-08-27 09:56:54,100 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-08-27 09:56:54,101 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 18 predicate places. [2023-08-27 09:56:54,101 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 287 flow [2023-08-27 09:56:54,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 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 09:56:54,101 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:54,101 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:56:54,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 09:56:54,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:54,102 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:54,102 INFO L85 PathProgramCache]: Analyzing trace with hash -236102459, now seen corresponding path program 1 times [2023-08-27 09:56:54,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:54,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105821957] [2023-08-27 09:56:54,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:54,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:54,223 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 09:56:54,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:54,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105821957] [2023-08-27 09:56:54,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105821957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:54,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:54,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:56:54,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873165921] [2023-08-27 09:56:54,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:54,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:56:54,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:54,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:56:54,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:56:54,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-27 09:56:54,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:54,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:54,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-27 09:56:54,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:54,497 INFO L124 PetriNetUnfolderBase]: 1044/1879 cut-off events. [2023-08-27 09:56:54,497 INFO L125 PetriNetUnfolderBase]: For 3680/3756 co-relation queries the response was YES. [2023-08-27 09:56:54,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6743 conditions, 1879 events. 1044/1879 cut-off events. For 3680/3756 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 10946 event pairs, 154 based on Foata normal form. 12/1804 useless extension candidates. Maximal degree in co-relation 6719. Up to 920 conditions per place. [2023-08-27 09:56:54,507 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 91 selfloop transitions, 3 changer transitions 2/100 dead transitions. [2023-08-27 09:56:54,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 839 flow [2023-08-27 09:56:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:56:54,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:56:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2023-08-27 09:56:54,509 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4723404255319149 [2023-08-27 09:56:54,509 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 444 transitions. [2023-08-27 09:56:54,509 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 444 transitions. [2023-08-27 09:56:54,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:54,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 444 transitions. [2023-08-27 09:56:54,510 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:54,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:54,511 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:54,511 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 287 flow. Second operand 4 states and 444 transitions. [2023-08-27 09:56:54,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 839 flow [2023-08-27 09:56:54,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 100 transitions, 769 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-08-27 09:56:54,521 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 279 flow [2023-08-27 09:56:54,521 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-08-27 09:56:54,521 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2023-08-27 09:56:54,521 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 279 flow [2023-08-27 09:56:54,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:54,522 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:54,522 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 09:56:54,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 09:56:54,522 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:54,522 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:54,522 INFO L85 PathProgramCache]: Analyzing trace with hash -173135293, now seen corresponding path program 1 times [2023-08-27 09:56:54,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:54,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414959072] [2023-08-27 09:56:54,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:54,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:54,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:54,708 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 09:56:54,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:54,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414959072] [2023-08-27 09:56:54,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414959072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:54,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:54,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 09:56:54,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393580944] [2023-08-27 09:56:54,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:54,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:56:54,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:54,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:56:54,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:56:54,711 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 235 [2023-08-27 09:56:54,712 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:54,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:54,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 235 [2023-08-27 09:56:54,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:54,985 INFO L124 PetriNetUnfolderBase]: 1541/2747 cut-off events. [2023-08-27 09:56:54,986 INFO L125 PetriNetUnfolderBase]: For 4423/4423 co-relation queries the response was YES. [2023-08-27 09:56:54,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9828 conditions, 2747 events. 1541/2747 cut-off events. For 4423/4423 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 16686 event pairs, 250 based on Foata normal form. 13/2640 useless extension candidates. Maximal degree in co-relation 9803. Up to 1354 conditions per place. [2023-08-27 09:56:54,997 INFO L140 encePairwiseOnDemand]: 232/235 looper letters, 87 selfloop transitions, 3 changer transitions 2/96 dead transitions. [2023-08-27 09:56:54,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 96 transitions, 772 flow [2023-08-27 09:56:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:56:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:56:54,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-08-27 09:56:54,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46702127659574466 [2023-08-27 09:56:54,998 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-08-27 09:56:54,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-08-27 09:56:54,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:54,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-08-27 09:56:54,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:55,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:55,001 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 235.0) internal successors, (1175), 5 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:55,001 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 279 flow. Second operand 4 states and 439 transitions. [2023-08-27 09:56:55,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 96 transitions, 772 flow [2023-08-27 09:56:55,015 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 96 transitions, 770 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:56:55,016 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 297 flow [2023-08-27 09:56:55,017 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=297, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-08-27 09:56:55,018 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 23 predicate places. [2023-08-27 09:56:55,018 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 297 flow [2023-08-27 09:56:55,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.5) internal successors, (406), 4 states have internal predecessors, (406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:55,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:55,018 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 09:56:55,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 09:56:55,018 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:55,019 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:55,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1590419193, now seen corresponding path program 2 times [2023-08-27 09:56:55,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:55,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087530994] [2023-08-27 09:56:55,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:55,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:55,194 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 09:56:55,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:55,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087530994] [2023-08-27 09:56:55,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087530994] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:55,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:55,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 09:56:55,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418708342] [2023-08-27 09:56:55,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:55,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 09:56:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:55,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 09:56:55,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 09:56:55,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 235 [2023-08-27 09:56:55,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:55,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:55,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 235 [2023-08-27 09:56:55,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:55,485 INFO L124 PetriNetUnfolderBase]: 1103/2013 cut-off events. [2023-08-27 09:56:55,485 INFO L125 PetriNetUnfolderBase]: For 3014/3056 co-relation queries the response was YES. [2023-08-27 09:56:55,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7107 conditions, 2013 events. 1103/2013 cut-off events. For 3014/3056 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 12525 event pairs, 172 based on Foata normal form. 44/2023 useless extension candidates. Maximal degree in co-relation 7080. Up to 535 conditions per place. [2023-08-27 09:56:55,492 INFO L140 encePairwiseOnDemand]: 226/235 looper letters, 32 selfloop transitions, 10 changer transitions 39/85 dead transitions. [2023-08-27 09:56:55,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 547 flow [2023-08-27 09:56:55,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 09:56:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 09:56:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 951 transitions. [2023-08-27 09:56:55,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44964539007092197 [2023-08-27 09:56:55,494 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 951 transitions. [2023-08-27 09:56:55,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 951 transitions. [2023-08-27 09:56:55,494 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:55,494 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 951 transitions. [2023-08-27 09:56:55,496 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 105.66666666666667) internal successors, (951), 9 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:55,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:55,499 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 235.0) internal successors, (2350), 10 states have internal predecessors, (2350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:55,499 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 297 flow. Second operand 9 states and 951 transitions. [2023-08-27 09:56:55,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 547 flow [2023-08-27 09:56:55,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 85 transitions, 527 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-27 09:56:55,528 INFO L231 Difference]: Finished difference. Result has 67 places, 29 transitions, 173 flow [2023-08-27 09:56:55,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=173, PETRI_PLACES=67, PETRI_TRANSITIONS=29} [2023-08-27 09:56:55,528 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 26 predicate places. [2023-08-27 09:56:55,529 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 29 transitions, 173 flow [2023-08-27 09:56:55,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.66666666666667) internal successors, (592), 6 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:55,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:55,529 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 09:56:55,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 09:56:55,529 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:55,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:55,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1764492276, now seen corresponding path program 1 times [2023-08-27 09:56:55,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:55,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758220713] [2023-08-27 09:56:55,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:55,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:55,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:56:56,077 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 09:56:56,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:56:56,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758220713] [2023-08-27 09:56:56,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758220713] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:56:56,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:56:56,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 09:56:56,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876315303] [2023-08-27 09:56:56,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:56:56,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 09:56:56,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:56:56,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 09:56:56,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 09:56:56,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 235 [2023-08-27 09:56:56,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 29 transitions, 173 flow. Second operand has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:56,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:56:56,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 235 [2023-08-27 09:56:56,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:56:56,239 INFO L124 PetriNetUnfolderBase]: 234/493 cut-off events. [2023-08-27 09:56:56,239 INFO L125 PetriNetUnfolderBase]: For 935/950 co-relation queries the response was YES. [2023-08-27 09:56:56,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1802 conditions, 493 events. 234/493 cut-off events. For 935/950 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2321 event pairs, 36 based on Foata normal form. 1/487 useless extension candidates. Maximal degree in co-relation 1779. Up to 126 conditions per place. [2023-08-27 09:56:56,241 INFO L140 encePairwiseOnDemand]: 229/235 looper letters, 28 selfloop transitions, 3 changer transitions 44/79 dead transitions. [2023-08-27 09:56:56,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 79 transitions, 636 flow [2023-08-27 09:56:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:56:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:56:56,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 627 transitions. [2023-08-27 09:56:56,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44468085106382976 [2023-08-27 09:56:56,242 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 627 transitions. [2023-08-27 09:56:56,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 627 transitions. [2023-08-27 09:56:56,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:56:56,243 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 627 transitions. [2023-08-27 09:56:56,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 104.5) internal successors, (627), 6 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:56,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:56,245 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 235.0) internal successors, (1645), 7 states have internal predecessors, (1645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:56,245 INFO L175 Difference]: Start difference. First operand has 67 places, 29 transitions, 173 flow. Second operand 6 states and 627 transitions. [2023-08-27 09:56:56,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 79 transitions, 636 flow [2023-08-27 09:56:56,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 79 transitions, 497 flow, removed 26 selfloop flow, removed 13 redundant places. [2023-08-27 09:56:56,252 INFO L231 Difference]: Finished difference. Result has 49 places, 29 transitions, 135 flow [2023-08-27 09:56:56,252 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=235, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=135, PETRI_PLACES=49, PETRI_TRANSITIONS=29} [2023-08-27 09:56:56,253 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-27 09:56:56,253 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 29 transitions, 135 flow [2023-08-27 09:56:56,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 97.71428571428571) internal successors, (684), 7 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:56:56,253 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:56:56,253 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 09:56:56,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 09:56:56,254 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 09:56:56,254 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:56:56,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1131304768, now seen corresponding path program 2 times [2023-08-27 09:56:56,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:56:56,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995463188] [2023-08-27 09:56:56,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:56:56,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:56:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:56:56,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 09:56:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:56:56,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 09:56:56,374 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 09:56:56,374 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 09:56:56,375 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (16 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (6 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 09:56:56,376 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 09:56:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 09:56:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 09:56:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 09:56:56,377 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 09:56:56,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 09:56:56,377 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:56:56,380 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 09:56:56,381 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 09:56:56,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:56:56 BasicIcfg [2023-08-27 09:56:56,444 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 09:56:56,444 INFO L158 Benchmark]: Toolchain (without parser) took 9886.35ms. Allocated memory was 354.4MB in the beginning and 744.5MB in the end (delta: 390.1MB). Free memory was 329.2MB in the beginning and 647.5MB in the end (delta: -318.2MB). Peak memory consumption was 73.4MB. Max. memory is 16.0GB. [2023-08-27 09:56:56,444 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 354.4MB. Free memory is still 331.2MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 09:56:56,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.63ms. Allocated memory is still 354.4MB. Free memory was 329.2MB in the beginning and 305.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 09:56:56,445 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.19ms. Allocated memory is still 354.4MB. Free memory was 305.6MB in the beginning and 303.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:56:56,445 INFO L158 Benchmark]: Boogie Preprocessor took 30.08ms. Allocated memory is still 354.4MB. Free memory was 303.0MB in the beginning and 301.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:56:56,445 INFO L158 Benchmark]: RCFGBuilder took 515.94ms. Allocated memory is still 354.4MB. Free memory was 300.9MB in the beginning and 314.1MB in the end (delta: -13.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 09:56:56,445 INFO L158 Benchmark]: TraceAbstraction took 8887.91ms. Allocated memory was 354.4MB in the beginning and 744.5MB in the end (delta: 390.1MB). Free memory was 313.1MB in the beginning and 647.5MB in the end (delta: -334.3MB). Peak memory consumption was 56.6MB. Max. memory is 16.0GB. [2023-08-27 09:56:56,446 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.12ms. Allocated memory is still 354.4MB. Free memory is still 331.2MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 418.63ms. Allocated memory is still 354.4MB. Free memory was 329.2MB in the beginning and 305.6MB in the end (delta: 23.6MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 29.19ms. Allocated memory is still 354.4MB. Free memory was 305.6MB in the beginning and 303.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 30.08ms. Allocated memory is still 354.4MB. Free memory was 303.0MB in the beginning and 301.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 515.94ms. Allocated memory is still 354.4MB. Free memory was 300.9MB in the beginning and 314.1MB in the end (delta: -13.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 8887.91ms. Allocated memory was 354.4MB in the beginning and 744.5MB in the end (delta: 390.1MB). Free memory was 313.1MB in the beginning and 647.5MB in the end (delta: -334.3MB). Peak memory consumption was 56.6MB. 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: 3.0s, 127 PlacesBefore, 41 PlacesAfterwards, 120 TransitionsBefore, 32 TransitionsAfterwards, 3000 CoEnabledTransitionPairs, 6 FixpointIterations, 41 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 16 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 11055 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3923, independent: 3646, independent conditional: 0, independent unconditional: 3646, dependent: 277, dependent conditional: 0, dependent unconditional: 277, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1793, independent: 1734, independent conditional: 0, independent unconditional: 1734, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3923, independent: 1912, independent conditional: 0, independent unconditional: 1912, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 1793, unknown conditional: 0, unknown unconditional: 1793] , Statistics on independence cache: Total cache size (in pairs): 225, Positive cache size: 198, Positive conditional cache size: 0, Positive unconditional cache size: 198, 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: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L720] 0 _Bool main$tmp_guard0; [L721] 0 _Bool main$tmp_guard1; [L723] 0 int x = 0; [L725] 0 int y = 0; [L727] 0 int z = 0; [L728] 0 _Bool z$flush_delayed; [L729] 0 int z$mem_tmp; [L730] 0 _Bool z$r_buff0_thd0; [L731] 0 _Bool z$r_buff0_thd1; [L732] 0 _Bool z$r_buff0_thd2; [L733] 0 _Bool z$r_buff0_thd3; [L734] 0 _Bool z$r_buff1_thd0; [L735] 0 _Bool z$r_buff1_thd1; [L736] 0 _Bool z$r_buff1_thd2; [L737] 0 _Bool z$r_buff1_thd3; [L738] 0 _Bool z$read_delayed; [L739] 0 int *z$read_delayed_var; [L740] 0 int z$w_buff0; [L741] 0 _Bool z$w_buff0_used; [L742] 0 int z$w_buff1; [L743] 0 _Bool z$w_buff1_used; [L744] 0 _Bool weak$$choice0; [L745] 0 _Bool weak$$choice2; [L845] 0 pthread_t t62; [L846] FCALL, FORK 0 pthread_create(&t62, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t62, ((void *)0), P0, ((void *)0))=-1, t62={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L847] 0 pthread_t t63; [L848] FCALL, FORK 0 pthread_create(&t63, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t63, ((void *)0), P1, ((void *)0))=0, t62={5:0}, t63={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 0 pthread_t t64; [L850] FCALL, FORK 0 pthread_create(&t64, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t64, ((void *)0), P2, ((void *)0))=1, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L749] 1 z$w_buff1 = z$w_buff0 [L750] 1 z$w_buff0 = 1 [L751] 1 z$w_buff1_used = z$w_buff0_used [L752] 1 z$w_buff0_used = (_Bool)1 [L753] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L753] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L754] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L755] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L756] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L757] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L758] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L761] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L778] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L781] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L784] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L801] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L787] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L788] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L789] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L790] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L791] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L794] EXPR 2 __unbuffered_cnt + 1 [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L804] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L807] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 3 z$flush_delayed = weak$$choice2 [L810] 3 z$mem_tmp = z [L811] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L812] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L813] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L814] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L815] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L817] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 __unbuffered_p2_EBX = z [L819] 3 z = z$flush_delayed ? z$mem_tmp : z [L820] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L824] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L825] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L826] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L827] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L765] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L766] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L767] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L768] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=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=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L771] EXPR 1 __unbuffered_cnt + 1 [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 1 return 0; [L830] EXPR 3 __unbuffered_cnt + 1 [L830] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L832] 3 return 0; [L852] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L854] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L854] RET 0 assume_abort_if_not(main$tmp_guard0) [L856] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L857] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L858] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L859] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L860] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t62={5:0}, t63={6:0}, t64={3:0}, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L865] 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", "mix003.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 771]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 794]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 830]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 850]: 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: 846]: 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: 848]: 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 7 procedures, 157 locations, 18 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: 8.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 337 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 337 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1053 IncrementalHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 11 mSDtfsCounter, 1053 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=297occurred in iteration=10, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 153 ConstructedInterpolants, 0 QuantifiedInterpolants, 572 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 09:56:56,462 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...