/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-26 21:26:05,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-26 21:26:05,840 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-26 21:26:05,845 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-26 21:26:05,846 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-26 21:26:05,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-26 21:26:05,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-26 21:26:05,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-26 21:26:05,877 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-26 21:26:05,880 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-26 21:26:05,880 INFO L153 SettingsManager]: * Use SBE=true [2023-08-26 21:26:05,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-26 21:26:05,881 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-26 21:26:05,882 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-26 21:26:05,882 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-26 21:26:05,882 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-26 21:26:05,882 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-26 21:26:05,883 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-26 21:26:05,883 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-26 21:26:05,883 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-26 21:26:05,883 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-26 21:26:05,884 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-26 21:26:05,884 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-26 21:26:05,884 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-26 21:26:05,885 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-26 21:26:05,885 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-26 21:26:05,885 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-26 21:26:05,885 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:26:05,886 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-26 21:26:05,886 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-26 21:26:05,887 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-26 21:26:05,887 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-26 21:26:05,887 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-26 21:26:05,887 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-26 21:26:05,887 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-26 21:26:05,888 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-26 21:26:06,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-26 21:26:06,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-26 21:26:06,239 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-26 21:26:06,240 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-26 21:26:06,240 INFO L274 PluginConnector]: CDTParser initialized [2023-08-26 21:26:06,241 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe015_rmo.i [2023-08-26 21:26:07,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-26 21:26:07,767 INFO L384 CDTParser]: Found 1 translation units. [2023-08-26 21:26:07,768 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe015_rmo.i [2023-08-26 21:26:07,790 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e711a389f/7369b14d3adf44ed9a5089e8ae3fd8dd/FLAGf8d92df65 [2023-08-26 21:26:07,805 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e711a389f/7369b14d3adf44ed9a5089e8ae3fd8dd [2023-08-26 21:26:07,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-26 21:26:07,810 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-26 21:26:07,811 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-26 21:26:07,811 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-26 21:26:07,813 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-26 21:26:07,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:26:07" (1/1) ... [2023-08-26 21:26:07,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a7780f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:07, skipping insertion in model container [2023-08-26 21:26:07,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 09:26:07" (1/1) ... [2023-08-26 21:26:07,856 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-26 21:26:08,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:26:08,252 INFO L201 MainTranslator]: Completed pre-run [2023-08-26 21:26:08,277 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:26:08,278 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [268] [2023-08-26 21:26:08,322 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-26 21:26:08,357 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:26:08,357 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-26 21:26:08,363 INFO L206 MainTranslator]: Completed translation [2023-08-26 21:26:08,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08 WrapperNode [2023-08-26 21:26:08,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-26 21:26:08,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-26 21:26:08,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-26 21:26:08,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-26 21:26:08,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,384 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,407 INFO L138 Inliner]: procedures = 176, calls = 85, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 172 [2023-08-26 21:26:08,408 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-26 21:26:08,409 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-26 21:26:08,409 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-26 21:26:08,409 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-26 21:26:08,416 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,416 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,420 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,421 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,435 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,437 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-26 21:26:08,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-26 21:26:08,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-26 21:26:08,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-26 21:26:08,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (1/1) ... [2023-08-26 21:26:08,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-26 21:26:08,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-26 21:26:08,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-26 21:26:08,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-26 21:26:08,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-26 21:26:08,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-26 21:26:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-26 21:26:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-26 21:26:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-26 21:26:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-26 21:26:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-26 21:26:08,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-26 21:26:08,537 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-26 21:26:08,537 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-26 21:26:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-26 21:26:08,538 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-26 21:26:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-26 21:26:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-26 21:26:08,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-26 21:26:08,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-26 21:26:08,541 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-26 21:26:08,681 INFO L236 CfgBuilder]: Building ICFG [2023-08-26 21:26:08,683 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-26 21:26:09,176 INFO L277 CfgBuilder]: Performing block encoding [2023-08-26 21:26:09,376 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-26 21:26:09,376 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-26 21:26:09,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:26:09 BoogieIcfgContainer [2023-08-26 21:26:09,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-26 21:26:09,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-26 21:26:09,381 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-26 21:26:09,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-26 21:26:09,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 09:26:07" (1/3) ... [2023-08-26 21:26:09,383 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fa81cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:26:09, skipping insertion in model container [2023-08-26 21:26:09,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 09:26:08" (2/3) ... [2023-08-26 21:26:09,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34fa81cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 09:26:09, skipping insertion in model container [2023-08-26 21:26:09,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 09:26:09" (3/3) ... [2023-08-26 21:26:09,385 INFO L112 eAbstractionObserver]: Analyzing ICFG safe015_rmo.i [2023-08-26 21:26:09,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-26 21:26:09,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-08-26 21:26:09,399 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-26 21:26:09,504 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-26 21:26:09,542 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 134 transitions, 283 flow [2023-08-26 21:26:09,616 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-26 21:26:09,616 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:26:09,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 21:26:09,622 INFO L82 GeneralOperation]: Start removeDead. Operand has 141 places, 134 transitions, 283 flow [2023-08-26 21:26:09,630 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 131 transitions, 271 flow [2023-08-26 21:26:09,632 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-26 21:26:09,646 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-26 21:26:09,648 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 131 transitions, 271 flow [2023-08-26 21:26:09,648 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 131 transitions, 271 flow [2023-08-26 21:26:09,696 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2023-08-26 21:26:09,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:26:09,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 3/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 77. Up to 2 conditions per place. [2023-08-26 21:26:09,701 INFO L119 LiptonReduction]: Number of co-enabled transitions 2516 [2023-08-26 21:26:16,220 INFO L134 LiptonReduction]: Checked pairs total: 8759 [2023-08-26 21:26:16,220 INFO L136 LiptonReduction]: Total number of compositions: 117 [2023-08-26 21:26:16,231 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-26 21:26:16,236 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;@3b204b48, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-26 21:26:16,236 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-08-26 21:26:16,241 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-26 21:26:16,241 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-26 21:26:16,241 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-26 21:26:16,241 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:16,242 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-26 21:26:16,242 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:16,246 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:16,246 INFO L85 PathProgramCache]: Analyzing trace with hash 825665327, now seen corresponding path program 1 times [2023-08-26 21:26:16,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:16,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783387512] [2023-08-26 21:26:16,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:16,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:16,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:16,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:16,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783387512] [2023-08-26 21:26:16,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783387512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:16,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:16,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-26 21:26:16,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771035291] [2023-08-26 21:26:16,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:16,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-26 21:26:16,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:16,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-26 21:26:16,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-26 21:26:16,568 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:26:16,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:16,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:16,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:26:16,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:17,076 INFO L124 PetriNetUnfolderBase]: 1421/2202 cut-off events. [2023-08-26 21:26:17,076 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-26 21:26:17,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4435 conditions, 2202 events. 1421/2202 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 10902 event pairs, 440 based on Foata normal form. 0/1668 useless extension candidates. Maximal degree in co-relation 4424. Up to 1666 conditions per place. [2023-08-26 21:26:17,090 INFO L140 encePairwiseOnDemand]: 240/251 looper letters, 40 selfloop transitions, 4 changer transitions 0/46 dead transitions. [2023-08-26 21:26:17,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 46 transitions, 195 flow [2023-08-26 21:26:17,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-26 21:26:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-26 21:26:17,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-26 21:26:17,101 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5073041168658698 [2023-08-26 21:26:17,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-26 21:26:17,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-26 21:26:17,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:17,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-26 21:26:17,107 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:17,111 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:17,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:17,113 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 67 flow. Second operand 3 states and 382 transitions. [2023-08-26 21:26:17,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 46 transitions, 195 flow [2023-08-26 21:26:17,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 46 transitions, 190 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-26 21:26:17,116 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 98 flow [2023-08-26 21:26:17,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-08-26 21:26:17,121 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 0 predicate places. [2023-08-26 21:26:17,121 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 98 flow [2023-08-26 21:26:17,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:17,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:17,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:17,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-26 21:26:17,122 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:17,122 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:17,122 INFO L85 PathProgramCache]: Analyzing trace with hash -344605572, now seen corresponding path program 1 times [2023-08-26 21:26:17,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:17,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328135006] [2023-08-26 21:26:17,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:17,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:17,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:17,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:17,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328135006] [2023-08-26 21:26:17,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328135006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:17,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:17,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:26:17,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111270164] [2023-08-26 21:26:17,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:17,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:17,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:17,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:17,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:17,482 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:26:17,483 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:17,483 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:17,483 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:26:17,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:17,946 INFO L124 PetriNetUnfolderBase]: 1767/2823 cut-off events. [2023-08-26 21:26:17,947 INFO L125 PetriNetUnfolderBase]: For 296/352 co-relation queries the response was YES. [2023-08-26 21:26:17,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 2823 events. 1767/2823 cut-off events. For 296/352 co-relation queries the response was YES. Maximal size of possible extension queue 159. Compared 15098 event pairs, 800 based on Foata normal form. 0/2413 useless extension candidates. Maximal degree in co-relation 6796. Up to 1956 conditions per place. [2023-08-26 21:26:17,961 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 58 selfloop transitions, 6 changer transitions 0/68 dead transitions. [2023-08-26 21:26:17,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 68 transitions, 331 flow [2023-08-26 21:26:17,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:26:17,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:26:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2023-08-26 21:26:17,965 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860557768924303 [2023-08-26 21:26:17,965 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2023-08-26 21:26:17,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2023-08-26 21:26:17,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:17,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2023-08-26 21:26:17,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:17,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:17,971 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:17,971 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 98 flow. Second operand 5 states and 610 transitions. [2023-08-26 21:26:17,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 68 transitions, 331 flow [2023-08-26 21:26:17,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 68 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:17,974 INFO L231 Difference]: Finished difference. Result has 44 places, 36 transitions, 139 flow [2023-08-26 21:26:17,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=139, PETRI_PLACES=44, PETRI_TRANSITIONS=36} [2023-08-26 21:26:17,974 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 6 predicate places. [2023-08-26 21:26:17,975 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 36 transitions, 139 flow [2023-08-26 21:26:17,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:17,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:17,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:17,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-26 21:26:17,976 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:17,976 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1527427250, now seen corresponding path program 1 times [2023-08-26 21:26:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:17,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777837002] [2023-08-26 21:26:17,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:17,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:17,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:18,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:18,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:18,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777837002] [2023-08-26 21:26:18,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777837002] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:18,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:18,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:26:18,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089336845] [2023-08-26 21:26:18,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:18,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:18,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:18,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:18,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:18,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:26:18,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:18,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:26:18,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:18,500 INFO L124 PetriNetUnfolderBase]: 1544/2393 cut-off events. [2023-08-26 21:26:18,500 INFO L125 PetriNetUnfolderBase]: For 971/985 co-relation queries the response was YES. [2023-08-26 21:26:18,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6248 conditions, 2393 events. 1544/2393 cut-off events. For 971/985 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 12350 event pairs, 449 based on Foata normal form. 4/2125 useless extension candidates. Maximal degree in co-relation 6233. Up to 1651 conditions per place. [2023-08-26 21:26:18,513 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 43 selfloop transitions, 4 changer transitions 0/51 dead transitions. [2023-08-26 21:26:18,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 282 flow [2023-08-26 21:26:18,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:26:18,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:26:18,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-08-26 21:26:18,515 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4820717131474104 [2023-08-26 21:26:18,515 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-08-26 21:26:18,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-08-26 21:26:18,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:18,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-08-26 21:26:18,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,520 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,520 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 139 flow. Second operand 4 states and 484 transitions. [2023-08-26 21:26:18,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 282 flow [2023-08-26 21:26:18,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 51 transitions, 278 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:18,524 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 132 flow [2023-08-26 21:26:18,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-08-26 21:26:18,525 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 5 predicate places. [2023-08-26 21:26:18,525 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 132 flow [2023-08-26 21:26:18,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:18,525 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:18,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-26 21:26:18,526 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:18,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1296112459, now seen corresponding path program 1 times [2023-08-26 21:26:18,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:18,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721603927] [2023-08-26 21:26:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:18,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:18,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:18,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:18,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721603927] [2023-08-26 21:26:18,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721603927] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:18,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:18,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:26:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491000834] [2023-08-26 21:26:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:18,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:18,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:18,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:26:18,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:18,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:26:18,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:18,966 INFO L124 PetriNetUnfolderBase]: 1222/1886 cut-off events. [2023-08-26 21:26:18,966 INFO L125 PetriNetUnfolderBase]: For 1266/1280 co-relation queries the response was YES. [2023-08-26 21:26:18,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5074 conditions, 1886 events. 1222/1886 cut-off events. For 1266/1280 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 9364 event pairs, 387 based on Foata normal form. 4/1831 useless extension candidates. Maximal degree in co-relation 5058. Up to 792 conditions per place. [2023-08-26 21:26:18,976 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 56 selfloop transitions, 7 changer transitions 0/67 dead transitions. [2023-08-26 21:26:18,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 368 flow [2023-08-26 21:26:18,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:26:18,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:26:18,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2023-08-26 21:26:18,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49800796812749004 [2023-08-26 21:26:18,978 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 500 transitions. [2023-08-26 21:26:18,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 500 transitions. [2023-08-26 21:26:18,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:18,979 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 500 transitions. [2023-08-26 21:26:18,980 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.0) internal successors, (500), 4 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,982 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,982 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 132 flow. Second operand 4 states and 500 transitions. [2023-08-26 21:26:18,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 368 flow [2023-08-26 21:26:18,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 67 transitions, 363 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-26 21:26:18,986 INFO L231 Difference]: Finished difference. Result has 45 places, 36 transitions, 171 flow [2023-08-26 21:26:18,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=171, PETRI_PLACES=45, PETRI_TRANSITIONS=36} [2023-08-26 21:26:18,986 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 7 predicate places. [2023-08-26 21:26:18,987 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 36 transitions, 171 flow [2023-08-26 21:26:18,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.5) internal successors, (450), 4 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:18,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:18,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:18,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-26 21:26:18,987 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:18,988 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:18,988 INFO L85 PathProgramCache]: Analyzing trace with hash 618854762, now seen corresponding path program 1 times [2023-08-26 21:26:18,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:18,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517052288] [2023-08-26 21:26:18,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:18,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:19,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:19,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517052288] [2023-08-26 21:26:19,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517052288] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:19,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:19,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-26 21:26:19,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923220187] [2023-08-26 21:26:19,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:19,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:19,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:19,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:19,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:19,220 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 251 [2023-08-26 21:26:19,221 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 171 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:19,221 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:19,221 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 251 [2023-08-26 21:26:19,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:19,680 INFO L124 PetriNetUnfolderBase]: 1443/2342 cut-off events. [2023-08-26 21:26:19,680 INFO L125 PetriNetUnfolderBase]: For 2877/2877 co-relation queries the response was YES. [2023-08-26 21:26:19,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7128 conditions, 2342 events. 1443/2342 cut-off events. For 2877/2877 co-relation queries the response was YES. Maximal size of possible extension queue 153. Compared 12547 event pairs, 318 based on Foata normal form. 63/2356 useless extension candidates. Maximal degree in co-relation 7111. Up to 1351 conditions per place. [2023-08-26 21:26:19,694 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 65 selfloop transitions, 5 changer transitions 3/77 dead transitions. [2023-08-26 21:26:19,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 520 flow [2023-08-26 21:26:19,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:26:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:26:19,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2023-08-26 21:26:19,696 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4852589641434263 [2023-08-26 21:26:19,696 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2023-08-26 21:26:19,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2023-08-26 21:26:19,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:19,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2023-08-26 21:26:19,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:19,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:19,701 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:19,701 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 171 flow. Second operand 5 states and 609 transitions. [2023-08-26 21:26:19,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 520 flow [2023-08-26 21:26:19,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 77 transitions, 478 flow, removed 10 selfloop flow, removed 2 redundant places. [2023-08-26 21:26:19,710 INFO L231 Difference]: Finished difference. Result has 50 places, 39 transitions, 195 flow [2023-08-26 21:26:19,710 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=50, PETRI_TRANSITIONS=39} [2023-08-26 21:26:19,712 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 12 predicate places. [2023-08-26 21:26:19,712 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 39 transitions, 195 flow [2023-08-26 21:26:19,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:19,712 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:19,712 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:19,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-26 21:26:19,713 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:19,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash 2004647049, now seen corresponding path program 1 times [2023-08-26 21:26:19,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:19,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748646778] [2023-08-26 21:26:19,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:19,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:21,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:21,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:21,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748646778] [2023-08-26 21:26:21,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748646778] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:21,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:21,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-26 21:26:21,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006546484] [2023-08-26 21:26:21,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:21,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-26 21:26:21,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:21,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-26 21:26:21,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-08-26 21:26:21,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 251 [2023-08-26 21:26:21,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 39 transitions, 195 flow. Second operand has 8 states, 8 states have (on average 89.5) internal successors, (716), 8 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:21,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:21,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 251 [2023-08-26 21:26:21,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:22,073 INFO L124 PetriNetUnfolderBase]: 2819/4436 cut-off events. [2023-08-26 21:26:22,073 INFO L125 PetriNetUnfolderBase]: For 4666/4674 co-relation queries the response was YES. [2023-08-26 21:26:22,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13052 conditions, 4436 events. 2819/4436 cut-off events. For 4666/4674 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 25870 event pairs, 968 based on Foata normal form. 81/4426 useless extension candidates. Maximal degree in co-relation 13032. Up to 2540 conditions per place. [2023-08-26 21:26:22,104 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 74 selfloop transitions, 12 changer transitions 3/92 dead transitions. [2023-08-26 21:26:22,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 92 transitions, 612 flow [2023-08-26 21:26:22,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:26:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:26:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 594 transitions. [2023-08-26 21:26:22,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3944223107569721 [2023-08-26 21:26:22,107 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 594 transitions. [2023-08-26 21:26:22,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 594 transitions. [2023-08-26 21:26:22,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:22,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 594 transitions. [2023-08-26 21:26:22,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 99.0) internal successors, (594), 6 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:22,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:22,111 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:22,111 INFO L175 Difference]: Start difference. First operand has 50 places, 39 transitions, 195 flow. Second operand 6 states and 594 transitions. [2023-08-26 21:26:22,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 92 transitions, 612 flow [2023-08-26 21:26:22,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:22,118 INFO L231 Difference]: Finished difference. Result has 57 places, 52 transitions, 307 flow [2023-08-26 21:26:22,118 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=307, PETRI_PLACES=57, PETRI_TRANSITIONS=52} [2023-08-26 21:26:22,119 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 19 predicate places. [2023-08-26 21:26:22,119 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 52 transitions, 307 flow [2023-08-26 21:26:22,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.5) internal successors, (716), 8 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:22,119 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:22,119 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:22,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-26 21:26:22,120 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:22,120 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1973358058, now seen corresponding path program 1 times [2023-08-26 21:26:22,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:22,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879237600] [2023-08-26 21:26:22,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:22,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:22,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:22,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:22,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879237600] [2023-08-26 21:26:22,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879237600] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:22,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:22,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:26:22,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155126565] [2023-08-26 21:26:22,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:22,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:26:22,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:22,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:26:22,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:26:22,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 251 [2023-08-26 21:26:22,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 52 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:22,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:22,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 251 [2023-08-26 21:26:22,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:23,673 INFO L124 PetriNetUnfolderBase]: 4180/6763 cut-off events. [2023-08-26 21:26:23,673 INFO L125 PetriNetUnfolderBase]: For 9905/9927 co-relation queries the response was YES. [2023-08-26 21:26:23,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22128 conditions, 6763 events. 4180/6763 cut-off events. For 9905/9927 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 44330 event pairs, 1531 based on Foata normal form. 48/6606 useless extension candidates. Maximal degree in co-relation 22104. Up to 4568 conditions per place. [2023-08-26 21:26:23,707 INFO L140 encePairwiseOnDemand]: 239/251 looper letters, 76 selfloop transitions, 18 changer transitions 3/100 dead transitions. [2023-08-26 21:26:23,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 742 flow [2023-08-26 21:26:23,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:26:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:26:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 553 transitions. [2023-08-26 21:26:23,709 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4406374501992032 [2023-08-26 21:26:23,709 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 553 transitions. [2023-08-26 21:26:23,709 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 553 transitions. [2023-08-26 21:26:23,710 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:23,710 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 553 transitions. [2023-08-26 21:26:23,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.6) internal successors, (553), 5 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:23,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:23,713 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:23,714 INFO L175 Difference]: Start difference. First operand has 57 places, 52 transitions, 307 flow. Second operand 5 states and 553 transitions. [2023-08-26 21:26:23,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 742 flow [2023-08-26 21:26:23,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 100 transitions, 742 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-26 21:26:23,723 INFO L231 Difference]: Finished difference. Result has 64 places, 64 transitions, 455 flow [2023-08-26 21:26:23,724 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=455, PETRI_PLACES=64, PETRI_TRANSITIONS=64} [2023-08-26 21:26:23,724 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 26 predicate places. [2023-08-26 21:26:23,724 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 64 transitions, 455 flow [2023-08-26 21:26:23,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:23,725 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:23,725 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:23,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-26 21:26:23,725 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:23,725 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:23,726 INFO L85 PathProgramCache]: Analyzing trace with hash -99395658, now seen corresponding path program 2 times [2023-08-26 21:26:23,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:23,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660806882] [2023-08-26 21:26:23,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:23,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:24,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:24,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:24,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660806882] [2023-08-26 21:26:24,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660806882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:24,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:24,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-26 21:26:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509248627] [2023-08-26 21:26:24,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:24,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-26 21:26:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-26 21:26:24,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-08-26 21:26:24,922 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 251 [2023-08-26 21:26:24,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 64 transitions, 455 flow. Second operand has 9 states, 9 states have (on average 89.44444444444444) internal successors, (805), 9 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:24,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:24,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 251 [2023-08-26 21:26:24,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:25,857 INFO L124 PetriNetUnfolderBase]: 4548/7379 cut-off events. [2023-08-26 21:26:25,857 INFO L125 PetriNetUnfolderBase]: For 15867/15997 co-relation queries the response was YES. [2023-08-26 21:26:25,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28623 conditions, 7379 events. 4548/7379 cut-off events. For 15867/15997 co-relation queries the response was YES. Maximal size of possible extension queue 501. Compared 49235 event pairs, 1614 based on Foata normal form. 47/7225 useless extension candidates. Maximal degree in co-relation 28594. Up to 3738 conditions per place. [2023-08-26 21:26:25,900 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 104 selfloop transitions, 22 changer transitions 3/132 dead transitions. [2023-08-26 21:26:25,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 132 transitions, 1130 flow [2023-08-26 21:26:25,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:26:25,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:26:25,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 593 transitions. [2023-08-26 21:26:25,903 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3937583001328021 [2023-08-26 21:26:25,903 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 593 transitions. [2023-08-26 21:26:25,903 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 593 transitions. [2023-08-26 21:26:25,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:25,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 593 transitions. [2023-08-26 21:26:25,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 98.83333333333333) internal successors, (593), 6 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:25,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:25,907 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:25,907 INFO L175 Difference]: Start difference. First operand has 64 places, 64 transitions, 455 flow. Second operand 6 states and 593 transitions. [2023-08-26 21:26:25,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 132 transitions, 1130 flow [2023-08-26 21:26:25,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 132 transitions, 1129 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:25,923 INFO L231 Difference]: Finished difference. Result has 71 places, 73 transitions, 624 flow [2023-08-26 21:26:25,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=454, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=624, PETRI_PLACES=71, PETRI_TRANSITIONS=73} [2023-08-26 21:26:25,924 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 33 predicate places. [2023-08-26 21:26:25,924 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 73 transitions, 624 flow [2023-08-26 21:26:25,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.44444444444444) internal successors, (805), 9 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:25,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:25,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:25,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-26 21:26:25,925 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:25,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:25,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1973433977, now seen corresponding path program 1 times [2023-08-26 21:26:25,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:25,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065461998] [2023-08-26 21:26:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:25,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:26,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:26,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:26,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065461998] [2023-08-26 21:26:26,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065461998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:26,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:26,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:26:26,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245594095] [2023-08-26 21:26:26,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:26,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:26:26,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:26,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:26:26,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:26:26,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-26 21:26:26,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 73 transitions, 624 flow. Second operand has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:26,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:26,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-26 21:26:26,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:27,555 INFO L124 PetriNetUnfolderBase]: 5969/9748 cut-off events. [2023-08-26 21:26:27,555 INFO L125 PetriNetUnfolderBase]: For 30731/30940 co-relation queries the response was YES. [2023-08-26 21:26:27,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39913 conditions, 9748 events. 5969/9748 cut-off events. For 30731/30940 co-relation queries the response was YES. Maximal size of possible extension queue 700. Compared 68584 event pairs, 2848 based on Foata normal form. 119/9583 useless extension candidates. Maximal degree in co-relation 39880. Up to 7044 conditions per place. [2023-08-26 21:26:27,610 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 89 selfloop transitions, 24 changer transitions 3/119 dead transitions. [2023-08-26 21:26:27,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 119 transitions, 1143 flow [2023-08-26 21:26:27,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:26:27,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:26:27,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2023-08-26 21:26:27,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43904382470119524 [2023-08-26 21:26:27,613 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2023-08-26 21:26:27,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2023-08-26 21:26:27,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:27,613 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2023-08-26 21:26:27,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:27,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:27,616 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:27,616 INFO L175 Difference]: Start difference. First operand has 71 places, 73 transitions, 624 flow. Second operand 5 states and 551 transitions. [2023-08-26 21:26:27,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 119 transitions, 1143 flow [2023-08-26 21:26:27,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 119 transitions, 1131 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:27,658 INFO L231 Difference]: Finished difference. Result has 76 places, 85 transitions, 811 flow [2023-08-26 21:26:27,658 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=811, PETRI_PLACES=76, PETRI_TRANSITIONS=85} [2023-08-26 21:26:27,659 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 38 predicate places. [2023-08-26 21:26:27,659 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 85 transitions, 811 flow [2023-08-26 21:26:27,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:27,659 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:27,660 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:27,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-26 21:26:27,660 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:27,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:27,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1983582137, now seen corresponding path program 2 times [2023-08-26 21:26:27,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:27,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263264049] [2023-08-26 21:26:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:27,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:28,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:28,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263264049] [2023-08-26 21:26:28,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263264049] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:28,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:28,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:26:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073478044] [2023-08-26 21:26:28,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:28,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:26:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:28,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:26:28,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:26:28,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-26 21:26:28,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 85 transitions, 811 flow. Second operand has 7 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:28,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:28,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-26 21:26:28,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:29,907 INFO L124 PetriNetUnfolderBase]: 7528/12271 cut-off events. [2023-08-26 21:26:29,907 INFO L125 PetriNetUnfolderBase]: For 38838/38962 co-relation queries the response was YES. [2023-08-26 21:26:29,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51802 conditions, 12271 events. 7528/12271 cut-off events. For 38838/38962 co-relation queries the response was YES. Maximal size of possible extension queue 909. Compared 89884 event pairs, 2299 based on Foata normal form. 113/12047 useless extension candidates. Maximal degree in co-relation 51766. Up to 6966 conditions per place. [2023-08-26 21:26:29,973 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 105 selfloop transitions, 29 changer transitions 3/140 dead transitions. [2023-08-26 21:26:29,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 140 transitions, 1454 flow [2023-08-26 21:26:29,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-26 21:26:29,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-26 21:26:29,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions. [2023-08-26 21:26:29,976 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43824701195219123 [2023-08-26 21:26:29,976 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 660 transitions. [2023-08-26 21:26:29,976 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions. [2023-08-26 21:26:29,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:29,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions. [2023-08-26 21:26:29,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:29,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:29,980 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:29,980 INFO L175 Difference]: Start difference. First operand has 76 places, 85 transitions, 811 flow. Second operand 6 states and 660 transitions. [2023-08-26 21:26:29,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 140 transitions, 1454 flow [2023-08-26 21:26:30,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 140 transitions, 1405 flow, removed 14 selfloop flow, removed 2 redundant places. [2023-08-26 21:26:30,026 INFO L231 Difference]: Finished difference. Result has 82 places, 94 transitions, 978 flow [2023-08-26 21:26:30,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=978, PETRI_PLACES=82, PETRI_TRANSITIONS=94} [2023-08-26 21:26:30,026 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 44 predicate places. [2023-08-26 21:26:30,027 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 94 transitions, 978 flow [2023-08-26 21:26:30,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:30,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:30,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:30,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-26 21:26:30,027 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:30,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:30,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1345874125, now seen corresponding path program 3 times [2023-08-26 21:26:30,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:30,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032873432] [2023-08-26 21:26:30,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:30,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:30,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:30,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:30,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:30,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032873432] [2023-08-26 21:26:30,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032873432] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:30,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:30,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:26:30,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389512516] [2023-08-26 21:26:30,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:30,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-26 21:26:30,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:30,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-26 21:26:30,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-26 21:26:30,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 251 [2023-08-26 21:26:30,757 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 94 transitions, 978 flow. Second operand has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:30,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:30,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 251 [2023-08-26 21:26:30,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:32,835 INFO L124 PetriNetUnfolderBase]: 8573/13979 cut-off events. [2023-08-26 21:26:32,835 INFO L125 PetriNetUnfolderBase]: For 54667/54765 co-relation queries the response was YES. [2023-08-26 21:26:32,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61320 conditions, 13979 events. 8573/13979 cut-off events. For 54667/54765 co-relation queries the response was YES. Maximal size of possible extension queue 1029. Compared 104735 event pairs, 752 based on Foata normal form. 116/13734 useless extension candidates. Maximal degree in co-relation 61281. Up to 4813 conditions per place. [2023-08-26 21:26:32,926 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 165 selfloop transitions, 68 changer transitions 9/245 dead transitions. [2023-08-26 21:26:32,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 245 transitions, 2529 flow [2023-08-26 21:26:32,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-26 21:26:32,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-26 21:26:32,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1127 transitions. [2023-08-26 21:26:32,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40818544005795004 [2023-08-26 21:26:32,929 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1127 transitions. [2023-08-26 21:26:32,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1127 transitions. [2023-08-26 21:26:32,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:32,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1127 transitions. [2023-08-26 21:26:32,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 102.45454545454545) internal successors, (1127), 11 states have internal predecessors, (1127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:32,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 251.0) internal successors, (3012), 12 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:32,937 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 251.0) internal successors, (3012), 12 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:32,937 INFO L175 Difference]: Start difference. First operand has 82 places, 94 transitions, 978 flow. Second operand 11 states and 1127 transitions. [2023-08-26 21:26:32,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 245 transitions, 2529 flow [2023-08-26 21:26:33,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 245 transitions, 2487 flow, removed 8 selfloop flow, removed 2 redundant places. [2023-08-26 21:26:33,065 INFO L231 Difference]: Finished difference. Result has 94 places, 120 transitions, 1434 flow [2023-08-26 21:26:33,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1434, PETRI_PLACES=94, PETRI_TRANSITIONS=120} [2023-08-26 21:26:33,066 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 56 predicate places. [2023-08-26 21:26:33,066 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 120 transitions, 1434 flow [2023-08-26 21:26:33,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 93.85714285714286) internal successors, (657), 7 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:33,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:33,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:33,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-26 21:26:33,067 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:33,067 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:33,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1910503792, now seen corresponding path program 1 times [2023-08-26 21:26:33,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:33,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802499928] [2023-08-26 21:26:33,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:33,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:33,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:33,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:33,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:33,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802499928] [2023-08-26 21:26:33,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802499928] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:33,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:33,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:26:33,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229030533] [2023-08-26 21:26:33,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:33,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:33,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:33,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:33,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:33,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-26 21:26:33,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 120 transitions, 1434 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:33,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:33,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-26 21:26:33,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:33,841 INFO L124 PetriNetUnfolderBase]: 1672/3195 cut-off events. [2023-08-26 21:26:33,841 INFO L125 PetriNetUnfolderBase]: For 18292/18342 co-relation queries the response was YES. [2023-08-26 21:26:33,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15309 conditions, 3195 events. 1672/3195 cut-off events. For 18292/18342 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 22072 event pairs, 426 based on Foata normal form. 202/3223 useless extension candidates. Maximal degree in co-relation 15266. Up to 2372 conditions per place. [2023-08-26 21:26:33,857 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 151 selfloop transitions, 8 changer transitions 3/180 dead transitions. [2023-08-26 21:26:33,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 180 transitions, 2159 flow [2023-08-26 21:26:33,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:26:33,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:26:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 600 transitions. [2023-08-26 21:26:33,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47808764940239046 [2023-08-26 21:26:33,859 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 600 transitions. [2023-08-26 21:26:33,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 600 transitions. [2023-08-26 21:26:33,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:33,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 600 transitions. [2023-08-26 21:26:33,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.0) internal successors, (600), 5 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:33,863 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:33,863 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:33,863 INFO L175 Difference]: Start difference. First operand has 94 places, 120 transitions, 1434 flow. Second operand 5 states and 600 transitions. [2023-08-26 21:26:33,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 180 transitions, 2159 flow [2023-08-26 21:26:33,900 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 180 transitions, 2103 flow, removed 27 selfloop flow, removed 1 redundant places. [2023-08-26 21:26:33,903 INFO L231 Difference]: Finished difference. Result has 100 places, 110 transitions, 1197 flow [2023-08-26 21:26:33,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1197, PETRI_PLACES=100, PETRI_TRANSITIONS=110} [2023-08-26 21:26:33,903 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 62 predicate places. [2023-08-26 21:26:33,903 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 110 transitions, 1197 flow [2023-08-26 21:26:33,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:33,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:33,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:33,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-26 21:26:33,904 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:33,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:33,904 INFO L85 PathProgramCache]: Analyzing trace with hash -2092665477, now seen corresponding path program 1 times [2023-08-26 21:26:33,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:33,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208265678] [2023-08-26 21:26:33,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:33,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:34,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:34,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:34,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208265678] [2023-08-26 21:26:34,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208265678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:34,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:34,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-26 21:26:34,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824849604] [2023-08-26 21:26:34,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:34,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:26:34,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:34,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:26:34,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:26:34,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-26 21:26:34,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 110 transitions, 1197 flow. Second operand has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:34,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-26 21:26:34,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:34,455 INFO L124 PetriNetUnfolderBase]: 727/1402 cut-off events. [2023-08-26 21:26:34,455 INFO L125 PetriNetUnfolderBase]: For 9395/9440 co-relation queries the response was YES. [2023-08-26 21:26:34,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7168 conditions, 1402 events. 727/1402 cut-off events. For 9395/9440 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7942 event pairs, 87 based on Foata normal form. 113/1457 useless extension candidates. Maximal degree in co-relation 7121. Up to 461 conditions per place. [2023-08-26 21:26:34,462 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 140 selfloop transitions, 15 changer transitions 3/171 dead transitions. [2023-08-26 21:26:34,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 171 transitions, 1913 flow [2023-08-26 21:26:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-26 21:26:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-26 21:26:34,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 837 transitions. [2023-08-26 21:26:34,465 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4763801935116676 [2023-08-26 21:26:34,465 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 837 transitions. [2023-08-26 21:26:34,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 837 transitions. [2023-08-26 21:26:34,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:34,466 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 837 transitions. [2023-08-26 21:26:34,467 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.57142857142857) internal successors, (837), 7 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,470 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,470 INFO L175 Difference]: Start difference. First operand has 100 places, 110 transitions, 1197 flow. Second operand 7 states and 837 transitions. [2023-08-26 21:26:34,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 171 transitions, 1913 flow [2023-08-26 21:26:34,488 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 171 transitions, 1842 flow, removed 25 selfloop flow, removed 6 redundant places. [2023-08-26 21:26:34,490 INFO L231 Difference]: Finished difference. Result has 98 places, 81 transitions, 775 flow [2023-08-26 21:26:34,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=698, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=775, PETRI_PLACES=98, PETRI_TRANSITIONS=81} [2023-08-26 21:26:34,490 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 60 predicate places. [2023-08-26 21:26:34,491 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 81 transitions, 775 flow [2023-08-26 21:26:34,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.0) internal successors, (555), 5 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,491 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:34,491 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:34,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-26 21:26:34,491 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:34,492 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:34,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1127702688, now seen corresponding path program 1 times [2023-08-26 21:26:34,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:34,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46786689] [2023-08-26 21:26:34,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:34,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:34,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:34,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:34,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46786689] [2023-08-26 21:26:34,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46786689] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:34,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:34,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:26:34,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988244000] [2023-08-26 21:26:34,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:34,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-26 21:26:34,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:34,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-26 21:26:34,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-26 21:26:34,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:26:34,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 81 transitions, 775 flow. Second operand has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:34,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:26:34,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:34,807 INFO L124 PetriNetUnfolderBase]: 696/1319 cut-off events. [2023-08-26 21:26:34,807 INFO L125 PetriNetUnfolderBase]: For 8429/8483 co-relation queries the response was YES. [2023-08-26 21:26:34,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7238 conditions, 1319 events. 696/1319 cut-off events. For 8429/8483 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7292 event pairs, 133 based on Foata normal form. 10/1321 useless extension candidates. Maximal degree in co-relation 7192. Up to 487 conditions per place. [2023-08-26 21:26:34,816 INFO L140 encePairwiseOnDemand]: 244/251 looper letters, 77 selfloop transitions, 13 changer transitions 26/123 dead transitions. [2023-08-26 21:26:34,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 123 transitions, 1391 flow [2023-08-26 21:26:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-26 21:26:34,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-26 21:26:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 604 transitions. [2023-08-26 21:26:34,818 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48127490039840637 [2023-08-26 21:26:34,818 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 604 transitions. [2023-08-26 21:26:34,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 604 transitions. [2023-08-26 21:26:34,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:34,819 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 604 transitions. [2023-08-26 21:26:34,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,823 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,823 INFO L175 Difference]: Start difference. First operand has 98 places, 81 transitions, 775 flow. Second operand 5 states and 604 transitions. [2023-08-26 21:26:34,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 123 transitions, 1391 flow [2023-08-26 21:26:34,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 123 transitions, 1364 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-26 21:26:34,847 INFO L231 Difference]: Finished difference. Result has 95 places, 55 transitions, 521 flow [2023-08-26 21:26:34,847 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=730, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=521, PETRI_PLACES=95, PETRI_TRANSITIONS=55} [2023-08-26 21:26:34,847 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 57 predicate places. [2023-08-26 21:26:34,847 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 55 transitions, 521 flow [2023-08-26 21:26:34,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.0) internal successors, (565), 5 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:34,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:34,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:34,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-26 21:26:34,848 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:34,848 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:34,848 INFO L85 PathProgramCache]: Analyzing trace with hash 468470526, now seen corresponding path program 1 times [2023-08-26 21:26:34,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:34,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521666016] [2023-08-26 21:26:34,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:34,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:35,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521666016] [2023-08-26 21:26:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521666016] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:35,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:35,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-26 21:26:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716833967] [2023-08-26 21:26:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:35,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-26 21:26:35,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:35,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-26 21:26:35,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-26 21:26:35,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 251 [2023-08-26 21:26:35,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 55 transitions, 521 flow. Second operand has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:35,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 251 [2023-08-26 21:26:35,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:35,345 INFO L124 PetriNetUnfolderBase]: 549/1032 cut-off events. [2023-08-26 21:26:35,345 INFO L125 PetriNetUnfolderBase]: For 6726/6770 co-relation queries the response was YES. [2023-08-26 21:26:35,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5539 conditions, 1032 events. 549/1032 cut-off events. For 6726/6770 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 5603 event pairs, 47 based on Foata normal form. 38/1065 useless extension candidates. Maximal degree in co-relation 5494. Up to 360 conditions per place. [2023-08-26 21:26:35,352 INFO L140 encePairwiseOnDemand]: 245/251 looper letters, 103 selfloop transitions, 16 changer transitions 16/142 dead transitions. [2023-08-26 21:26:35,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 142 transitions, 1581 flow [2023-08-26 21:26:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-26 21:26:35,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-26 21:26:35,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1044 transitions. [2023-08-26 21:26:35,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46215139442231074 [2023-08-26 21:26:35,356 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1044 transitions. [2023-08-26 21:26:35,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1044 transitions. [2023-08-26 21:26:35,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:35,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1044 transitions. [2023-08-26 21:26:35,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 116.0) internal successors, (1044), 9 states have internal predecessors, (1044), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,361 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,362 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,362 INFO L175 Difference]: Start difference. First operand has 95 places, 55 transitions, 521 flow. Second operand 9 states and 1044 transitions. [2023-08-26 21:26:35,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 142 transitions, 1581 flow [2023-08-26 21:26:35,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 142 transitions, 1360 flow, removed 36 selfloop flow, removed 20 redundant places. [2023-08-26 21:26:35,380 INFO L231 Difference]: Finished difference. Result has 70 places, 55 transitions, 451 flow [2023-08-26 21:26:35,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=451, PETRI_PLACES=70, PETRI_TRANSITIONS=55} [2023-08-26 21:26:35,380 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 32 predicate places. [2023-08-26 21:26:35,380 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 55 transitions, 451 flow [2023-08-26 21:26:35,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.83333333333333) internal successors, (665), 6 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,381 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:35,381 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:35,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-26 21:26:35,381 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:35,381 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:35,382 INFO L85 PathProgramCache]: Analyzing trace with hash 648567034, now seen corresponding path program 1 times [2023-08-26 21:26:35,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:35,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203119957] [2023-08-26 21:26:35,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:35,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:35,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-26 21:26:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-26 21:26:35,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-26 21:26:35,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203119957] [2023-08-26 21:26:35,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203119957] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-26 21:26:35,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-26 21:26:35,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-26 21:26:35,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120788117] [2023-08-26 21:26:35,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-26 21:26:35,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-26 21:26:35,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-26 21:26:35,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-26 21:26:35,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-26 21:26:35,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 251 [2023-08-26 21:26:35,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 55 transitions, 451 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-26 21:26:35,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 251 [2023-08-26 21:26:35,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-26 21:26:35,855 INFO L124 PetriNetUnfolderBase]: 843/1581 cut-off events. [2023-08-26 21:26:35,856 INFO L125 PetriNetUnfolderBase]: For 8212/8216 co-relation queries the response was YES. [2023-08-26 21:26:35,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8136 conditions, 1581 events. 843/1581 cut-off events. For 8212/8216 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 9271 event pairs, 278 based on Foata normal form. 5/1586 useless extension candidates. Maximal degree in co-relation 8104. Up to 909 conditions per place. [2023-08-26 21:26:35,864 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 52 selfloop transitions, 2 changer transitions 27/86 dead transitions. [2023-08-26 21:26:35,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 86 transitions, 902 flow [2023-08-26 21:26:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-26 21:26:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-26 21:26:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-26 21:26:35,866 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4701195219123506 [2023-08-26 21:26:35,866 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-26 21:26:35,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-26 21:26:35,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-26 21:26:35,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-26 21:26:35,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,869 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,869 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,869 INFO L175 Difference]: Start difference. First operand has 70 places, 55 transitions, 451 flow. Second operand 4 states and 472 transitions. [2023-08-26 21:26:35,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 86 transitions, 902 flow [2023-08-26 21:26:35,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 810 flow, removed 15 selfloop flow, removed 9 redundant places. [2023-08-26 21:26:35,890 INFO L231 Difference]: Finished difference. Result has 65 places, 49 transitions, 369 flow [2023-08-26 21:26:35,890 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=369, PETRI_PLACES=65, PETRI_TRANSITIONS=49} [2023-08-26 21:26:35,891 INFO L281 CegarLoopForPetriNet]: 38 programPoint places, 27 predicate places. [2023-08-26 21:26:35,891 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 49 transitions, 369 flow [2023-08-26 21:26:35,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-26 21:26:35,891 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-26 21:26:35,891 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:35,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-26 21:26:35,892 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2023-08-26 21:26:35,892 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-26 21:26:35,892 INFO L85 PathProgramCache]: Analyzing trace with hash -2082983480, now seen corresponding path program 2 times [2023-08-26 21:26:35,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-26 21:26:35,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509980936] [2023-08-26 21:26:35,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-26 21:26:35,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-26 21:26:35,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:26:35,999 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-26 21:26:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-26 21:26:36,133 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-26 21:26:36,133 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-26 21:26:36,134 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (15 of 16 remaining) [2023-08-26 21:26:36,135 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2023-08-26 21:26:36,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2023-08-26 21:26:36,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2023-08-26 21:26:36,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2023-08-26 21:26:36,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2023-08-26 21:26:36,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2023-08-26 21:26:36,137 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2023-08-26 21:26:36,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 16 remaining) [2023-08-26 21:26:36,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 16 remaining) [2023-08-26 21:26:36,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2023-08-26 21:26:36,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2023-08-26 21:26:36,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2023-08-26 21:26:36,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2023-08-26 21:26:36,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2023-08-26 21:26:36,138 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2023-08-26 21:26:36,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-26 21:26:36,138 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-26 21:26:36,143 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-26 21:26:36,143 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-26 21:26:36,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 09:26:36 BasicIcfg [2023-08-26 21:26:36,224 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-26 21:26:36,225 INFO L158 Benchmark]: Toolchain (without parser) took 28415.10ms. Allocated memory was 358.6MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 333.4MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 333.7MB. Max. memory is 16.0GB. [2023-08-26 21:26:36,225 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 358.6MB. Free memory is still 334.9MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-26 21:26:36,225 INFO L158 Benchmark]: CACSL2BoogieTranslator took 553.36ms. Allocated memory is still 358.6MB. Free memory was 333.4MB in the beginning and 307.8MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-08-26 21:26:36,225 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.49ms. Allocated memory is still 358.6MB. Free memory was 307.8MB in the beginning and 304.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-26 21:26:36,225 INFO L158 Benchmark]: Boogie Preprocessor took 53.00ms. Allocated memory is still 358.6MB. Free memory was 304.8MB in the beginning and 302.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-26 21:26:36,226 INFO L158 Benchmark]: RCFGBuilder took 915.96ms. Allocated memory is still 358.6MB. Free memory was 302.2MB in the beginning and 268.8MB in the end (delta: 33.4MB). Peak memory consumption was 33.8MB. Max. memory is 16.0GB. [2023-08-26 21:26:36,226 INFO L158 Benchmark]: TraceAbstraction took 26844.07ms. Allocated memory was 358.6MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 268.0MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 266.4MB. Max. memory is 16.0GB. [2023-08-26 21:26:36,227 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 358.6MB. Free memory is still 334.9MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 553.36ms. Allocated memory is still 358.6MB. Free memory was 333.4MB in the beginning and 307.8MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 43.49ms. Allocated memory is still 358.6MB. Free memory was 307.8MB in the beginning and 304.8MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 53.00ms. Allocated memory is still 358.6MB. Free memory was 304.8MB in the beginning and 302.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 915.96ms. Allocated memory is still 358.6MB. Free memory was 302.2MB in the beginning and 268.8MB in the end (delta: 33.4MB). Peak memory consumption was 33.8MB. Max. memory is 16.0GB. * TraceAbstraction took 26844.07ms. Allocated memory was 358.6MB in the beginning and 1.9GB in the end (delta: 1.5GB). Free memory was 268.0MB in the beginning and 1.5GB in the end (delta: -1.2GB). Peak memory consumption was 266.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] - GenericResultAtLocation [Line: 268]: Unsoundness Warning unspecified type, defaulting to int C: short [268] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.6s, 138 PlacesBefore, 38 PlacesAfterwards, 131 TransitionsBefore, 29 TransitionsAfterwards, 2516 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 117 TotalNumberOfCompositions, 8759 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2925, independent: 2654, independent conditional: 0, independent unconditional: 2654, dependent: 271, dependent conditional: 0, dependent unconditional: 271, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1326, independent: 1275, independent conditional: 0, independent unconditional: 1275, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2925, independent: 1379, independent conditional: 0, independent unconditional: 1379, dependent: 220, dependent conditional: 0, dependent unconditional: 220, unknown: 1326, unknown conditional: 0, unknown unconditional: 1326] , Statistics on independence cache: Total cache size (in pairs): 147, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L735] 0 _Bool x$flush_delayed; [L736] 0 int x$mem_tmp; [L737] 0 _Bool x$r_buff0_thd0; [L738] 0 _Bool x$r_buff0_thd1; [L739] 0 _Bool x$r_buff0_thd2; [L740] 0 _Bool x$r_buff0_thd3; [L741] 0 _Bool x$r_buff1_thd0; [L742] 0 _Bool x$r_buff1_thd1; [L743] 0 _Bool x$r_buff1_thd2; [L744] 0 _Bool x$r_buff1_thd3; [L745] 0 _Bool x$read_delayed; [L746] 0 int *x$read_delayed_var; [L747] 0 int x$w_buff0; [L748] 0 _Bool x$w_buff0_used; [L749] 0 int x$w_buff1; [L750] 0 _Bool x$w_buff1_used; [L752] 0 int y = 0; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L852] 0 pthread_t t2133; [L853] FCALL, FORK 0 pthread_create(&t2133, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2133, ((void *)0), P0, ((void *)0))=-2, t2133={6:0}, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L854] 0 pthread_t t2134; [L855] FCALL, FORK 0 pthread_create(&t2134, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2134, ((void *)0), P1, ((void *)0))=-1, t2133={6:0}, t2134={7:0}, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L856] 0 pthread_t t2135; [L857] FCALL, FORK 0 pthread_create(&t2135, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2135, ((void *)0), P2, ((void *)0))=0, t2133={6:0}, t2134={7:0}, t2135={5:0}, weak$$choice0=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L809] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L810] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L811] 3 x$flush_delayed = weak$$choice2 [L812] EXPR 3 \read(x) [L812] 3 x$mem_tmp = x [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] EXPR 3 \read(x) [L813] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L813] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L814] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L815] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L816] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L817] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L818] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L819] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L820] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L821] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L822] EXPR 3 \read(x) [L822] 3 __unbuffered_p2_EAX = x [L823] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L823] 3 x = x$flush_delayed ? x$mem_tmp : x [L824] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=0] [L827] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=1, 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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=1] [L759] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !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) [L768] EXPR 1 \read(x) [L768] EXPR 1 !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) [L768] 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) [L769] 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)) [L770] 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)) [L771] 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)) [L772] 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)) [L773] 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)) [L774] 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)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EAX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L782] EXPR 1 __unbuffered_cnt + 1 [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 \read(x) [L830] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L830] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L832] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L833] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L834] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L792] 2 x = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 \read(x) [L795] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L795] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L795] 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) [L796] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L797] 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 [L798] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L799] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L802] EXPR 2 __unbuffered_cnt + 1 [L802] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L804] 2 return 0; [L837] EXPR 3 __unbuffered_cnt + 1 [L837] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 3 return 0; [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L861] RET 0 assume_abort_if_not(main$tmp_guard0) [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 \read(x) [L863] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L863] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L863] 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) [L864] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 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 [L866] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 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}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2133={6:0}, t2134={7:0}, t2135={5:0}, weak$$choice1=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_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] [L870] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L871] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L872] 0 x$flush_delayed = weak$$choice2 [L873] EXPR 0 \read(x) [L873] 0 x$mem_tmp = x [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] EXPR 0 \read(x) [L874] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L874] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L882] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L882] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L882] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L883] EXPR 0 \read(x) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p2_EAX == 2) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] EXPR 0 \read(x) [L884] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L884] 0 x = x$flush_delayed ? x$mem_tmp : x [L885] 0 x$flush_delayed = (_Bool)0 [L887] 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", "safe015_rmo.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice1=1, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=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={3:0}, y=2] - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 802]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 837]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 857]: 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: 855]: 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: 853]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 164 locations, 16 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: 26.6s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 546 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 546 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5 mSDsCounter, 91 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1862 IncrementalHoareTripleChecker+Invalid, 1953 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 91 mSolverCounterUnsat, 13 mSDtfsCounter, 1862 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1434occurred in iteration=11, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.3s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 1768 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-26 21:26:36,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...