/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/mix000.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 09:55:30,259 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 09:55:30,333 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:55:30,337 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 09:55:30,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 09:55:30,366 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 09:55:30,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 09:55:30,367 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 09:55:30,367 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 09:55:30,371 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 09:55:30,371 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 09:55:30,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 09:55:30,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 09:55:30,373 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 09:55:30,373 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 09:55:30,373 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 09:55:30,373 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 09:55:30,374 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 09:55:30,374 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 09:55:30,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 09:55:30,374 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 09:55:30,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 09:55:30,375 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 09:55:30,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 09:55:30,376 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 09:55:30,376 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 09:55:30,376 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 09:55:30,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:55:30,377 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 09:55:30,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 09:55:30,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 09:55:30,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 09:55:30,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 09:55:30,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 09:55:30,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 09:55:30,379 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:55:30,708 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 09:55:30,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 09:55:30,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 09:55:30,730 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 09:55:30,730 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 09:55:30,732 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-08-27 09:55:31,835 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 09:55:32,160 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 09:55:32,161 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000.opt.i [2023-08-27 09:55:32,183 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d842e261a/d420e1699a4a420384038c23bc4dc671/FLAG12dc6a713 [2023-08-27 09:55:32,198 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d842e261a/d420e1699a4a420384038c23bc4dc671 [2023-08-27 09:55:32,202 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 09:55:32,203 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 09:55:32,205 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 09:55:32,205 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 09:55:32,208 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 09:55:32,209 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,210 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a3ec62a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32, skipping insertion in model container [2023-08-27 09:55:32,210 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,263 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 09:55:32,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:55:32,605 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 09:55:32,627 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 09:55:32,628 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-27 09:55:32,666 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 09:55:32,698 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 09:55:32,699 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 09:55:32,705 INFO L206 MainTranslator]: Completed translation [2023-08-27 09:55:32,705 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32 WrapperNode [2023-08-27 09:55:32,705 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 09:55:32,706 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 09:55:32,706 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 09:55:32,706 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 09:55:32,712 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:55:32" (1/1) ... [2023-08-27 09:55:32,726 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:55:32" (1/1) ... [2023-08-27 09:55:32,750 INFO L138 Inliner]: procedures = 175, calls = 46, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 143 [2023-08-27 09:55:32,750 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 09:55:32,751 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 09:55:32,751 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 09:55:32,751 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 09:55:32,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,772 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,774 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,775 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,778 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 09:55:32,779 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 09:55:32,779 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 09:55:32,779 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 09:55:32,779 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (1/1) ... [2023-08-27 09:55:32,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 09:55:32,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 09:55:32,830 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:55:32,855 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:55:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 09:55:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 09:55:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 09:55:32,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 09:55:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 09:55:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 09:55:32,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 09:55:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 09:55:32,870 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 09:55:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 09:55:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 09:55:32,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 09:55:32,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 09:55:32,872 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:55:32,995 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 09:55:32,998 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 09:55:33,376 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 09:55:33,500 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 09:55:33,501 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 09:55:33,503 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:55:33 BoogieIcfgContainer [2023-08-27 09:55:33,503 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 09:55:33,505 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 09:55:33,505 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 09:55:33,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 09:55:33,508 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 09:55:32" (1/3) ... [2023-08-27 09:55:33,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbb4ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:55:33, skipping insertion in model container [2023-08-27 09:55:33,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 09:55:32" (2/3) ... [2023-08-27 09:55:33,509 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bbb4ed2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 09:55:33, skipping insertion in model container [2023-08-27 09:55:33,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 09:55:33" (3/3) ... [2023-08-27 09:55:33,511 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000.opt.i [2023-08-27 09:55:33,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 09:55:33,526 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2023-08-27 09:55:33,527 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 09:55:33,575 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 09:55:33,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 99 transitions, 208 flow [2023-08-27 09:55:33,666 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-27 09:55:33,667 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:55:33,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-27 09:55:33,673 INFO L82 GeneralOperation]: Start removeDead. Operand has 103 places, 99 transitions, 208 flow [2023-08-27 09:55:33,677 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 200 flow [2023-08-27 09:55:33,680 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 09:55:33,692 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-27 09:55:33,695 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 101 places, 97 transitions, 200 flow [2023-08-27 09:55:33,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 101 places, 97 transitions, 200 flow [2023-08-27 09:55:33,734 INFO L124 PetriNetUnfolderBase]: 3/97 cut-off events. [2023-08-27 09:55:33,734 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:55:33,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 97 events. 3/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 0/88 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2023-08-27 09:55:33,737 INFO L119 LiptonReduction]: Number of co-enabled transitions 1564 [2023-08-27 09:55:36,863 INFO L134 LiptonReduction]: Checked pairs total: 5580 [2023-08-27 09:55:36,864 INFO L136 LiptonReduction]: Total number of compositions: 88 [2023-08-27 09:55:36,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 09:55:36,880 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;@5f6c34ff, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 09:55:36,881 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-08-27 09:55:36,884 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 09:55:36,884 INFO L124 PetriNetUnfolderBase]: 0/7 cut-off events. [2023-08-27 09:55:36,885 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 09:55:36,885 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:55:36,885 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 09:55:36,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 09:55:36,889 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:55:36,890 INFO L85 PathProgramCache]: Analyzing trace with hash 470637830, now seen corresponding path program 1 times [2023-08-27 09:55:36,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:55:36,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957470483] [2023-08-27 09:55:36,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:55:36,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:55:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:55:37,276 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:55:37,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:55:37,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957470483] [2023-08-27 09:55:37,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957470483] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:55:37,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:55:37,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:55:37,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819268060] [2023-08-27 09:55:37,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:55:37,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:55:37,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:55:37,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:55:37,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:55:37,318 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 187 [2023-08-27 09:55:37,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have 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:55:37,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:55:37,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 187 [2023-08-27 09:55:37,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:55:37,495 INFO L124 PetriNetUnfolderBase]: 322/615 cut-off events. [2023-08-27 09:55:37,495 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-08-27 09:55:37,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 615 events. 322/615 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3010 event pairs, 32 based on Foata normal form. 30/505 useless extension candidates. Maximal degree in co-relation 1164. Up to 466 conditions per place. [2023-08-27 09:55:37,505 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 27 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-27 09:55:37,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 130 flow [2023-08-27 09:55:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:55:37,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:55:37,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 278 transitions. [2023-08-27 09:55:37,523 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49554367201426025 [2023-08-27 09:55:37,524 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 278 transitions. [2023-08-27 09:55:37,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 278 transitions. [2023-08-27 09:55:37,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:55:37,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 278 transitions. [2023-08-27 09:55:37,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 92.66666666666667) internal successors, (278), 3 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have 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:55:37,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have 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:55:37,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have 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:55:37,539 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 56 flow. Second operand 3 states and 278 transitions. [2023-08-27 09:55:37,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 130 flow [2023-08-27 09:55:37,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:55:37,543 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 54 flow [2023-08-27 09:55:37,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2023-08-27 09:55:37,548 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, -1 predicate places. [2023-08-27 09:55:37,548 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 54 flow [2023-08-27 09:55:37,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have 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:55:37,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:55:37,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 09:55:37,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 09:55:37,550 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 09:55:37,558 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:55:37,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1703688272, now seen corresponding path program 1 times [2023-08-27 09:55:37,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:55:37,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524491426] [2023-08-27 09:55:37,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:55:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:55:37,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:55:37,662 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:55:37,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:55:37,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524491426] [2023-08-27 09:55:37,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524491426] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:55:37,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:55:37,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 09:55:37,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403883779] [2023-08-27 09:55:37,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:55:37,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 09:55:37,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:55:37,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 09:55:37,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 09:55:37,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 187 [2023-08-27 09:55:37,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:55:37,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:55:37,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 187 [2023-08-27 09:55:37,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:55:37,755 INFO L124 PetriNetUnfolderBase]: 108/232 cut-off events. [2023-08-27 09:55:37,756 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-08-27 09:55:37,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 232 events. 108/232 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 879 event pairs, 52 based on Foata normal form. 0/179 useless extension candidates. Maximal degree in co-relation 474. Up to 168 conditions per place. [2023-08-27 09:55:37,759 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 28 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-27 09:55:37,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 140 flow [2023-08-27 09:55:37,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 09:55:37,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 09:55:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 273 transitions. [2023-08-27 09:55:37,762 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48663101604278075 [2023-08-27 09:55:37,762 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 273 transitions. [2023-08-27 09:55:37,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 273 transitions. [2023-08-27 09:55:37,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:55:37,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 273 transitions. [2023-08-27 09:55:37,763 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have 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:55:37,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have 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:55:37,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 187.0) internal successors, (748), 4 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have 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:55:37,766 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 54 flow. Second operand 3 states and 273 transitions. [2023-08-27 09:55:37,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 140 flow [2023-08-27 09:55:37,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 134 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 09:55:37,767 INFO L231 Difference]: Finished difference. Result has 31 places, 25 transitions, 77 flow [2023-08-27 09:55:37,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=77, PETRI_PLACES=31, PETRI_TRANSITIONS=25} [2023-08-27 09:55:37,768 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-27 09:55:37,769 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 25 transitions, 77 flow [2023-08-27 09:55:37,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have 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:55:37,770 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:55:37,772 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:55:37,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 09:55:37,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 09:55:37,775 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:55:37,779 INFO L85 PathProgramCache]: Analyzing trace with hash -956216382, now seen corresponding path program 1 times [2023-08-27 09:55:37,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:55:37,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20870035] [2023-08-27 09:55:37,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:55:37,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:55:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:55:38,097 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:55:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:55:38,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20870035] [2023-08-27 09:55:38,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20870035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:55:38,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:55:38,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:55:38,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933122975] [2023-08-27 09:55:38,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:55:38,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:55:38,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:55:38,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:55:38,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:55:38,102 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 187 [2023-08-27 09:55:38,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 25 transitions, 77 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:55:38,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:55:38,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 187 [2023-08-27 09:55:38,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:55:38,201 INFO L124 PetriNetUnfolderBase]: 98/229 cut-off events. [2023-08-27 09:55:38,202 INFO L125 PetriNetUnfolderBase]: For 20/25 co-relation queries the response was YES. [2023-08-27 09:55:38,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 229 events. 98/229 cut-off events. For 20/25 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 917 event pairs, 36 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 525. Up to 140 conditions per place. [2023-08-27 09:55:38,203 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 30 selfloop transitions, 4 changer transitions 1/39 dead transitions. [2023-08-27 09:55:38,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 39 transitions, 184 flow [2023-08-27 09:55:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:55:38,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:55:38,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 430 transitions. [2023-08-27 09:55:38,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45989304812834225 [2023-08-27 09:55:38,205 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 430 transitions. [2023-08-27 09:55:38,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 430 transitions. [2023-08-27 09:55:38,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:55:38,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 430 transitions. [2023-08-27 09:55:38,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.0) internal successors, (430), 5 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have 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:55:38,209 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have 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:55:38,209 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have 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:55:38,209 INFO L175 Difference]: Start difference. First operand has 31 places, 25 transitions, 77 flow. Second operand 5 states and 430 transitions. [2023-08-27 09:55:38,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 39 transitions, 184 flow [2023-08-27 09:55:38,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 39 transitions, 180 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:55:38,211 INFO L231 Difference]: Finished difference. Result has 37 places, 27 transitions, 98 flow [2023-08-27 09:55:38,212 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=37, PETRI_TRANSITIONS=27} [2023-08-27 09:55:38,213 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-27 09:55:38,213 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 27 transitions, 98 flow [2023-08-27 09:55:38,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:55:38,213 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:55:38,214 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:55:38,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 09:55:38,217 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 09:55:38,217 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:55:38,217 INFO L85 PathProgramCache]: Analyzing trace with hash -994676576, now seen corresponding path program 1 times [2023-08-27 09:55:38,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:55:38,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057701319] [2023-08-27 09:55:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:55:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:55:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:55:38,304 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:55:38,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:55:38,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057701319] [2023-08-27 09:55:38,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057701319] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:55:38,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:55:38,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:55:38,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047036469] [2023-08-27 09:55:38,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:55:38,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:55:38,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:55:38,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:55:38,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:55:38,308 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 187 [2023-08-27 09:55:38,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 27 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:55:38,309 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:55:38,309 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 187 [2023-08-27 09:55:38,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:55:38,392 INFO L124 PetriNetUnfolderBase]: 96/214 cut-off events. [2023-08-27 09:55:38,392 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2023-08-27 09:55:38,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 214 events. 96/214 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 809 event pairs, 46 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 533. Up to 147 conditions per place. [2023-08-27 09:55:38,394 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 28 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2023-08-27 09:55:38,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 33 transitions, 173 flow [2023-08-27 09:55:38,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:55:38,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:55:38,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2023-08-27 09:55:38,395 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46390374331550804 [2023-08-27 09:55:38,396 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 347 transitions. [2023-08-27 09:55:38,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 347 transitions. [2023-08-27 09:55:38,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:55:38,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 347 transitions. [2023-08-27 09:55:38,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have 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:55:38,398 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have 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:55:38,399 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have 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:55:38,399 INFO L175 Difference]: Start difference. First operand has 37 places, 27 transitions, 98 flow. Second operand 4 states and 347 transitions. [2023-08-27 09:55:38,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 33 transitions, 173 flow [2023-08-27 09:55:38,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 33 transitions, 170 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 09:55:38,401 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 94 flow [2023-08-27 09:55:38,401 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=94, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2023-08-27 09:55:38,401 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 6 predicate places. [2023-08-27 09:55:38,402 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 94 flow [2023-08-27 09:55:38,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:55:38,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:55:38,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:55:38,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 09:55:38,402 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 09:55:38,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:55:38,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1059290185, now seen corresponding path program 1 times [2023-08-27 09:55:38,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:55:38,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004475777] [2023-08-27 09:55:38,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:55:38,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:55:38,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:55:38,464 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:55:38,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:55:38,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004475777] [2023-08-27 09:55:38,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004475777] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:55:38,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:55:38,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 09:55:38,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294516131] [2023-08-27 09:55:38,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:55:38,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 09:55:38,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:55:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 09:55:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 09:55:38,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 187 [2023-08-27 09:55:38,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:55:38,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:55:38,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 187 [2023-08-27 09:55:38,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:55:38,537 INFO L124 PetriNetUnfolderBase]: 49/110 cut-off events. [2023-08-27 09:55:38,537 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2023-08-27 09:55:38,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 281 conditions, 110 events. 49/110 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 315 event pairs, 27 based on Foata normal form. 7/116 useless extension candidates. Maximal degree in co-relation 270. Up to 58 conditions per place. [2023-08-27 09:55:38,538 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 19 selfloop transitions, 5 changer transitions 4/30 dead transitions. [2023-08-27 09:55:38,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 30 transitions, 152 flow [2023-08-27 09:55:38,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 09:55:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 09:55:38,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 347 transitions. [2023-08-27 09:55:38,539 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46390374331550804 [2023-08-27 09:55:38,540 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 347 transitions. [2023-08-27 09:55:38,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 347 transitions. [2023-08-27 09:55:38,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:55:38,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 347 transitions. [2023-08-27 09:55:38,541 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have 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:55:38,542 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have 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:55:38,543 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 187.0) internal successors, (935), 5 states have internal predecessors, (935), 0 states have call successors, (0), 0 states have 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:55:38,543 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 94 flow. Second operand 4 states and 347 transitions. [2023-08-27 09:55:38,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 30 transitions, 152 flow [2023-08-27 09:55:38,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 136 flow, removed 3 selfloop flow, removed 6 redundant places. [2023-08-27 09:55:38,544 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 72 flow [2023-08-27 09:55:38,545 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=72, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2023-08-27 09:55:38,545 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 0 predicate places. [2023-08-27 09:55:38,545 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 72 flow [2023-08-27 09:55:38,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.75) internal successors, (327), 4 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have 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:55:38,546 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:55:38,546 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:55:38,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 09:55:38,546 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 09:55:38,547 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:55:38,547 INFO L85 PathProgramCache]: Analyzing trace with hash 917748934, now seen corresponding path program 1 times [2023-08-27 09:55:38,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:55:38,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119449688] [2023-08-27 09:55:38,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:55:38,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:55:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:55:38,764 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:55:38,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:55:38,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119449688] [2023-08-27 09:55:38,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119449688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:55:38,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:55:38,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:55:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591682268] [2023-08-27 09:55:38,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:55:38,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:55:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:55:38,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:55:38,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:55:38,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 187 [2023-08-27 09:55:38,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 72 flow. Second operand has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have 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:55:38,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:55:38,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 187 [2023-08-27 09:55:38,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:55:38,882 INFO L124 PetriNetUnfolderBase]: 33/93 cut-off events. [2023-08-27 09:55:38,882 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-08-27 09:55:38,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 93 events. 33/93 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 262 event pairs, 2 based on Foata normal form. 1/94 useless extension candidates. Maximal degree in co-relation 256. Up to 59 conditions per place. [2023-08-27 09:55:38,883 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 27 selfloop transitions, 8 changer transitions 6/41 dead transitions. [2023-08-27 09:55:38,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 41 transitions, 234 flow [2023-08-27 09:55:38,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 09:55:38,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 09:55:38,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 470 transitions. [2023-08-27 09:55:38,885 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41889483065953653 [2023-08-27 09:55:38,885 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 470 transitions. [2023-08-27 09:55:38,886 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 470 transitions. [2023-08-27 09:55:38,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:55:38,886 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 470 transitions. [2023-08-27 09:55:38,887 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 78.33333333333333) internal successors, (470), 6 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have 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:55:38,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have 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:55:38,891 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 187.0) internal successors, (1309), 7 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have 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:55:38,891 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 72 flow. Second operand 6 states and 470 transitions. [2023-08-27 09:55:38,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 41 transitions, 234 flow [2023-08-27 09:55:38,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 41 transitions, 215 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-27 09:55:38,894 INFO L231 Difference]: Finished difference. Result has 35 places, 25 transitions, 112 flow [2023-08-27 09:55:38,894 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=112, PETRI_PLACES=35, PETRI_TRANSITIONS=25} [2023-08-27 09:55:38,896 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-08-27 09:55:38,896 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 25 transitions, 112 flow [2023-08-27 09:55:38,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 75.4) internal successors, (377), 5 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have 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:55:38,897 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:55:38,897 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:55:38,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 09:55:38,897 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 09:55:38,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:55:38,898 INFO L85 PathProgramCache]: Analyzing trace with hash 637790280, now seen corresponding path program 2 times [2023-08-27 09:55:38,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:55:38,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471621234] [2023-08-27 09:55:38,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:55:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:55:38,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:55:39,135 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:55:39,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:55:39,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471621234] [2023-08-27 09:55:39,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471621234] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:55:39,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:55:39,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 09:55:39,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240591046] [2023-08-27 09:55:39,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:55:39,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 09:55:39,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:55:39,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 09:55:39,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 09:55:39,138 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 187 [2023-08-27 09:55:39,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 25 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:55:39,139 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:55:39,139 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 187 [2023-08-27 09:55:39,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:55:39,233 INFO L124 PetriNetUnfolderBase]: 36/107 cut-off events. [2023-08-27 09:55:39,233 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-08-27 09:55:39,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 369 conditions, 107 events. 36/107 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 334 event pairs, 7 based on Foata normal form. 1/108 useless extension candidates. Maximal degree in co-relation 358. Up to 60 conditions per place. [2023-08-27 09:55:39,234 INFO L140 encePairwiseOnDemand]: 183/187 looper letters, 20 selfloop transitions, 1 changer transitions 19/40 dead transitions. [2023-08-27 09:55:39,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 40 transitions, 255 flow [2023-08-27 09:55:39,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 09:55:39,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 09:55:39,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 408 transitions. [2023-08-27 09:55:39,236 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43636363636363634 [2023-08-27 09:55:39,236 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 408 transitions. [2023-08-27 09:55:39,236 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 408 transitions. [2023-08-27 09:55:39,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:55:39,237 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 408 transitions. [2023-08-27 09:55:39,237 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 81.6) internal successors, (408), 5 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have 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:55:39,239 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have 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:55:39,239 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 187.0) internal successors, (1122), 6 states have internal predecessors, (1122), 0 states have call successors, (0), 0 states have 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:55:39,239 INFO L175 Difference]: Start difference. First operand has 35 places, 25 transitions, 112 flow. Second operand 5 states and 408 transitions. [2023-08-27 09:55:39,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 40 transitions, 255 flow [2023-08-27 09:55:39,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 40 transitions, 253 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-27 09:55:39,241 INFO L231 Difference]: Finished difference. Result has 39 places, 19 transitions, 83 flow [2023-08-27 09:55:39,242 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=83, PETRI_PLACES=39, PETRI_TRANSITIONS=19} [2023-08-27 09:55:39,242 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 8 predicate places. [2023-08-27 09:55:39,242 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 19 transitions, 83 flow [2023-08-27 09:55:39,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.4) internal successors, (392), 5 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:55:39,243 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:55:39,243 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:55:39,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 09:55:39,243 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 09:55:39,243 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:55:39,243 INFO L85 PathProgramCache]: Analyzing trace with hash -922130110, now seen corresponding path program 3 times [2023-08-27 09:55:39,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:55:39,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447081023] [2023-08-27 09:55:39,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:55:39,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:55:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 09:55:40,025 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:55:40,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 09:55:40,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447081023] [2023-08-27 09:55:40,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447081023] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 09:55:40,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 09:55:40,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 09:55:40,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979166038] [2023-08-27 09:55:40,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 09:55:40,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-27 09:55:40,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 09:55:40,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-27 09:55:40,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-08-27 09:55:40,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 187 [2023-08-27 09:55:40,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 19 transitions, 83 flow. Second operand has 8 states, 8 states have (on average 72.875) internal successors, (583), 8 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have 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:55:40,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 09:55:40,029 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 187 [2023-08-27 09:55:40,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 09:55:40,195 INFO L124 PetriNetUnfolderBase]: 6/40 cut-off events. [2023-08-27 09:55:40,195 INFO L125 PetriNetUnfolderBase]: For 39/41 co-relation queries the response was YES. [2023-08-27 09:55:40,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 146 conditions, 40 events. 6/40 cut-off events. For 39/41 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 72 event pairs, 0 based on Foata normal form. 1/41 useless extension candidates. Maximal degree in co-relation 133. Up to 13 conditions per place. [2023-08-27 09:55:40,196 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 13 selfloop transitions, 5 changer transitions 9/29 dead transitions. [2023-08-27 09:55:40,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 29 transitions, 191 flow [2023-08-27 09:55:40,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 09:55:40,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 09:55:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 663 transitions. [2023-08-27 09:55:40,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3939393939393939 [2023-08-27 09:55:40,198 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 663 transitions. [2023-08-27 09:55:40,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 663 transitions. [2023-08-27 09:55:40,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 09:55:40,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 663 transitions. [2023-08-27 09:55:40,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 73.66666666666667) internal successors, (663), 9 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 09:55:40,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have 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:55:40,202 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 187.0) internal successors, (1870), 10 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have 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:55:40,202 INFO L175 Difference]: Start difference. First operand has 39 places, 19 transitions, 83 flow. Second operand 9 states and 663 transitions. [2023-08-27 09:55:40,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 29 transitions, 191 flow [2023-08-27 09:55:40,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 29 transitions, 171 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-08-27 09:55:40,204 INFO L231 Difference]: Finished difference. Result has 42 places, 19 transitions, 88 flow [2023-08-27 09:55:40,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=88, PETRI_PLACES=42, PETRI_TRANSITIONS=19} [2023-08-27 09:55:40,204 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 11 predicate places. [2023-08-27 09:55:40,205 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 19 transitions, 88 flow [2023-08-27 09:55:40,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.875) internal successors, (583), 8 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have 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:55:40,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 09:55:40,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 09:55:40,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 09:55:40,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONASSERT, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2023-08-27 09:55:40,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 09:55:40,206 INFO L85 PathProgramCache]: Analyzing trace with hash -285311870, now seen corresponding path program 4 times [2023-08-27 09:55:40,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 09:55:40,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405120801] [2023-08-27 09:55:40,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 09:55:40,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 09:55:40,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:55:40,241 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 09:55:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 09:55:40,326 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 09:55:40,326 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 09:55:40,327 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (12 of 13 remaining) [2023-08-27 09:55:40,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2023-08-27 09:55:40,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2023-08-27 09:55:40,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (9 of 13 remaining) [2023-08-27 09:55:40,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2023-08-27 09:55:40,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2023-08-27 09:55:40,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 13 remaining) [2023-08-27 09:55:40,332 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2023-08-27 09:55:40,333 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2023-08-27 09:55:40,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2023-08-27 09:55:40,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONASSERT (2 of 13 remaining) [2023-08-27 09:55:40,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2023-08-27 09:55:40,334 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2023-08-27 09:55:40,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 09:55:40,335 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2023-08-27 09:55:40,341 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 09:55:40,341 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 09:55:40,411 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 09:55:40 BasicIcfg [2023-08-27 09:55:40,411 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 09:55:40,411 INFO L158 Benchmark]: Toolchain (without parser) took 8208.60ms. Allocated memory was 364.9MB in the beginning and 591.4MB in the end (delta: 226.5MB). Free memory was 339.6MB in the beginning and 549.2MB in the end (delta: -209.6MB). Peak memory consumption was 284.2MB. Max. memory is 16.0GB. [2023-08-27 09:55:40,412 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 364.9MB. Free memory is still 341.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 09:55:40,412 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.36ms. Allocated memory is still 364.9MB. Free memory was 339.3MB in the beginning and 315.9MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 09:55:40,412 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.28ms. Allocated memory is still 364.9MB. Free memory was 315.9MB in the beginning and 313.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:55:40,417 INFO L158 Benchmark]: Boogie Preprocessor took 27.07ms. Allocated memory is still 364.9MB. Free memory was 313.1MB in the beginning and 311.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 09:55:40,418 INFO L158 Benchmark]: RCFGBuilder took 724.50ms. Allocated memory is still 364.9MB. Free memory was 311.3MB in the beginning and 320.9MB in the end (delta: -9.6MB). Peak memory consumption was 26.9MB. Max. memory is 16.0GB. [2023-08-27 09:55:40,418 INFO L158 Benchmark]: TraceAbstraction took 6905.80ms. Allocated memory was 364.9MB in the beginning and 591.4MB in the end (delta: 226.5MB). Free memory was 320.1MB in the beginning and 549.2MB in the end (delta: -229.1MB). Peak memory consumption was 263.5MB. Max. memory is 16.0GB. [2023-08-27 09:55:40,422 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 364.9MB. Free memory is still 341.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 500.36ms. Allocated memory is still 364.9MB. Free memory was 339.3MB in the beginning and 315.9MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 44.28ms. Allocated memory is still 364.9MB. Free memory was 315.9MB in the beginning and 313.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 27.07ms. Allocated memory is still 364.9MB. Free memory was 313.1MB in the beginning and 311.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 724.50ms. Allocated memory is still 364.9MB. Free memory was 311.3MB in the beginning and 320.9MB in the end (delta: -9.6MB). Peak memory consumption was 26.9MB. Max. memory is 16.0GB. * TraceAbstraction took 6905.80ms. Allocated memory was 364.9MB in the beginning and 591.4MB in the end (delta: 226.5MB). Free memory was 320.1MB in the beginning and 549.2MB in the end (delta: -229.1MB). Peak memory consumption was 263.5MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 101 PlacesBefore, 31 PlacesAfterwards, 97 TransitionsBefore, 25 TransitionsAfterwards, 1564 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 88 TotalNumberOfCompositions, 5580 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2665, independent: 2446, independent conditional: 0, independent unconditional: 2446, dependent: 219, dependent conditional: 0, dependent unconditional: 219, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 905, independent: 872, independent conditional: 0, independent unconditional: 872, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2665, independent: 1574, independent conditional: 0, independent unconditional: 1574, dependent: 186, dependent conditional: 0, dependent unconditional: 186, unknown: 905, unknown conditional: 0, unknown unconditional: 905] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 95, Positive conditional cache size: 0, Positive unconditional cache size: 95, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t0; [L827] FCALL, FORK 0 pthread_create(&t0, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t0, ((void *)0), P0, ((void *)0))=-1, t0={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L828] 0 pthread_t t1; [L829] FCALL, FORK 0 pthread_create(&t1, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1, ((void *)0), P1, ((void *)0))=0, t0={5:0}, t1={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1] [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L811] EXPR 2 __unbuffered_cnt + 1 [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L767] EXPR 1 __unbuffered_cnt + 1 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L833] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) VAL [\old(cond)=1, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L833] RET 0 assume_abort_if_not(main$tmp_guard0) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t0={5:0}, t1={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L844] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "mix000.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1] - UnprovableResult [Line: 767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 767]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 811]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 829]: Unable to prove that 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: 827]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 121 locations, 13 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: 6.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 98 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 98 mSDsluCounter, 6 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 524 IncrementalHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 4 mSDtfsCounter, 524 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=6, InterpolantAutomatonStates: 39, 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, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 506 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 09:55:40,444 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...