/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:01:54,622 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:01:54,696 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:01:54,702 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:01:54,702 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:01:54,725 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:01:54,726 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:01:54,726 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:01:54,727 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:01:54,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:01:54,731 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:01:54,731 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:01:54,731 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:01:54,733 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:01:54,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:01:54,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:01:54,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:01:54,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:01:54,734 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:01:54,734 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:01:54,734 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:01:54,735 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:01:54,735 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:01:54,736 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:01:54,736 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:01:54,736 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:01:54,736 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:01:54,736 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:01:54,737 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:01:54,737 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:01:54,738 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:01:54,738 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:01:54,738 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:01:54,738 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:01:54,738 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:01:54,739 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:01:55,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:01:55,072 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:01:55,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:01:55,075 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:01:55,076 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:01:55,078 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-08-27 10:01:56,266 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:01:56,560 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:01:56,560 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix013.opt.i [2023-08-27 10:01:56,586 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73939752f/b4d486f0f6a646e2ab11e11ca9cb6052/FLAG6667d3276 [2023-08-27 10:01:56,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/73939752f/b4d486f0f6a646e2ab11e11ca9cb6052 [2023-08-27 10:01:56,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:01:56,606 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:01:56,610 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:01:56,610 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:01:56,612 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:01:56,614 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:01:56" (1/1) ... [2023-08-27 10:01:56,615 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aa03fc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:56, skipping insertion in model container [2023-08-27 10:01:56,615 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:01:56" (1/1) ... [2023-08-27 10:01:56,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:01:57,033 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:01:57,046 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:01:57,079 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:01:57,081 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:01:57,139 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:01:57,177 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:01:57,178 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:01:57,184 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:01:57,184 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57 WrapperNode [2023-08-27 10:01:57,184 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:01:57,185 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:01:57,186 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:01:57,186 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:01:57,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,223 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,265 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 175 [2023-08-27 10:01:57,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:01:57,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:01:57,266 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:01:57,266 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:01:57,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,274 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,296 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,298 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,311 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:01:57,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:01:57,317 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:01:57,317 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:01:57,318 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (1/1) ... [2023-08-27 10:01:57,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:01:57,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:01:57,352 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:01:57,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:01:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:01:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:01:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:01:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:01:57,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:01:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:01:57,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:01:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:01:57,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:01:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:01:57,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:01:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:01:57,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:01:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:01:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:01:57,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:01:57,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:01:57,390 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:01:57,529 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:01:57,531 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:01:57,941 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:01:58,058 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:01:58,059 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:01:58,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:01:58 BoogieIcfgContainer [2023-08-27 10:01:58,062 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:01:58,064 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:01:58,064 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:01:58,067 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:01:58,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:01:56" (1/3) ... [2023-08-27 10:01:58,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2be4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:01:58, skipping insertion in model container [2023-08-27 10:01:58,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:01:57" (2/3) ... [2023-08-27 10:01:58,068 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2be4ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:01:58, skipping insertion in model container [2023-08-27 10:01:58,068 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:01:58" (3/3) ... [2023-08-27 10:01:58,070 INFO L112 eAbstractionObserver]: Analyzing ICFG mix013.opt.i [2023-08-27 10:01:58,086 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:01:58,086 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:01:58,087 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:01:58,150 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:01:58,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 143 transitions, 306 flow [2023-08-27 10:01:58,264 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-27 10:01:58,264 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:01:58,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-27 10:01:58,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 143 transitions, 306 flow [2023-08-27 10:01:58,277 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 139 transitions, 290 flow [2023-08-27 10:01:58,280 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:01:58,291 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-27 10:01:58,295 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 139 transitions, 290 flow [2023-08-27 10:01:58,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 290 flow [2023-08-27 10:01:58,347 INFO L124 PetriNetUnfolderBase]: 3/139 cut-off events. [2023-08-27 10:01:58,347 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:01:58,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 139 events. 3/139 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 105 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-27 10:01:58,352 INFO L119 LiptonReduction]: Number of co-enabled transitions 4186 [2023-08-27 10:02:02,612 INFO L134 LiptonReduction]: Checked pairs total: 15626 [2023-08-27 10:02:02,612 INFO L136 LiptonReduction]: Total number of compositions: 123 [2023-08-27 10:02:02,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:02:02,627 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;@7f600c28, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:02:02,627 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:02:02,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:02:02,631 INFO L124 PetriNetUnfolderBase]: 0/6 cut-off events. [2023-08-27 10:02:02,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:02:02,631 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:02,632 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 10:02:02,632 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:02,636 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:02,636 INFO L85 PathProgramCache]: Analyzing trace with hash 611875541, now seen corresponding path program 1 times [2023-08-27 10:02:02,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:02,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964255298] [2023-08-27 10:02:02,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:02,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:02,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:02,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:02,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:02,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964255298] [2023-08-27 10:02:02,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964255298] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:02,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:02,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:02:02,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503284247] [2023-08-27 10:02:02,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:02,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:02:02,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:02,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:02:02,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:02:02,883 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-27 10:02:02,885 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:02,885 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:02,885 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-27 10:02:02,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:04,220 INFO L124 PetriNetUnfolderBase]: 9509/13235 cut-off events. [2023-08-27 10:02:04,220 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2023-08-27 10:02:04,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26645 conditions, 13235 events. 9509/13235 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 947. Compared 79301 event pairs, 2559 based on Foata normal form. 0/8404 useless extension candidates. Maximal degree in co-relation 26633. Up to 12139 conditions per place. [2023-08-27 10:02:04,334 INFO L140 encePairwiseOnDemand]: 252/266 looper letters, 49 selfloop transitions, 5 changer transitions 0/58 dead transitions. [2023-08-27 10:02:04,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 245 flow [2023-08-27 10:02:04,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:02:04,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:02:04,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2023-08-27 10:02:04,351 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125313283208021 [2023-08-27 10:02:04,352 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 409 transitions. [2023-08-27 10:02:04,352 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 409 transitions. [2023-08-27 10:02:04,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:04,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 409 transitions. [2023-08-27 10:02:04,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.33333333333334) internal successors, (409), 3 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:04,366 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:04,367 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:04,368 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 86 flow. Second operand 3 states and 409 transitions. [2023-08-27 10:02:04,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 245 flow [2023-08-27 10:02:04,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 238 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:02:04,375 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 127 flow [2023-08-27 10:02:04,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-27 10:02:04,383 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-27 10:02:04,383 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 127 flow [2023-08-27 10:02:04,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.33333333333333) internal successors, (349), 3 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:04,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:04,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:04,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:02:04,385 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P3Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:04,392 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:04,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1419995137, now seen corresponding path program 1 times [2023-08-27 10:02:04,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:04,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702391115] [2023-08-27 10:02:04,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:04,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:04,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:04,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702391115] [2023-08-27 10:02:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702391115] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:04,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:04,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:02:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246912439] [2023-08-27 10:02:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:04,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:02:04,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:04,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:02:04,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:02:04,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 266 [2023-08-27 10:02:04,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:04,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:04,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 266 [2023-08-27 10:02:04,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:05,498 INFO L124 PetriNetUnfolderBase]: 6528/9783 cut-off events. [2023-08-27 10:02:05,498 INFO L125 PetriNetUnfolderBase]: For 1202/1607 co-relation queries the response was YES. [2023-08-27 10:02:05,521 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23747 conditions, 9783 events. 6528/9783 cut-off events. For 1202/1607 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 68038 event pairs, 1504 based on Foata normal form. 2/7265 useless extension candidates. Maximal degree in co-relation 23736. Up to 6994 conditions per place. [2023-08-27 10:02:05,571 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 46 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-27 10:02:05,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 276 flow [2023-08-27 10:02:05,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:02:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:02:05,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-08-27 10:02:05,573 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5037593984962406 [2023-08-27 10:02:05,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-08-27 10:02:05,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-08-27 10:02:05,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:05,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-08-27 10:02:05,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:05,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:05,577 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:05,577 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 127 flow. Second operand 3 states and 402 transitions. [2023-08-27 10:02:05,577 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 276 flow [2023-08-27 10:02:05,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:02:05,579 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 124 flow [2023-08-27 10:02:05,580 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-27 10:02:05,580 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-27 10:02:05,580 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 124 flow [2023-08-27 10:02:05,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:05,581 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:05,581 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:05,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:02:05,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:05,582 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:05,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1223133995, now seen corresponding path program 1 times [2023-08-27 10:02:05,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664302438] [2023-08-27 10:02:05,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:05,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:05,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:05,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:05,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664302438] [2023-08-27 10:02:05,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664302438] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:05,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:05,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:02:05,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917768329] [2023-08-27 10:02:05,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:05,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:05,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:05,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:05,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:05,629 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-27 10:02:05,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 124 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:05,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:05,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-27 10:02:05,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:06,288 INFO L124 PetriNetUnfolderBase]: 4789/6699 cut-off events. [2023-08-27 10:02:06,289 INFO L125 PetriNetUnfolderBase]: For 659/663 co-relation queries the response was YES. [2023-08-27 10:02:06,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16469 conditions, 6699 events. 4789/6699 cut-off events. For 659/663 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 35845 event pairs, 1132 based on Foata normal form. 2/5211 useless extension candidates. Maximal degree in co-relation 16457. Up to 5810 conditions per place. [2023-08-27 10:02:06,333 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 43 selfloop transitions, 5 changer transitions 0/52 dead transitions. [2023-08-27 10:02:06,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 52 transitions, 246 flow [2023-08-27 10:02:06,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:02:06,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:02:06,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-27 10:02:06,335 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48120300751879697 [2023-08-27 10:02:06,335 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-27 10:02:06,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-27 10:02:06,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:06,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-27 10:02:06,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.0) internal successors, (512), 4 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:06,339 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:06,339 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:06,339 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 124 flow. Second operand 4 states and 512 transitions. [2023-08-27 10:02:06,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 52 transitions, 246 flow [2023-08-27 10:02:06,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 52 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:02:06,342 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 114 flow [2023-08-27 10:02:06,342 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=114, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2023-08-27 10:02:06,343 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2023-08-27 10:02:06,343 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 114 flow [2023-08-27 10:02:06,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:06,344 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:06,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:06,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:02:06,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:06,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:06,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1194708262, now seen corresponding path program 1 times [2023-08-27 10:02:06,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:06,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441403770] [2023-08-27 10:02:06,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:06,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:06,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:06,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:06,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441403770] [2023-08-27 10:02:06,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441403770] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:06,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:06,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:02:06,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483389081] [2023-08-27 10:02:06,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:06,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:06,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:06,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:06,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:06,386 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-27 10:02:06,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:06,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:06,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-27 10:02:06,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:06,893 INFO L124 PetriNetUnfolderBase]: 2967/4214 cut-off events. [2023-08-27 10:02:06,894 INFO L125 PetriNetUnfolderBase]: For 1195/1199 co-relation queries the response was YES. [2023-08-27 10:02:06,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10327 conditions, 4214 events. 2967/4214 cut-off events. For 1195/1199 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 20600 event pairs, 638 based on Foata normal form. 2/3725 useless extension candidates. Maximal degree in co-relation 10315. Up to 1818 conditions per place. [2023-08-27 10:02:06,922 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 58 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-27 10:02:06,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 71 transitions, 338 flow [2023-08-27 10:02:06,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:02:06,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:02:06,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 531 transitions. [2023-08-27 10:02:06,924 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49906015037593987 [2023-08-27 10:02:06,924 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 531 transitions. [2023-08-27 10:02:06,924 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 531 transitions. [2023-08-27 10:02:06,925 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:06,925 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 531 transitions. [2023-08-27 10:02:06,926 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 132.75) internal successors, (531), 4 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:06,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:06,929 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:06,929 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 114 flow. Second operand 4 states and 531 transitions. [2023-08-27 10:02:06,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 71 transitions, 338 flow [2023-08-27 10:02:06,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 71 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:02:06,931 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 166 flow [2023-08-27 10:02:06,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=166, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-08-27 10:02:06,932 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -2 predicate places. [2023-08-27 10:02:06,932 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 166 flow [2023-08-27 10:02:06,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:06,933 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:06,933 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:06,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:02:06,933 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:06,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:06,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1184320637, now seen corresponding path program 1 times [2023-08-27 10:02:06,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:06,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925313767] [2023-08-27 10:02:06,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:06,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:06,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:07,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:07,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:07,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925313767] [2023-08-27 10:02:07,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925313767] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:07,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:07,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:02:07,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570145939] [2023-08-27 10:02:07,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:07,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:02:07,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:07,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:02:07,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:02:07,065 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 266 [2023-08-27 10:02:07,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 39 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:07,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:07,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 266 [2023-08-27 10:02:07,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:07,463 INFO L124 PetriNetUnfolderBase]: 2733/4036 cut-off events. [2023-08-27 10:02:07,463 INFO L125 PetriNetUnfolderBase]: For 3216/3216 co-relation queries the response was YES. [2023-08-27 10:02:07,470 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11502 conditions, 4036 events. 2733/4036 cut-off events. For 3216/3216 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 21720 event pairs, 916 based on Foata normal form. 0/3639 useless extension candidates. Maximal degree in co-relation 11489. Up to 2572 conditions per place. [2023-08-27 10:02:07,485 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 52 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-08-27 10:02:07,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 369 flow [2023-08-27 10:02:07,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:02:07,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:02:07,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 398 transitions. [2023-08-27 10:02:07,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49874686716791977 [2023-08-27 10:02:07,488 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 398 transitions. [2023-08-27 10:02:07,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 398 transitions. [2023-08-27 10:02:07,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:07,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 398 transitions. [2023-08-27 10:02:07,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:07,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:07,491 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 266.0) internal successors, (1064), 4 states have internal predecessors, (1064), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:07,491 INFO L175 Difference]: Start difference. First operand has 47 places, 39 transitions, 166 flow. Second operand 3 states and 398 transitions. [2023-08-27 10:02:07,491 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 369 flow [2023-08-27 10:02:07,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 58 transitions, 339 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-08-27 10:02:07,496 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 156 flow [2023-08-27 10:02:07,496 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2023-08-27 10:02:07,498 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -1 predicate places. [2023-08-27 10:02:07,498 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 156 flow [2023-08-27 10:02:07,499 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:07,499 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:07,499 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:07,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:02:07,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:07,499 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash -61505107, now seen corresponding path program 1 times [2023-08-27 10:02:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225395025] [2023-08-27 10:02:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:07,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:07,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:07,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225395025] [2023-08-27 10:02:07,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225395025] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:07,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:07,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:02:07,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506850183] [2023-08-27 10:02:07,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:07,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:07,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:07,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:07,748 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 266 [2023-08-27 10:02:07,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 156 flow. Second operand has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:07,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:07,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 266 [2023-08-27 10:02:07,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:08,647 INFO L124 PetriNetUnfolderBase]: 7611/10538 cut-off events. [2023-08-27 10:02:08,648 INFO L125 PetriNetUnfolderBase]: For 4342/4342 co-relation queries the response was YES. [2023-08-27 10:02:08,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27907 conditions, 10538 events. 7611/10538 cut-off events. For 4342/4342 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 51518 event pairs, 2286 based on Foata normal form. 134/10318 useless extension candidates. Maximal degree in co-relation 27893. Up to 6545 conditions per place. [2023-08-27 10:02:08,791 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 83 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2023-08-27 10:02:08,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 91 transitions, 557 flow [2023-08-27 10:02:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:02:08,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:02:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 510 transitions. [2023-08-27 10:02:08,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4793233082706767 [2023-08-27 10:02:08,794 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 510 transitions. [2023-08-27 10:02:08,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 510 transitions. [2023-08-27 10:02:08,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:08,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 510 transitions. [2023-08-27 10:02:08,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.5) internal successors, (510), 4 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:08,798 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:08,799 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:08,799 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 156 flow. Second operand 4 states and 510 transitions. [2023-08-27 10:02:08,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 91 transitions, 557 flow [2023-08-27 10:02:08,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 91 transitions, 549 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:02:08,809 INFO L231 Difference]: Finished difference. Result has 52 places, 45 transitions, 211 flow [2023-08-27 10:02:08,809 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=211, PETRI_PLACES=52, PETRI_TRANSITIONS=45} [2023-08-27 10:02:08,811 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 3 predicate places. [2023-08-27 10:02:08,814 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 45 transitions, 211 flow [2023-08-27 10:02:08,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.25) internal successors, (453), 4 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:08,815 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:08,815 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:08,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:02:08,815 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:08,815 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:08,816 INFO L85 PathProgramCache]: Analyzing trace with hash 533242577, now seen corresponding path program 1 times [2023-08-27 10:02:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:08,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758204116] [2023-08-27 10:02:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:08,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:09,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:09,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758204116] [2023-08-27 10:02:09,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758204116] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:09,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:09,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:09,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065728445] [2023-08-27 10:02:09,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:09,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:09,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:09,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:09,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266 [2023-08-27 10:02:09,045 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 45 transitions, 211 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:09,045 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:09,045 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266 [2023-08-27 10:02:09,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:09,705 INFO L124 PetriNetUnfolderBase]: 4162/6361 cut-off events. [2023-08-27 10:02:09,705 INFO L125 PetriNetUnfolderBase]: For 3496/3824 co-relation queries the response was YES. [2023-08-27 10:02:09,725 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18735 conditions, 6361 events. 4162/6361 cut-off events. For 3496/3824 co-relation queries the response was YES. Maximal size of possible extension queue 363. Compared 37802 event pairs, 553 based on Foata normal form. 430/6081 useless extension candidates. Maximal degree in co-relation 18718. Up to 3618 conditions per place. [2023-08-27 10:02:09,752 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 65 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-08-27 10:02:09,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 78 transitions, 475 flow [2023-08-27 10:02:09,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:02:09,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:02:09,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-27 10:02:09,754 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830827067669173 [2023-08-27 10:02:09,754 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-27 10:02:09,755 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-27 10:02:09,755 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:09,755 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-27 10:02:09,756 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:09,758 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:09,758 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:09,758 INFO L175 Difference]: Start difference. First operand has 52 places, 45 transitions, 211 flow. Second operand 4 states and 514 transitions. [2023-08-27 10:02:09,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 78 transitions, 475 flow [2023-08-27 10:02:09,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:02:09,764 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 239 flow [2023-08-27 10:02:09,764 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=239, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-08-27 10:02:09,764 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-08-27 10:02:09,764 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 239 flow [2023-08-27 10:02:09,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:09,765 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:09,765 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:09,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:02:09,765 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:09,766 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:09,766 INFO L85 PathProgramCache]: Analyzing trace with hash -1003675378, now seen corresponding path program 1 times [2023-08-27 10:02:09,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:09,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119179864] [2023-08-27 10:02:09,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:09,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:09,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:09,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:09,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119179864] [2023-08-27 10:02:09,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119179864] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:09,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:09,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:09,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837828965] [2023-08-27 10:02:09,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:09,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:02:09,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:02:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:02:09,835 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-27 10:02:09,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 239 flow. Second operand has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:09,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:09,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-27 10:02:09,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:10,423 INFO L124 PetriNetUnfolderBase]: 3633/5487 cut-off events. [2023-08-27 10:02:10,423 INFO L125 PetriNetUnfolderBase]: For 5469/5854 co-relation queries the response was YES. [2023-08-27 10:02:10,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17309 conditions, 5487 events. 3633/5487 cut-off events. For 5469/5854 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 31496 event pairs, 560 based on Foata normal form. 111/5263 useless extension candidates. Maximal degree in co-relation 17289. Up to 2301 conditions per place. [2023-08-27 10:02:10,464 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 77 selfloop transitions, 13 changer transitions 0/97 dead transitions. [2023-08-27 10:02:10,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 97 transitions, 616 flow [2023-08-27 10:02:10,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:02:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:02:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 660 transitions. [2023-08-27 10:02:10,466 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49624060150375937 [2023-08-27 10:02:10,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 660 transitions. [2023-08-27 10:02:10,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 660 transitions. [2023-08-27 10:02:10,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:10,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 660 transitions. [2023-08-27 10:02:10,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.0) internal successors, (660), 5 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-27 10:02:10,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:10,470 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:10,470 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 239 flow. Second operand 5 states and 660 transitions. [2023-08-27 10:02:10,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 97 transitions, 616 flow [2023-08-27 10:02:10,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 97 transitions, 607 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:02:10,476 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 306 flow [2023-08-27 10:02:10,477 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-08-27 10:02:10,477 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2023-08-27 10:02:10,477 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 306 flow [2023-08-27 10:02:10,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.6) internal successors, (588), 5 states have internal predecessors, (588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:10,478 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:10,478 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:10,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:02:10,478 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:10,478 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:10,478 INFO L85 PathProgramCache]: Analyzing trace with hash -547273037, now seen corresponding path program 1 times [2023-08-27 10:02:10,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:10,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546436063] [2023-08-27 10:02:10,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:10,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:10,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:10,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546436063] [2023-08-27 10:02:10,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546436063] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:10,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:10,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:02:10,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223211441] [2023-08-27 10:02:10,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:10,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:02:10,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:10,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:02:10,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:02:10,650 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266 [2023-08-27 10:02:10,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 306 flow. Second operand has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:10,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:10,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266 [2023-08-27 10:02:10,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:11,138 INFO L124 PetriNetUnfolderBase]: 2449/3893 cut-off events. [2023-08-27 10:02:11,138 INFO L125 PetriNetUnfolderBase]: For 6683/7130 co-relation queries the response was YES. [2023-08-27 10:02:11,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13866 conditions, 3893 events. 2449/3893 cut-off events. For 6683/7130 co-relation queries the response was YES. Maximal size of possible extension queue 222. Compared 22293 event pairs, 505 based on Foata normal form. 321/3986 useless extension candidates. Maximal degree in co-relation 13845. Up to 1229 conditions per place. [2023-08-27 10:02:11,171 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 77 selfloop transitions, 10 changer transitions 0/94 dead transitions. [2023-08-27 10:02:11,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 94 transitions, 671 flow [2023-08-27 10:02:11,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:02:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:02:11,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 643 transitions. [2023-08-27 10:02:11,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48345864661654137 [2023-08-27 10:02:11,173 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 643 transitions. [2023-08-27 10:02:11,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 643 transitions. [2023-08-27 10:02:11,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:11,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 643 transitions. [2023-08-27 10:02:11,175 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.6) internal successors, (643), 5 states have internal predecessors, (643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:11,179 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:11,179 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:11,179 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 306 flow. Second operand 5 states and 643 transitions. [2023-08-27 10:02:11,179 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 94 transitions, 671 flow [2023-08-27 10:02:11,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 617 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-27 10:02:11,222 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 315 flow [2023-08-27 10:02:11,223 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-08-27 10:02:11,223 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-27 10:02:11,224 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 315 flow [2023-08-27 10:02:11,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:11,224 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:11,224 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:11,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:02:11,224 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:11,225 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2038125681, now seen corresponding path program 1 times [2023-08-27 10:02:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:11,226 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341210776] [2023-08-27 10:02:11,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:11,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:11,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:11,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:11,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341210776] [2023-08-27 10:02:11,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341210776] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:11,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:11,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:02:11,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162661774] [2023-08-27 10:02:11,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:11,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:02:11,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:11,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:02:11,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:02:11,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-27 10:02:11,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 315 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:11,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:11,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-27 10:02:11,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:12,249 INFO L124 PetriNetUnfolderBase]: 5653/8478 cut-off events. [2023-08-27 10:02:12,249 INFO L125 PetriNetUnfolderBase]: For 19181/19181 co-relation queries the response was YES. [2023-08-27 10:02:12,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32013 conditions, 8478 events. 5653/8478 cut-off events. For 19181/19181 co-relation queries the response was YES. Maximal size of possible extension queue 295. Compared 47399 event pairs, 657 based on Foata normal form. 43/8457 useless extension candidates. Maximal degree in co-relation 31990. Up to 4571 conditions per place. [2023-08-27 10:02:12,303 INFO L140 encePairwiseOnDemand]: 256/266 looper letters, 139 selfloop transitions, 21 changer transitions 4/164 dead transitions. [2023-08-27 10:02:12,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 164 transitions, 1253 flow [2023-08-27 10:02:12,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:02:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:02:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2023-08-27 10:02:12,311 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4780701754385965 [2023-08-27 10:02:12,311 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2023-08-27 10:02:12,311 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2023-08-27 10:02:12,311 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:12,311 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2023-08-27 10:02:12,313 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:12,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:12,316 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:12,316 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 315 flow. Second operand 6 states and 763 transitions. [2023-08-27 10:02:12,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 164 transitions, 1253 flow [2023-08-27 10:02:12,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 164 transitions, 1215 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 10:02:12,406 INFO L231 Difference]: Finished difference. Result has 68 places, 69 transitions, 491 flow [2023-08-27 10:02:12,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=491, PETRI_PLACES=68, PETRI_TRANSITIONS=69} [2023-08-27 10:02:12,407 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2023-08-27 10:02:12,407 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 69 transitions, 491 flow [2023-08-27 10:02:12,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:12,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:12,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:12,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:02:12,408 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:12,408 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash -823688725, now seen corresponding path program 2 times [2023-08-27 10:02:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:12,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893784067] [2023-08-27 10:02:12,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:12,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:12,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893784067] [2023-08-27 10:02:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893784067] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:02:12,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888664761] [2023-08-27 10:02:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:12,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:02:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:12,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:02:12,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:02:12,623 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266 [2023-08-27 10:02:12,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 69 transitions, 491 flow. Second operand has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:12,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:12,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266 [2023-08-27 10:02:12,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:13,225 INFO L124 PetriNetUnfolderBase]: 3409/5518 cut-off events. [2023-08-27 10:02:13,225 INFO L125 PetriNetUnfolderBase]: For 14727/15273 co-relation queries the response was YES. [2023-08-27 10:02:13,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23113 conditions, 5518 events. 3409/5518 cut-off events. For 14727/15273 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 35010 event pairs, 703 based on Foata normal form. 262/5398 useless extension candidates. Maximal degree in co-relation 23086. Up to 1984 conditions per place. [2023-08-27 10:02:13,256 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 90 selfloop transitions, 14 changer transitions 0/117 dead transitions. [2023-08-27 10:02:13,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 117 transitions, 916 flow [2023-08-27 10:02:13,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:02:13,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:02:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2023-08-27 10:02:13,259 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824561403508772 [2023-08-27 10:02:13,260 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2023-08-27 10:02:13,260 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2023-08-27 10:02:13,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:13,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2023-08-27 10:02:13,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:13,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:13,265 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:13,265 INFO L175 Difference]: Start difference. First operand has 68 places, 69 transitions, 491 flow. Second operand 6 states and 770 transitions. [2023-08-27 10:02:13,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 117 transitions, 916 flow [2023-08-27 10:02:13,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 117 transitions, 910 flow, removed 3 selfloop flow, removed 0 redundant places. [2023-08-27 10:02:13,360 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 523 flow [2023-08-27 10:02:13,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=523, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2023-08-27 10:02:13,361 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 26 predicate places. [2023-08-27 10:02:13,361 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 523 flow [2023-08-27 10:02:13,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.83333333333333) internal successors, (695), 6 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:13,361 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:13,361 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:13,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:02:13,361 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:13,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:13,362 INFO L85 PathProgramCache]: Analyzing trace with hash 658248331, now seen corresponding path program 1 times [2023-08-27 10:02:13,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:13,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153785512] [2023-08-27 10:02:13,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:13,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:13,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:13,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:13,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:13,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153785512] [2023-08-27 10:02:13,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153785512] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:13,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:13,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:02:13,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485218058] [2023-08-27 10:02:13,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:13,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:02:13,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:13,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:02:13,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:02:13,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 266 [2023-08-27 10:02:13,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:13,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:13,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 266 [2023-08-27 10:02:13,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:14,097 INFO L124 PetriNetUnfolderBase]: 3381/5422 cut-off events. [2023-08-27 10:02:14,097 INFO L125 PetriNetUnfolderBase]: For 21417/21969 co-relation queries the response was YES. [2023-08-27 10:02:14,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24937 conditions, 5422 events. 3381/5422 cut-off events. For 21417/21969 co-relation queries the response was YES. Maximal size of possible extension queue 373. Compared 34212 event pairs, 703 based on Foata normal form. 100/5208 useless extension candidates. Maximal degree in co-relation 24906. Up to 1984 conditions per place. [2023-08-27 10:02:14,122 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 61 selfloop transitions, 17 changer transitions 17/103 dead transitions. [2023-08-27 10:02:14,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 103 transitions, 852 flow [2023-08-27 10:02:14,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:02:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:02:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 769 transitions. [2023-08-27 10:02:14,125 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4818295739348371 [2023-08-27 10:02:14,125 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 769 transitions. [2023-08-27 10:02:14,125 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 769 transitions. [2023-08-27 10:02:14,126 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:14,126 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 769 transitions. [2023-08-27 10:02:14,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.16666666666666) internal successors, (769), 6 states have internal predecessors, (769), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:14,130 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:14,130 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 266.0) internal successors, (1862), 7 states have internal predecessors, (1862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:14,130 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 523 flow. Second operand 6 states and 769 transitions. [2023-08-27 10:02:14,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 103 transitions, 852 flow [2023-08-27 10:02:14,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 103 transitions, 828 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:02:14,277 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 379 flow [2023-08-27 10:02:14,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=379, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2023-08-27 10:02:14,278 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 23 predicate places. [2023-08-27 10:02:14,278 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 379 flow [2023-08-27 10:02:14,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.16666666666667) internal successors, (709), 6 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:14,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:14,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:14,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:02:14,278 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:14,279 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:14,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1640939673, now seen corresponding path program 1 times [2023-08-27 10:02:14,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:14,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235467850] [2023-08-27 10:02:14,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:14,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:14,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:14,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235467850] [2023-08-27 10:02:14,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235467850] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:14,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:14,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:14,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645560150] [2023-08-27 10:02:14,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:14,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:14,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:14,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:14,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:14,445 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-27 10:02:14,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 379 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-27 10:02:14,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:14,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-27 10:02:14,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:15,325 INFO L124 PetriNetUnfolderBase]: 6265/9393 cut-off events. [2023-08-27 10:02:15,325 INFO L125 PetriNetUnfolderBase]: For 40618/40618 co-relation queries the response was YES. [2023-08-27 10:02:15,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44815 conditions, 9393 events. 6265/9393 cut-off events. For 40618/40618 co-relation queries the response was YES. Maximal size of possible extension queue 386. Compared 54432 event pairs, 432 based on Foata normal form. 10/9403 useless extension candidates. Maximal degree in co-relation 44784. Up to 5951 conditions per place. [2023-08-27 10:02:15,372 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 89 selfloop transitions, 17 changer transitions 17/123 dead transitions. [2023-08-27 10:02:15,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 123 transitions, 1166 flow [2023-08-27 10:02:15,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:02:15,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:02:15,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2023-08-27 10:02:15,375 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462406015037594 [2023-08-27 10:02:15,375 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 615 transitions. [2023-08-27 10:02:15,375 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 615 transitions. [2023-08-27 10:02:15,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:15,376 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 615 transitions. [2023-08-27 10:02:15,377 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:15,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:15,380 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:15,380 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 379 flow. Second operand 5 states and 615 transitions. [2023-08-27 10:02:15,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 123 transitions, 1166 flow [2023-08-27 10:02:15,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 123 transitions, 967 flow, removed 29 selfloop flow, removed 10 redundant places. [2023-08-27 10:02:15,592 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 389 flow [2023-08-27 10:02:15,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=389, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-08-27 10:02:15,593 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 17 predicate places. [2023-08-27 10:02:15,593 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 389 flow [2023-08-27 10:02:15,594 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-27 10:02:15,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:15,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:15,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:02:15,594 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:15,594 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2009323185, now seen corresponding path program 2 times [2023-08-27 10:02:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:15,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998460182] [2023-08-27 10:02:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:15,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:15,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:15,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:15,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998460182] [2023-08-27 10:02:15,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998460182] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:15,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:15,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:02:15,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791475544] [2023-08-27 10:02:15,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:15,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:02:15,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:15,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:02:15,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:02:15,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 266 [2023-08-27 10:02:15,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 389 flow. Second operand has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:15,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:15,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 266 [2023-08-27 10:02:15,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:16,232 INFO L124 PetriNetUnfolderBase]: 1678/2736 cut-off events. [2023-08-27 10:02:16,232 INFO L125 PetriNetUnfolderBase]: For 9260/9660 co-relation queries the response was YES. [2023-08-27 10:02:16,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12163 conditions, 2736 events. 1678/2736 cut-off events. For 9260/9660 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 15644 event pairs, 268 based on Foata normal form. 147/2754 useless extension candidates. Maximal degree in co-relation 12136. Up to 976 conditions per place. [2023-08-27 10:02:16,247 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 61 selfloop transitions, 18 changer transitions 8/95 dead transitions. [2023-08-27 10:02:16,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 95 transitions, 784 flow [2023-08-27 10:02:16,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:02:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:02:16,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 861 transitions. [2023-08-27 10:02:16,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.462406015037594 [2023-08-27 10:02:16,250 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 861 transitions. [2023-08-27 10:02:16,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 861 transitions. [2023-08-27 10:02:16,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:16,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 861 transitions. [2023-08-27 10:02:16,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.0) internal successors, (861), 7 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:16,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:16,255 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 266.0) internal successors, (2128), 8 states have internal predecessors, (2128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:16,255 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 389 flow. Second operand 7 states and 861 transitions. [2023-08-27 10:02:16,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 95 transitions, 784 flow [2023-08-27 10:02:16,309 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 95 transitions, 682 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-08-27 10:02:16,310 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 312 flow [2023-08-27 10:02:16,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=312, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2023-08-27 10:02:16,311 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 15 predicate places. [2023-08-27 10:02:16,311 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 312 flow [2023-08-27 10:02:16,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:16,311 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:16,312 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:16,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:02:16,312 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:16,312 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash 576811413, now seen corresponding path program 1 times [2023-08-27 10:02:16,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:16,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351484591] [2023-08-27 10:02:16,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:16,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:16,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:16,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:16,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351484591] [2023-08-27 10:02:16,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351484591] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:16,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:16,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:16,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589427405] [2023-08-27 10:02:16,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:16,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:16,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:16,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:16,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:16,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 266 [2023-08-27 10:02:16,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:16,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:16,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 266 [2023-08-27 10:02:16,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:16,822 INFO L124 PetriNetUnfolderBase]: 1679/2659 cut-off events. [2023-08-27 10:02:16,823 INFO L125 PetriNetUnfolderBase]: For 5393/5393 co-relation queries the response was YES. [2023-08-27 10:02:16,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10609 conditions, 2659 events. 1679/2659 cut-off events. For 5393/5393 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 13023 event pairs, 398 based on Foata normal form. 1/2660 useless extension candidates. Maximal degree in co-relation 10592. Up to 1845 conditions per place. [2023-08-27 10:02:16,829 INFO L140 encePairwiseOnDemand]: 257/266 looper letters, 70 selfloop transitions, 16 changer transitions 34/120 dead transitions. [2023-08-27 10:02:16,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 120 transitions, 963 flow [2023-08-27 10:02:16,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:02:16,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:02:16,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2023-08-27 10:02:16,831 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4616541353383459 [2023-08-27 10:02:16,831 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 614 transitions. [2023-08-27 10:02:16,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 614 transitions. [2023-08-27 10:02:16,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:16,832 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 614 transitions. [2023-08-27 10:02:16,833 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.8) internal successors, (614), 5 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:16,835 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:16,835 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 266.0) internal successors, (1596), 6 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:16,835 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 312 flow. Second operand 5 states and 614 transitions. [2023-08-27 10:02:16,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 120 transitions, 963 flow [2023-08-27 10:02:16,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 120 transitions, 871 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-08-27 10:02:16,846 INFO L231 Difference]: Finished difference. Result has 62 places, 56 transitions, 391 flow [2023-08-27 10:02:16,846 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=391, PETRI_PLACES=62, PETRI_TRANSITIONS=56} [2023-08-27 10:02:16,847 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-27 10:02:16,848 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 56 transitions, 391 flow [2023-08-27 10:02:16,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.5) internal successors, (458), 4 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:16,848 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:16,848 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:16,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:02:16,848 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:16,849 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:16,849 INFO L85 PathProgramCache]: Analyzing trace with hash 2032818403, now seen corresponding path program 2 times [2023-08-27 10:02:16,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:16,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017130006] [2023-08-27 10:02:16,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:17,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:17,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:17,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017130006] [2023-08-27 10:02:17,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1017130006] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:17,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:17,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:17,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565609034] [2023-08-27 10:02:17,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:17,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:17,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:17,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:17,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:17,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 10:02:17,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 56 transitions, 391 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:17,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:17,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 10:02:17,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:17,317 INFO L124 PetriNetUnfolderBase]: 1396/2389 cut-off events. [2023-08-27 10:02:17,317 INFO L125 PetriNetUnfolderBase]: For 6145/6238 co-relation queries the response was YES. [2023-08-27 10:02:17,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9350 conditions, 2389 events. 1396/2389 cut-off events. For 6145/6238 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 13545 event pairs, 373 based on Foata normal form. 4/2341 useless extension candidates. Maximal degree in co-relation 9326. Up to 1105 conditions per place. [2023-08-27 10:02:17,327 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 40 selfloop transitions, 1 changer transitions 56/101 dead transitions. [2023-08-27 10:02:17,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 101 transitions, 800 flow [2023-08-27 10:02:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:02:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:02:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 514 transitions. [2023-08-27 10:02:17,329 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4830827067669173 [2023-08-27 10:02:17,329 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 514 transitions. [2023-08-27 10:02:17,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 514 transitions. [2023-08-27 10:02:17,329 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:17,329 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 514 transitions. [2023-08-27 10:02:17,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 128.5) internal successors, (514), 4 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:17,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:17,333 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:17,333 INFO L175 Difference]: Start difference. First operand has 62 places, 56 transitions, 391 flow. Second operand 4 states and 514 transitions. [2023-08-27 10:02:17,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 101 transitions, 800 flow [2023-08-27 10:02:17,346 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 101 transitions, 734 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-08-27 10:02:17,348 INFO L231 Difference]: Finished difference. Result has 62 places, 42 transitions, 220 flow [2023-08-27 10:02:17,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=62, PETRI_TRANSITIONS=42} [2023-08-27 10:02:17,349 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 13 predicate places. [2023-08-27 10:02:17,349 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 42 transitions, 220 flow [2023-08-27 10:02:17,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:17,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:17,350 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:17,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:02:17,350 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:17,350 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:17,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1383953913, now seen corresponding path program 3 times [2023-08-27 10:02:17,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:17,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461217213] [2023-08-27 10:02:17,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:17,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:17,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:17,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:17,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461217213] [2023-08-27 10:02:17,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461217213] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:17,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:17,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:02:17,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696280423] [2023-08-27 10:02:17,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:17,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:02:17,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:17,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:02:17,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:02:17,526 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 266 [2023-08-27 10:02:17,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 42 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:17,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:17,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 266 [2023-08-27 10:02:17,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:17,682 INFO L124 PetriNetUnfolderBase]: 641/1115 cut-off events. [2023-08-27 10:02:17,682 INFO L125 PetriNetUnfolderBase]: For 3105/3174 co-relation queries the response was YES. [2023-08-27 10:02:17,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4225 conditions, 1115 events. 641/1115 cut-off events. For 3105/3174 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 5642 event pairs, 210 based on Foata normal form. 1/1090 useless extension candidates. Maximal degree in co-relation 4206. Up to 542 conditions per place. [2023-08-27 10:02:17,687 INFO L140 encePairwiseOnDemand]: 263/266 looper letters, 44 selfloop transitions, 1 changer transitions 29/77 dead transitions. [2023-08-27 10:02:17,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 508 flow [2023-08-27 10:02:17,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:02:17,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:02:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 508 transitions. [2023-08-27 10:02:17,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4774436090225564 [2023-08-27 10:02:17,689 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 508 transitions. [2023-08-27 10:02:17,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 508 transitions. [2023-08-27 10:02:17,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:17,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 508 transitions. [2023-08-27 10:02:17,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.0) internal successors, (508), 4 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-27 10:02:17,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:17,694 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 266.0) internal successors, (1330), 5 states have internal predecessors, (1330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:17,694 INFO L175 Difference]: Start difference. First operand has 62 places, 42 transitions, 220 flow. Second operand 4 states and 508 transitions. [2023-08-27 10:02:17,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 508 flow [2023-08-27 10:02:17,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 495 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-08-27 10:02:17,698 INFO L231 Difference]: Finished difference. Result has 60 places, 38 transitions, 181 flow [2023-08-27 10:02:17,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=181, PETRI_PLACES=60, PETRI_TRANSITIONS=38} [2023-08-27 10:02:17,698 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 11 predicate places. [2023-08-27 10:02:17,698 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 38 transitions, 181 flow [2023-08-27 10:02:17,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:17,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:17,699 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:17,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:02:17,699 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:17,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:17,699 INFO L85 PathProgramCache]: Analyzing trace with hash 238767449, now seen corresponding path program 4 times [2023-08-27 10:02:17,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:17,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716926410] [2023-08-27 10:02:17,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:17,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:02:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:02:18,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:02:18,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716926410] [2023-08-27 10:02:18,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716926410] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:02:18,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:02:18,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:02:18,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983657736] [2023-08-27 10:02:18,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:02:18,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:02:18,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:02:18,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:02:18,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:02:18,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 266 [2023-08-27 10:02:18,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 38 transitions, 181 flow. Second operand has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:18,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:02:18,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 266 [2023-08-27 10:02:18,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:02:19,076 INFO L124 PetriNetUnfolderBase]: 426/768 cut-off events. [2023-08-27 10:02:19,076 INFO L125 PetriNetUnfolderBase]: For 2002/2040 co-relation queries the response was YES. [2023-08-27 10:02:19,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 768 events. 426/768 cut-off events. For 2002/2040 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 3875 event pairs, 80 based on Foata normal form. 2/723 useless extension candidates. Maximal degree in co-relation 2868. Up to 295 conditions per place. [2023-08-27 10:02:19,079 INFO L140 encePairwiseOnDemand]: 259/266 looper letters, 34 selfloop transitions, 4 changer transitions 36/78 dead transitions. [2023-08-27 10:02:19,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 509 flow [2023-08-27 10:02:19,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 10:02:19,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 10:02:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 915 transitions. [2023-08-27 10:02:19,082 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4299812030075188 [2023-08-27 10:02:19,082 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 915 transitions. [2023-08-27 10:02:19,082 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 915 transitions. [2023-08-27 10:02:19,082 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:02:19,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 915 transitions. [2023-08-27 10:02:19,084 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 114.375) internal successors, (915), 8 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:19,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:19,088 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 266.0) internal successors, (2394), 9 states have internal predecessors, (2394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:19,088 INFO L175 Difference]: Start difference. First operand has 60 places, 38 transitions, 181 flow. Second operand 8 states and 915 transitions. [2023-08-27 10:02:19,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 509 flow [2023-08-27 10:02:19,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 78 transitions, 501 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-27 10:02:19,091 INFO L231 Difference]: Finished difference. Result has 65 places, 38 transitions, 190 flow [2023-08-27 10:02:19,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=266, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=190, PETRI_PLACES=65, PETRI_TRANSITIONS=38} [2023-08-27 10:02:19,091 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2023-08-27 10:02:19,091 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 38 transitions, 190 flow [2023-08-27 10:02:19,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.14285714285714) internal successors, (785), 7 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:02:19,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:02:19,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:19,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:02:19,092 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:02:19,092 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:02:19,092 INFO L85 PathProgramCache]: Analyzing trace with hash 519120907, now seen corresponding path program 5 times [2023-08-27 10:02:19,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:02:19,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241442438] [2023-08-27 10:02:19,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:02:19,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:02:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:02:19,124 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:02:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:02:19,181 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:02:19,181 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:02:19,182 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:02:19,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-27 10:02:19,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:02:19,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 10:02:19,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (15 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:02:19,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-27 10:02:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:02:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 10:02:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:02:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:02:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:02:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 23 remaining) [2023-08-27 10:02:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:02:19,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:02:19,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 10:02:19,186 INFO L445 BasicCegarLoop]: Path program histogram: [5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:02:19,191 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:02:19,192 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:02:19,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:02:19 BasicIcfg [2023-08-27 10:02:19,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:02:19,292 INFO L158 Benchmark]: Toolchain (without parser) took 22685.78ms. Allocated memory was 341.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 316.6MB in the beginning and 1.4GB in the end (delta: -1.0GB). Peak memory consumption was 73.2MB. Max. memory is 16.0GB. [2023-08-27 10:02:19,292 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 341.8MB. Free memory is still 318.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:02:19,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 574.91ms. Allocated memory is still 341.8MB. Free memory was 316.6MB in the beginning and 292.4MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:02:19,293 INFO L158 Benchmark]: Boogie Procedure Inliner took 79.72ms. Allocated memory is still 341.8MB. Free memory was 292.4MB in the beginning and 289.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2023-08-27 10:02:19,293 INFO L158 Benchmark]: Boogie Preprocessor took 50.40ms. Allocated memory is still 341.8MB. Free memory was 289.4MB in the beginning and 287.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:02:19,293 INFO L158 Benchmark]: RCFGBuilder took 744.81ms. Allocated memory is still 341.8MB. Free memory was 287.3MB in the beginning and 295.5MB in the end (delta: -8.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. [2023-08-27 10:02:19,293 INFO L158 Benchmark]: TraceAbstraction took 21227.55ms. Allocated memory was 341.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 294.6MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 49.9MB. Max. memory is 16.0GB. [2023-08-27 10:02:19,294 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.17ms. Allocated memory is still 341.8MB. Free memory is still 318.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 574.91ms. Allocated memory is still 341.8MB. Free memory was 316.6MB in the beginning and 292.4MB in the end (delta: 24.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 79.72ms. Allocated memory is still 341.8MB. Free memory was 292.4MB in the beginning and 289.4MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * Boogie Preprocessor took 50.40ms. Allocated memory is still 341.8MB. Free memory was 289.4MB in the beginning and 287.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 744.81ms. Allocated memory is still 341.8MB. Free memory was 287.3MB in the beginning and 295.5MB in the end (delta: -8.2MB). Peak memory consumption was 27.4MB. Max. memory is 16.0GB. * TraceAbstraction took 21227.55ms. Allocated memory was 341.8MB in the beginning and 1.4GB in the end (delta: 1.1GB). Free memory was 294.6MB in the beginning and 1.4GB in the end (delta: -1.1GB). Peak memory consumption was 49.9MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 149 PlacesBefore, 49 PlacesAfterwards, 139 TransitionsBefore, 37 TransitionsAfterwards, 4186 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 123 TotalNumberOfCompositions, 15626 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6732, independent: 6383, independent conditional: 0, independent unconditional: 6383, dependent: 349, dependent conditional: 0, dependent unconditional: 349, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2369, independent: 2299, independent conditional: 0, independent unconditional: 2299, dependent: 70, dependent conditional: 0, dependent unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6732, independent: 4084, independent conditional: 0, independent unconditional: 4084, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 2369, unknown conditional: 0, unknown unconditional: 2369] , Statistics on independence cache: Total cache size (in pairs): 246, Positive cache size: 221, Positive conditional cache size: 0, Positive unconditional cache size: 221, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p1_EBX = 0; [L718] 0 int __unbuffered_p2_EAX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t325; [L872] FCALL, FORK 0 pthread_create(&t325, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t325, ((void *)0), P0, ((void *)0))=-3, t325={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L873] 0 pthread_t t326; [L874] FCALL, FORK 0 pthread_create(&t326, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t326, ((void *)0), P1, ((void *)0))=-2, t325={5:0}, t326={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L875] 0 pthread_t t327; [L876] FCALL, FORK 0 pthread_create(&t327, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t327, ((void *)0), P2, ((void *)0))=-1, t325={5:0}, t326={6:0}, t327={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L877] 0 pthread_t t328; [L878] FCALL, FORK 0 pthread_create(&t328, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t328, ((void *)0), P3, ((void *)0))=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L846] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L756] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L759] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L771] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L774] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L777] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L789] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L764] EXPR 1 __unbuffered_cnt + 1 [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L782] EXPR 2 __unbuffered_cnt + 1 [L782] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 2 return 0; [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EAX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L856] EXPR 4 __unbuffered_cnt + 1 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L810] EXPR 3 __unbuffered_cnt + 1 [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t325={5:0}, t326={6:0}, t327={7:0}, t328={3:0}, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix013.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={50:49}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 764]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 764]: 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: 782]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 810]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 872]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 185 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 764 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 764 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1648 IncrementalHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 31 mSDtfsCounter, 1648 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=523occurred in iteration=11, InterpolantAutomatonStates: 86, 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.3s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 347 NumberOfCodeBlocks, 347 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 303 ConstructedInterpolants, 0 QuantifiedInterpolants, 1927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:02:19,317 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...