/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked INSUFFICIENT_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix040.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:46:32,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:46:32,136 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 03:46:32,141 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:46:32,141 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:46:32,170 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:46:32,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:46:32,175 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:46:32,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:46:32,179 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:46:32,180 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:46:32,180 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:46:32,180 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:46:32,181 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:46:32,181 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:46:32,182 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:46:32,182 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:46:32,182 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:46:32,182 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:46:32,183 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:46:32,183 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:46:32,184 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:46:32,184 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:46:32,184 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:46:32,185 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:46:32,185 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:46:32,185 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:46:32,185 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:46:32,185 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:46:32,186 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:46:32,187 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:46:32,187 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:46:32,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:46:32,187 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:46:32,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:46:32,188 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> INSUFFICIENT_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 03:46:32,454 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:46:32,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:46:32,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:46:32,476 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:46:32,477 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:46:32,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-08-27 03:46:33,629 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:46:33,865 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:46:33,866 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix040.opt.i [2023-08-27 03:46:33,890 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e1bb634/97b6fae4a35d419084353fccec8694f8/FLAG633f00a68 [2023-08-27 03:46:33,903 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a9e1bb634/97b6fae4a35d419084353fccec8694f8 [2023-08-27 03:46:33,907 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:46:33,908 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:46:33,910 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:46:33,911 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:46:33,913 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:46:33,914 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:46:33" (1/1) ... [2023-08-27 03:46:33,915 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@505da690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:33, skipping insertion in model container [2023-08-27 03:46:33,915 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:46:33" (1/1) ... [2023-08-27 03:46:33,958 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:46:34,313 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:46:34,324 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:46:34,348 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:46:34,349 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:46:34,373 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:46:34,404 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:46:34,404 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:46:34,410 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:46:34,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34 WrapperNode [2023-08-27 03:46:34,411 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:46:34,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:46:34,412 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:46:34,412 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:46:34,417 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,431 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,453 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 159 [2023-08-27 03:46:34,454 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:46:34,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:46:34,455 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:46:34,455 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:46:34,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,465 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,466 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,473 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,474 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,477 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,481 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:46:34,481 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:46:34,481 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:46:34,481 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:46:34,482 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (1/1) ... [2023-08-27 03:46:34,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:46:34,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:46:34,514 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 03:46:34,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 03:46:34,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:46:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:46:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:46:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:46:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:46:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:46:34,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:46:34,547 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:46:34,547 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:46:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 03:46:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 03:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:46:34,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:46:34,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:46:34,550 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 03:46:34,729 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:46:34,732 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:46:35,080 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:46:35,203 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:46:35,203 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:46:35,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:46:35 BoogieIcfgContainer [2023-08-27 03:46:35,206 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:46:35,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:46:35,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:46:35,210 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:46:35,210 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:46:33" (1/3) ... [2023-08-27 03:46:35,211 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eab0b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:46:35, skipping insertion in model container [2023-08-27 03:46:35,211 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:34" (2/3) ... [2023-08-27 03:46:35,212 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2eab0b3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:46:35, skipping insertion in model container [2023-08-27 03:46:35,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:46:35" (3/3) ... [2023-08-27 03:46:35,213 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2023-08-27 03:46:35,227 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:46:35,227 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 03:46:35,228 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:46:35,288 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:46:35,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 141 transitions, 302 flow [2023-08-27 03:46:35,409 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-27 03:46:35,409 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:35,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-27 03:46:35,417 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 141 transitions, 302 flow [2023-08-27 03:46:35,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 137 transitions, 286 flow [2023-08-27 03:46:35,426 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:46:35,434 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-27 03:46:35,436 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 137 transitions, 286 flow [2023-08-27 03:46:35,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 137 transitions, 286 flow [2023-08-27 03:46:35,460 INFO L124 PetriNetUnfolderBase]: 3/137 cut-off events. [2023-08-27 03:46:35,460 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:35,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 137 events. 3/137 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 107 event pairs, 0 based on Foata normal form. 0/124 useless extension candidates. Maximal degree in co-relation 98. Up to 2 conditions per place. [2023-08-27 03:46:35,463 INFO L119 LiptonReduction]: Number of co-enabled transitions 4152 [2023-08-27 03:46:39,482 INFO L134 LiptonReduction]: Checked pairs total: 14574 [2023-08-27 03:46:39,482 INFO L136 LiptonReduction]: Total number of compositions: 119 [2023-08-27 03:46:39,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:46:39,498 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;@354998ca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:46:39,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 03:46:39,501 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:46:39,501 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-27 03:46:39,502 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:39,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:39,502 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-27 03:46:39,502 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 03:46:39,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:39,506 INFO L85 PathProgramCache]: Analyzing trace with hash 573762026, now seen corresponding path program 1 times [2023-08-27 03:46:39,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:39,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311703489] [2023-08-27 03:46:39,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:39,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:39,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:39,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:39,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311703489] [2023-08-27 03:46:39,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311703489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:39,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:39,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:39,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192392300] [2023-08-27 03:46:39,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:39,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:39,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:39,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:39,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:39,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 260 [2023-08-27 03:46:39,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:39,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:39,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 260 [2023-08-27 03:46:39,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:41,310 INFO L124 PetriNetUnfolderBase]: 13449/18598 cut-off events. [2023-08-27 03:46:41,310 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2023-08-27 03:46:41,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37348 conditions, 18598 events. 13449/18598 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 1036. Compared 111094 event pairs, 3571 based on Foata normal form. 700/12173 useless extension candidates. Maximal degree in co-relation 37336. Up to 17063 conditions per place. [2023-08-27 03:46:41,437 INFO L140 encePairwiseOnDemand]: 246/260 looper letters, 53 selfloop transitions, 5 changer transitions 0/61 dead transitions. [2023-08-27 03:46:41,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 259 flow [2023-08-27 03:46:41,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:41,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 410 transitions. [2023-08-27 03:46:41,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2023-08-27 03:46:41,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 410 transitions. [2023-08-27 03:46:41,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 410 transitions. [2023-08-27 03:46:41,451 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:41,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 410 transitions. [2023-08-27 03:46:41,455 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.66666666666666) internal successors, (410), 3 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:41,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:41,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:41,461 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 88 flow. Second operand 3 states and 410 transitions. [2023-08-27 03:46:41,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 259 flow [2023-08-27 03:46:41,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 61 transitions, 252 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 03:46:41,466 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 129 flow [2023-08-27 03:46:41,468 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-08-27 03:46:41,471 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-27 03:46:41,471 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 129 flow [2023-08-27 03:46:41,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:41,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:41,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:41,472 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:46:41,472 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 03:46:41,472 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:41,472 INFO L85 PathProgramCache]: Analyzing trace with hash 305578409, now seen corresponding path program 1 times [2023-08-27 03:46:41,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:41,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319143257] [2023-08-27 03:46:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:41,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:41,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:41,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:41,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319143257] [2023-08-27 03:46:41,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319143257] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:41,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:41,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:41,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87995086] [2023-08-27 03:46:41,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:41,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:41,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:41,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:41,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:41,869 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 260 [2023-08-27 03:46:41,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:41,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:41,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 260 [2023-08-27 03:46:41,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:42,958 INFO L124 PetriNetUnfolderBase]: 9183/13659 cut-off events. [2023-08-27 03:46:42,958 INFO L125 PetriNetUnfolderBase]: For 1694/2371 co-relation queries the response was YES. [2023-08-27 03:46:42,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33019 conditions, 13659 events. 9183/13659 cut-off events. For 1694/2371 co-relation queries the response was YES. Maximal size of possible extension queue 1019. Compared 94342 event pairs, 2025 based on Foata normal form. 0/9910 useless extension candidates. Maximal degree in co-relation 33008. Up to 9942 conditions per place. [2023-08-27 03:46:43,039 INFO L140 encePairwiseOnDemand]: 257/260 looper letters, 50 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-08-27 03:46:43,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 59 transitions, 290 flow [2023-08-27 03:46:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2023-08-27 03:46:43,042 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5166666666666667 [2023-08-27 03:46:43,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2023-08-27 03:46:43,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2023-08-27 03:46:43,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:43,043 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2023-08-27 03:46:43,044 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,047 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 260.0) internal successors, (1040), 4 states have internal predecessors, (1040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,047 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 129 flow. Second operand 3 states and 403 transitions. [2023-08-27 03:46:43,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 59 transitions, 290 flow [2023-08-27 03:46:43,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 59 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:43,049 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 126 flow [2023-08-27 03:46:43,050 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-08-27 03:46:43,050 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -1 predicate places. [2023-08-27 03:46:43,050 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 126 flow [2023-08-27 03:46:43,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,051 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:43,051 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:43,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:46:43,052 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 03:46:43,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash -32905685, now seen corresponding path program 1 times [2023-08-27 03:46:43,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:43,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72630284] [2023-08-27 03:46:43,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:43,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:43,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72630284] [2023-08-27 03:46:43,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72630284] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:43,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:43,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:43,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232851135] [2023-08-27 03:46:43,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:43,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:43,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:43,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:43,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:43,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 260 [2023-08-27 03:46:43,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:43,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:43,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 260 [2023-08-27 03:46:43,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:43,985 INFO L124 PetriNetUnfolderBase]: 6741/9370 cut-off events. [2023-08-27 03:46:43,985 INFO L125 PetriNetUnfolderBase]: For 898/898 co-relation queries the response was YES. [2023-08-27 03:46:43,998 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22912 conditions, 9370 events. 6741/9370 cut-off events. For 898/898 co-relation queries the response was YES. Maximal size of possible extension queue 500. Compared 50295 event pairs, 1578 based on Foata normal form. 0/7104 useless extension candidates. Maximal degree in co-relation 22900. Up to 8130 conditions per place. [2023-08-27 03:46:44,027 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 47 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2023-08-27 03:46:44,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 260 flow [2023-08-27 03:46:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:44,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:44,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 512 transitions. [2023-08-27 03:46:44,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2023-08-27 03:46:44,029 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 512 transitions. [2023-08-27 03:46:44,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 512 transitions. [2023-08-27 03:46:44,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:44,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 512 transitions. [2023-08-27 03:46:44,031 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 03:46:44,033 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:44,034 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:44,034 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 126 flow. Second operand 4 states and 512 transitions. [2023-08-27 03:46:44,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 260 flow [2023-08-27 03:46:44,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:44,038 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 116 flow [2023-08-27 03:46:44,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-27 03:46:44,039 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2023-08-27 03:46:44,039 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 116 flow [2023-08-27 03:46:44,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:44,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:44,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:44,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:46:44,040 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 03:46:44,040 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:44,040 INFO L85 PathProgramCache]: Analyzing trace with hash 969130256, now seen corresponding path program 1 times [2023-08-27 03:46:44,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:44,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820527636] [2023-08-27 03:46:44,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:44,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:44,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:44,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:44,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820527636] [2023-08-27 03:46:44,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820527636] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:44,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:44,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605469748] [2023-08-27 03:46:44,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:44,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:44,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:44,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:44,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:44,079 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 260 [2023-08-27 03:46:44,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:44,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:44,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 260 [2023-08-27 03:46:44,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:44,552 INFO L124 PetriNetUnfolderBase]: 4169/5885 cut-off events. [2023-08-27 03:46:44,552 INFO L125 PetriNetUnfolderBase]: For 1610/1610 co-relation queries the response was YES. [2023-08-27 03:46:44,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14322 conditions, 5885 events. 4169/5885 cut-off events. For 1610/1610 co-relation queries the response was YES. Maximal size of possible extension queue 280. Compared 29290 event pairs, 892 based on Foata normal form. 0/5075 useless extension candidates. Maximal degree in co-relation 14310. Up to 2554 conditions per place. [2023-08-27 03:46:44,578 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 64 selfloop transitions, 9 changer transitions 0/76 dead transitions. [2023-08-27 03:46:44,578 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 76 transitions, 360 flow [2023-08-27 03:46:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:44,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:44,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 533 transitions. [2023-08-27 03:46:44,580 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5125 [2023-08-27 03:46:44,580 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 533 transitions. [2023-08-27 03:46:44,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 533 transitions. [2023-08-27 03:46:44,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:44,581 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 533 transitions. [2023-08-27 03:46:44,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:44,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:44,585 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 260.0) internal successors, (1300), 5 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:44,585 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 116 flow. Second operand 4 states and 533 transitions. [2023-08-27 03:46:44,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 76 transitions, 360 flow [2023-08-27 03:46:44,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 76 transitions, 354 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:44,588 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 168 flow [2023-08-27 03:46:44,588 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=168, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-08-27 03:46:44,588 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, -2 predicate places. [2023-08-27 03:46:44,589 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 168 flow [2023-08-27 03:46:44,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:44,589 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:44,589 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:44,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:46:44,589 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 03:46:44,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1841753522, now seen corresponding path program 1 times [2023-08-27 03:46:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:44,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061609500] [2023-08-27 03:46:44,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:44,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:44,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:44,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:44,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:44,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061609500] [2023-08-27 03:46:44,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061609500] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:44,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:44,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876746726] [2023-08-27 03:46:44,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:44,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:44,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:44,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:44,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:44,757 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 260 [2023-08-27 03:46:44,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 168 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:44,762 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:44,762 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 260 [2023-08-27 03:46:44,762 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:46,445 INFO L124 PetriNetUnfolderBase]: 18343/25384 cut-off events. [2023-08-27 03:46:46,446 INFO L125 PetriNetUnfolderBase]: For 19401/19401 co-relation queries the response was YES. [2023-08-27 03:46:46,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 70843 conditions, 25384 events. 18343/25384 cut-off events. For 19401/19401 co-relation queries the response was YES. Maximal size of possible extension queue 863. Compared 142835 event pairs, 5117 based on Foata normal form. 0/22824 useless extension candidates. Maximal degree in co-relation 70830. Up to 12054 conditions per place. [2023-08-27 03:46:46,572 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 114 selfloop transitions, 16 changer transitions 0/130 dead transitions. [2023-08-27 03:46:46,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 130 transitions, 840 flow [2023-08-27 03:46:46,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:46,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:46,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2023-08-27 03:46:46,575 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4846153846153846 [2023-08-27 03:46:46,575 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2023-08-27 03:46:46,575 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2023-08-27 03:46:46,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:46,576 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2023-08-27 03:46:46,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,580 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,581 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,581 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 168 flow. Second operand 5 states and 630 transitions. [2023-08-27 03:46:46,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 130 transitions, 840 flow [2023-08-27 03:46:46,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 130 transitions, 774 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:46,593 INFO L231 Difference]: Finished difference. Result has 54 places, 55 transitions, 278 flow [2023-08-27 03:46:46,593 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=278, PETRI_PLACES=54, PETRI_TRANSITIONS=55} [2023-08-27 03:46:46,593 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 4 predicate places. [2023-08-27 03:46:46,594 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 55 transitions, 278 flow [2023-08-27 03:46:46,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:46,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:46,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:46:46,595 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 03:46:46,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:46,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1259833729, now seen corresponding path program 1 times [2023-08-27 03:46:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:46,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752161353] [2023-08-27 03:46:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:46,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:46,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:46,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:46,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:46,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752161353] [2023-08-27 03:46:46,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752161353] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:46,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:46,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:46,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181416532] [2023-08-27 03:46:46,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:46,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:46,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:46,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:46,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:46,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 260 [2023-08-27 03:46:46,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 55 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:46,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:46,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 260 [2023-08-27 03:46:46,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:48,608 INFO L124 PetriNetUnfolderBase]: 19999/27864 cut-off events. [2023-08-27 03:46:48,608 INFO L125 PetriNetUnfolderBase]: For 33017/33017 co-relation queries the response was YES. [2023-08-27 03:46:48,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94919 conditions, 27864 events. 19999/27864 cut-off events. For 33017/33017 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 158427 event pairs, 2862 based on Foata normal form. 724/26580 useless extension candidates. Maximal degree in co-relation 94902. Up to 8615 conditions per place. [2023-08-27 03:46:48,738 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 161 selfloop transitions, 27 changer transitions 0/188 dead transitions. [2023-08-27 03:46:48,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 188 transitions, 1356 flow [2023-08-27 03:46:48,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:46:48,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:46:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 864 transitions. [2023-08-27 03:46:48,740 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4747252747252747 [2023-08-27 03:46:48,740 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 864 transitions. [2023-08-27 03:46:48,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 864 transitions. [2023-08-27 03:46:48,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:48,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 864 transitions. [2023-08-27 03:46:48,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.42857142857143) internal successors, (864), 7 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:48,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:48,745 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:48,746 INFO L175 Difference]: Start difference. First operand has 54 places, 55 transitions, 278 flow. Second operand 7 states and 864 transitions. [2023-08-27 03:46:48,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 188 transitions, 1356 flow [2023-08-27 03:46:48,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 188 transitions, 1356 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:46:48,762 INFO L231 Difference]: Finished difference. Result has 66 places, 75 transitions, 542 flow [2023-08-27 03:46:48,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=542, PETRI_PLACES=66, PETRI_TRANSITIONS=75} [2023-08-27 03:46:48,763 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 16 predicate places. [2023-08-27 03:46:48,763 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 75 transitions, 542 flow [2023-08-27 03:46:48,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.6) internal successors, (543), 5 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:48,763 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:48,763 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:48,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:46:48,764 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 03:46:48,764 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:48,764 INFO L85 PathProgramCache]: Analyzing trace with hash -421004590, now seen corresponding path program 1 times [2023-08-27 03:46:48,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:48,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242382489] [2023-08-27 03:46:48,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:48,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:48,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:48,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242382489] [2023-08-27 03:46:48,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242382489] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:48,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:48,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:48,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939774327] [2023-08-27 03:46:48,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:48,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:48,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:48,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:48,946 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 260 [2023-08-27 03:46:48,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 75 transitions, 542 flow. Second operand has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:48,947 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:48,947 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 260 [2023-08-27 03:46:48,947 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:51,644 INFO L124 PetriNetUnfolderBase]: 23939/33652 cut-off events. [2023-08-27 03:46:51,644 INFO L125 PetriNetUnfolderBase]: For 80033/80033 co-relation queries the response was YES. [2023-08-27 03:46:51,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129829 conditions, 33652 events. 23939/33652 cut-off events. For 80033/80033 co-relation queries the response was YES. Maximal size of possible extension queue 1206. Compared 202907 event pairs, 3366 based on Foata normal form. 532/31760 useless extension candidates. Maximal degree in co-relation 129804. Up to 11944 conditions per place. [2023-08-27 03:46:51,808 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 163 selfloop transitions, 71 changer transitions 0/234 dead transitions. [2023-08-27 03:46:51,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 234 transitions, 2042 flow [2023-08-27 03:46:51,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:46:51,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:46:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 872 transitions. [2023-08-27 03:46:51,811 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47912087912087914 [2023-08-27 03:46:51,811 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 872 transitions. [2023-08-27 03:46:51,811 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 872 transitions. [2023-08-27 03:46:51,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:51,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 872 transitions. [2023-08-27 03:46:51,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.57142857142857) internal successors, (872), 7 states have internal predecessors, (872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:51,816 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:51,816 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:51,816 INFO L175 Difference]: Start difference. First operand has 66 places, 75 transitions, 542 flow. Second operand 7 states and 872 transitions. [2023-08-27 03:46:51,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 234 transitions, 2042 flow [2023-08-27 03:46:52,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 234 transitions, 2042 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:46:52,004 INFO L231 Difference]: Finished difference. Result has 78 places, 127 transitions, 1372 flow [2023-08-27 03:46:52,004 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=542, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1372, PETRI_PLACES=78, PETRI_TRANSITIONS=127} [2023-08-27 03:46:52,005 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 28 predicate places. [2023-08-27 03:46:52,005 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 127 transitions, 1372 flow [2023-08-27 03:46:52,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.8) internal successors, (544), 5 states have internal predecessors, (544), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:52,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:52,005 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:52,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:46:52,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:46:52,006 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:52,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1277371682, now seen corresponding path program 1 times [2023-08-27 03:46:52,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:52,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133610221] [2023-08-27 03:46:52,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:52,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:52,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:52,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:52,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133610221] [2023-08-27 03:46:52,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133610221] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:52,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:52,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:52,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263005400] [2023-08-27 03:46:52,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:52,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:52,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:52,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:52,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:52,081 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 260 [2023-08-27 03:46:52,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 127 transitions, 1372 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:52,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:52,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 260 [2023-08-27 03:46:52,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:54,360 INFO L124 PetriNetUnfolderBase]: 16393/23530 cut-off events. [2023-08-27 03:46:54,360 INFO L125 PetriNetUnfolderBase]: For 103289/106322 co-relation queries the response was YES. [2023-08-27 03:46:54,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 98402 conditions, 23530 events. 16393/23530 cut-off events. For 103289/106322 co-relation queries the response was YES. Maximal size of possible extension queue 1337. Compared 155306 event pairs, 2095 based on Foata normal form. 1356/23367 useless extension candidates. Maximal degree in co-relation 98369. Up to 9318 conditions per place. [2023-08-27 03:46:54,495 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 237 selfloop transitions, 13 changer transitions 0/291 dead transitions. [2023-08-27 03:46:54,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 291 transitions, 3594 flow [2023-08-27 03:46:54,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:54,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:54,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 666 transitions. [2023-08-27 03:46:54,498 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5123076923076924 [2023-08-27 03:46:54,498 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 666 transitions. [2023-08-27 03:46:54,498 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 666 transitions. [2023-08-27 03:46:54,498 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:54,498 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 666 transitions. [2023-08-27 03:46:54,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.2) internal successors, (666), 5 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:54,501 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:54,502 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:54,502 INFO L175 Difference]: Start difference. First operand has 78 places, 127 transitions, 1372 flow. Second operand 5 states and 666 transitions. [2023-08-27 03:46:54,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 291 transitions, 3594 flow [2023-08-27 03:46:54,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 291 transitions, 3594 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:46:54,668 INFO L231 Difference]: Finished difference. Result has 83 places, 131 transitions, 1446 flow [2023-08-27 03:46:54,668 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1372, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1446, PETRI_PLACES=83, PETRI_TRANSITIONS=131} [2023-08-27 03:46:54,668 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2023-08-27 03:46:54,669 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 131 transitions, 1446 flow [2023-08-27 03:46:54,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:54,669 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:54,669 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:54,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:46:54,669 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 03:46:54,670 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1147755895, now seen corresponding path program 1 times [2023-08-27 03:46:54,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:54,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530232416] [2023-08-27 03:46:54,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:54,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:54,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:54,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530232416] [2023-08-27 03:46:54,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530232416] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:54,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:54,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:54,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765719241] [2023-08-27 03:46:54,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:54,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:54,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:54,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:54,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:54,825 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 260 [2023-08-27 03:46:54,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 131 transitions, 1446 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:54,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:54,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 260 [2023-08-27 03:46:54,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:58,471 INFO L124 PetriNetUnfolderBase]: 26503/36976 cut-off events. [2023-08-27 03:46:58,472 INFO L125 PetriNetUnfolderBase]: For 185589/185589 co-relation queries the response was YES. [2023-08-27 03:46:58,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173796 conditions, 36976 events. 26503/36976 cut-off events. For 185589/185589 co-relation queries the response was YES. Maximal size of possible extension queue 1469. Compared 224419 event pairs, 3818 based on Foata normal form. 334/36482 useless extension candidates. Maximal degree in co-relation 173760. Up to 13459 conditions per place. [2023-08-27 03:46:58,683 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 168 selfloop transitions, 125 changer transitions 8/301 dead transitions. [2023-08-27 03:46:58,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 301 transitions, 3464 flow [2023-08-27 03:46:58,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:46:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:46:58,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 876 transitions. [2023-08-27 03:46:58,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48131868131868133 [2023-08-27 03:46:58,685 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 876 transitions. [2023-08-27 03:46:58,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 876 transitions. [2023-08-27 03:46:58,686 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:58,686 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 876 transitions. [2023-08-27 03:46:58,687 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.14285714285714) internal successors, (876), 7 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:58,690 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:58,690 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:58,690 INFO L175 Difference]: Start difference. First operand has 83 places, 131 transitions, 1446 flow. Second operand 7 states and 876 transitions. [2023-08-27 03:46:58,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 301 transitions, 3464 flow [2023-08-27 03:47:00,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 301 transitions, 3322 flow, removed 32 selfloop flow, removed 3 redundant places. [2023-08-27 03:47:00,443 INFO L231 Difference]: Finished difference. Result has 91 places, 180 transitions, 2510 flow [2023-08-27 03:47:00,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1412, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2510, PETRI_PLACES=91, PETRI_TRANSITIONS=180} [2023-08-27 03:47:00,444 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2023-08-27 03:47:00,444 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 180 transitions, 2510 flow [2023-08-27 03:47:00,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:00,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:00,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:00,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:47:00,445 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 03:47:00,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:00,445 INFO L85 PathProgramCache]: Analyzing trace with hash -898189637, now seen corresponding path program 1 times [2023-08-27 03:47:00,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:00,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438137056] [2023-08-27 03:47:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:00,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:00,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:00,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438137056] [2023-08-27 03:47:00,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438137056] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:00,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:00,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:47:00,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382445609] [2023-08-27 03:47:00,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:00,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:00,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:00,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:00,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:00,577 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 260 [2023-08-27 03:47:00,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 180 transitions, 2510 flow. Second operand has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:00,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:00,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 260 [2023-08-27 03:47:00,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:05,768 INFO L124 PetriNetUnfolderBase]: 31546/46333 cut-off events. [2023-08-27 03:47:05,768 INFO L125 PetriNetUnfolderBase]: For 269873/271596 co-relation queries the response was YES. [2023-08-27 03:47:05,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212515 conditions, 46333 events. 31546/46333 cut-off events. For 269873/271596 co-relation queries the response was YES. Maximal size of possible extension queue 2379. Compared 333083 event pairs, 9447 based on Foata normal form. 1135/45728 useless extension candidates. Maximal degree in co-relation 212474. Up to 19929 conditions per place. [2023-08-27 03:47:06,086 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 208 selfloop transitions, 40 changer transitions 8/301 dead transitions. [2023-08-27 03:47:06,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 301 transitions, 4111 flow [2023-08-27 03:47:06,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-27 03:47:06,089 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5038461538461538 [2023-08-27 03:47:06,089 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-27 03:47:06,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-27 03:47:06,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:06,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-27 03:47:06,091 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:06,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:06,093 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:06,093 INFO L175 Difference]: Start difference. First operand has 91 places, 180 transitions, 2510 flow. Second operand 5 states and 655 transitions. [2023-08-27 03:47:06,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 301 transitions, 4111 flow [2023-08-27 03:47:09,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 301 transitions, 3998 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:09,730 INFO L231 Difference]: Finished difference. Result has 97 places, 188 transitions, 2673 flow [2023-08-27 03:47:09,731 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=2415, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2673, PETRI_PLACES=97, PETRI_TRANSITIONS=188} [2023-08-27 03:47:09,731 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 47 predicate places. [2023-08-27 03:47:09,731 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 188 transitions, 2673 flow [2023-08-27 03:47:09,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 118.0) internal successors, (472), 4 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:09,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:09,732 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:09,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:47:09,732 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 03:47:09,732 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:09,732 INFO L85 PathProgramCache]: Analyzing trace with hash 506261748, now seen corresponding path program 1 times [2023-08-27 03:47:09,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:09,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982922337] [2023-08-27 03:47:09,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:09,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:09,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982922337] [2023-08-27 03:47:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982922337] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:09,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:47:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122021734] [2023-08-27 03:47:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:09,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:47:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:09,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:47:09,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:47:09,861 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-27 03:47:09,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 188 transitions, 2673 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:09,862 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:09,862 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-27 03:47:09,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:12,676 INFO L124 PetriNetUnfolderBase]: 15650/24244 cut-off events. [2023-08-27 03:47:12,676 INFO L125 PetriNetUnfolderBase]: For 154311/158045 co-relation queries the response was YES. [2023-08-27 03:47:12,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107876 conditions, 24244 events. 15650/24244 cut-off events. For 154311/158045 co-relation queries the response was YES. Maximal size of possible extension queue 1302. Compared 180130 event pairs, 3841 based on Foata normal form. 2134/24624 useless extension candidates. Maximal degree in co-relation 107832. Up to 17655 conditions per place. [2023-08-27 03:47:12,803 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 189 selfloop transitions, 12 changer transitions 4/261 dead transitions. [2023-08-27 03:47:12,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 261 transitions, 3729 flow [2023-08-27 03:47:12,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:12,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:12,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 626 transitions. [2023-08-27 03:47:12,804 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4815384615384615 [2023-08-27 03:47:12,804 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 626 transitions. [2023-08-27 03:47:12,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 626 transitions. [2023-08-27 03:47:12,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:12,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 626 transitions. [2023-08-27 03:47:12,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 125.2) internal successors, (626), 5 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:12,808 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:12,808 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:12,808 INFO L175 Difference]: Start difference. First operand has 97 places, 188 transitions, 2673 flow. Second operand 5 states and 626 transitions. [2023-08-27 03:47:12,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 261 transitions, 3729 flow [2023-08-27 03:47:13,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 261 transitions, 3670 flow, removed 9 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:13,740 INFO L231 Difference]: Finished difference. Result has 103 places, 173 transitions, 2385 flow [2023-08-27 03:47:13,740 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=2305, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2385, PETRI_PLACES=103, PETRI_TRANSITIONS=173} [2023-08-27 03:47:13,740 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 53 predicate places. [2023-08-27 03:47:13,740 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 173 transitions, 2385 flow [2023-08-27 03:47:13,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,741 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:13,741 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:13,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:47:13,741 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:13,741 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:13,741 INFO L85 PathProgramCache]: Analyzing trace with hash 151325491, now seen corresponding path program 1 times [2023-08-27 03:47:13,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:13,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697180729] [2023-08-27 03:47:13,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:13,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:13,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:13,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:13,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:13,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697180729] [2023-08-27 03:47:13,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697180729] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:13,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:13,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:13,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787794034] [2023-08-27 03:47:13,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:13,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:13,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:13,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:13,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:13,913 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 260 [2023-08-27 03:47:13,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 173 transitions, 2385 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:13,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:13,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 260 [2023-08-27 03:47:13,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:18,959 INFO L124 PetriNetUnfolderBase]: 29118/44263 cut-off events. [2023-08-27 03:47:18,959 INFO L125 PetriNetUnfolderBase]: For 294660/294660 co-relation queries the response was YES. [2023-08-27 03:47:19,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207637 conditions, 44263 events. 29118/44263 cut-off events. For 294660/294660 co-relation queries the response was YES. Maximal size of possible extension queue 1907. Compared 327332 event pairs, 6758 based on Foata normal form. 248/43450 useless extension candidates. Maximal degree in co-relation 207589. Up to 13731 conditions per place. [2023-08-27 03:47:19,253 INFO L140 encePairwiseOnDemand]: 250/260 looper letters, 269 selfloop transitions, 122 changer transitions 12/403 dead transitions. [2023-08-27 03:47:19,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 403 transitions, 5486 flow [2023-08-27 03:47:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:47:19,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:47:19,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 884 transitions. [2023-08-27 03:47:19,255 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-27 03:47:19,255 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 884 transitions. [2023-08-27 03:47:19,255 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 884 transitions. [2023-08-27 03:47:19,256 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:19,256 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 884 transitions. [2023-08-27 03:47:19,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 126.28571428571429) internal successors, (884), 7 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:19,260 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:19,260 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:19,261 INFO L175 Difference]: Start difference. First operand has 103 places, 173 transitions, 2385 flow. Second operand 7 states and 884 transitions. [2023-08-27 03:47:19,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 403 transitions, 5486 flow [2023-08-27 03:47:21,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 403 transitions, 5461 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:21,543 INFO L231 Difference]: Finished difference. Result has 114 places, 234 transitions, 4019 flow [2023-08-27 03:47:21,544 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=2376, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4019, PETRI_PLACES=114, PETRI_TRANSITIONS=234} [2023-08-27 03:47:21,544 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 64 predicate places. [2023-08-27 03:47:21,544 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 234 transitions, 4019 flow [2023-08-27 03:47:21,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:21,545 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:21,545 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:21,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:47:21,545 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 03:47:21,545 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:21,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1867052855, now seen corresponding path program 1 times [2023-08-27 03:47:21,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:21,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994565441] [2023-08-27 03:47:21,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:21,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:21,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 03:47:21,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994565441] [2023-08-27 03:47:21,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994565441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:21,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:21,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:21,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905609879] [2023-08-27 03:47:21,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:21,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:21,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:21,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:21,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:21,682 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-27 03:47:21,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 234 transitions, 4019 flow. Second operand has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:21,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:21,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-27 03:47:21,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:24,252 INFO L124 PetriNetUnfolderBase]: 11767/18955 cut-off events. [2023-08-27 03:47:24,252 INFO L125 PetriNetUnfolderBase]: For 152634/156728 co-relation queries the response was YES. [2023-08-27 03:47:24,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91307 conditions, 18955 events. 11767/18955 cut-off events. For 152634/156728 co-relation queries the response was YES. Maximal size of possible extension queue 988. Compared 143407 event pairs, 1619 based on Foata normal form. 2221/19951 useless extension candidates. Maximal degree in co-relation 91252. Up to 8131 conditions per place. [2023-08-27 03:47:24,362 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 248 selfloop transitions, 22 changer transitions 4/324 dead transitions. [2023-08-27 03:47:24,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 324 transitions, 5315 flow [2023-08-27 03:47:24,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:47:24,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:47:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 874 transitions. [2023-08-27 03:47:24,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48021978021978023 [2023-08-27 03:47:24,367 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 874 transitions. [2023-08-27 03:47:24,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 874 transitions. [2023-08-27 03:47:24,367 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:24,367 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 874 transitions. [2023-08-27 03:47:24,368 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.85714285714286) internal successors, (874), 7 states have internal predecessors, (874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:24,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:24,370 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 260.0) internal successors, (2080), 8 states have internal predecessors, (2080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:24,370 INFO L175 Difference]: Start difference. First operand has 114 places, 234 transitions, 4019 flow. Second operand 7 states and 874 transitions. [2023-08-27 03:47:24,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 324 transitions, 5315 flow [2023-08-27 03:47:24,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 324 transitions, 5115 flow, removed 21 selfloop flow, removed 1 redundant places. [2023-08-27 03:47:24,973 INFO L231 Difference]: Finished difference. Result has 122 places, 175 transitions, 2711 flow [2023-08-27 03:47:24,974 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=2603, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2711, PETRI_PLACES=122, PETRI_TRANSITIONS=175} [2023-08-27 03:47:24,974 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 72 predicate places. [2023-08-27 03:47:24,974 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 175 transitions, 2711 flow [2023-08-27 03:47:24,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 113.4) internal successors, (567), 5 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:24,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:24,975 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 03:47:24,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:47:24,975 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 03:47:24,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash -444103461, now seen corresponding path program 1 times [2023-08-27 03:47:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835614299] [2023-08-27 03:47:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:24,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:25,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:25,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:25,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835614299] [2023-08-27 03:47:25,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835614299] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:25,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:25,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:47:25,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243207230] [2023-08-27 03:47:25,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:25,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:47:25,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:25,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:47:25,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:47:25,167 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-27 03:47:25,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 175 transitions, 2711 flow. Second operand has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:25,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:25,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-27 03:47:25,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:27,181 INFO L124 PetriNetUnfolderBase]: 8908/13813 cut-off events. [2023-08-27 03:47:27,182 INFO L125 PetriNetUnfolderBase]: For 109829/113960 co-relation queries the response was YES. [2023-08-27 03:47:27,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75518 conditions, 13813 events. 8908/13813 cut-off events. For 109829/113960 co-relation queries the response was YES. Maximal size of possible extension queue 929. Compared 95753 event pairs, 430 based on Foata normal form. 1801/14714 useless extension candidates. Maximal degree in co-relation 75459. Up to 3721 conditions per place. [2023-08-27 03:47:27,274 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 243 selfloop transitions, 32 changer transitions 4/306 dead transitions. [2023-08-27 03:47:27,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 306 transitions, 4607 flow [2023-08-27 03:47:27,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:47:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:47:27,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1120 transitions. [2023-08-27 03:47:27,277 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47863247863247865 [2023-08-27 03:47:27,277 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1120 transitions. [2023-08-27 03:47:27,277 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1120 transitions. [2023-08-27 03:47:27,278 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:27,278 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1120 transitions. [2023-08-27 03:47:27,280 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 124.44444444444444) internal successors, (1120), 9 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:27,283 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:27,283 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 260.0) internal successors, (2600), 10 states have internal predecessors, (2600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:27,283 INFO L175 Difference]: Start difference. First operand has 122 places, 175 transitions, 2711 flow. Second operand 9 states and 1120 transitions. [2023-08-27 03:47:27,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 306 transitions, 4607 flow [2023-08-27 03:47:28,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 306 transitions, 4439 flow, removed 21 selfloop flow, removed 11 redundant places. [2023-08-27 03:47:28,340 INFO L231 Difference]: Finished difference. Result has 120 places, 131 transitions, 1729 flow [2023-08-27 03:47:28,340 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1605, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1729, PETRI_PLACES=120, PETRI_TRANSITIONS=131} [2023-08-27 03:47:28,340 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 70 predicate places. [2023-08-27 03:47:28,341 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 131 transitions, 1729 flow [2023-08-27 03:47:28,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:28,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:28,341 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] [2023-08-27 03:47:28,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 03:47:28,341 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:28,342 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:28,342 INFO L85 PathProgramCache]: Analyzing trace with hash 949962562, now seen corresponding path program 1 times [2023-08-27 03:47:28,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:28,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222809678] [2023-08-27 03:47:28,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:28,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:28,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:28,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:28,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222809678] [2023-08-27 03:47:28,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222809678] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:28,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:28,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:28,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047356974] [2023-08-27 03:47:28,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:28,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:47:28,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:28,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:47:28,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:47:28,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 260 [2023-08-27 03:47:28,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 131 transitions, 1729 flow. Second operand has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:28,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:28,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 260 [2023-08-27 03:47:28,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:30,141 INFO L124 PetriNetUnfolderBase]: 8555/13219 cut-off events. [2023-08-27 03:47:30,142 INFO L125 PetriNetUnfolderBase]: For 108260/111264 co-relation queries the response was YES. [2023-08-27 03:47:30,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 77864 conditions, 13219 events. 8555/13219 cut-off events. For 108260/111264 co-relation queries the response was YES. Maximal size of possible extension queue 902. Compared 90803 event pairs, 830 based on Foata normal form. 1151/13890 useless extension candidates. Maximal degree in co-relation 77804. Up to 4455 conditions per place. [2023-08-27 03:47:30,198 INFO L140 encePairwiseOnDemand]: 251/260 looper letters, 106 selfloop transitions, 25 changer transitions 64/214 dead transitions. [2023-08-27 03:47:30,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 214 transitions, 3153 flow [2023-08-27 03:47:30,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 03:47:30,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 03:47:30,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 770 transitions. [2023-08-27 03:47:30,201 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4935897435897436 [2023-08-27 03:47:30,201 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 770 transitions. [2023-08-27 03:47:30,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 770 transitions. [2023-08-27 03:47:30,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:30,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 770 transitions. [2023-08-27 03:47:30,203 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 128.33333333333334) internal successors, (770), 6 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:30,205 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:30,205 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 260.0) internal successors, (1820), 7 states have internal predecessors, (1820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:30,205 INFO L175 Difference]: Start difference. First operand has 120 places, 131 transitions, 1729 flow. Second operand 6 states and 770 transitions. [2023-08-27 03:47:30,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 214 transitions, 3153 flow [2023-08-27 03:47:31,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 214 transitions, 3084 flow, removed 6 selfloop flow, removed 8 redundant places. [2023-08-27 03:47:31,980 INFO L231 Difference]: Finished difference. Result has 113 places, 86 transitions, 1074 flow [2023-08-27 03:47:31,980 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1074, PETRI_PLACES=113, PETRI_TRANSITIONS=86} [2023-08-27 03:47:31,980 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 63 predicate places. [2023-08-27 03:47:31,980 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 86 transitions, 1074 flow [2023-08-27 03:47:31,981 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.16666666666667) internal successors, (703), 6 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:31,981 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:31,981 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:31,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 03:47:31,981 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 03:47:31,981 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:31,982 INFO L85 PathProgramCache]: Analyzing trace with hash 340801053, now seen corresponding path program 1 times [2023-08-27 03:47:31,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:31,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282859497] [2023-08-27 03:47:31,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:31,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:32,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:32,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:32,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282859497] [2023-08-27 03:47:32,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282859497] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:32,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:32,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:47:32,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996754525] [2023-08-27 03:47:32,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:32,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:47:32,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:32,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:47:32,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:47:32,181 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 260 [2023-08-27 03:47:32,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 86 transitions, 1074 flow. Second operand has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:32,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:32,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 260 [2023-08-27 03:47:32,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:33,651 INFO L124 PetriNetUnfolderBase]: 6769/10475 cut-off events. [2023-08-27 03:47:33,651 INFO L125 PetriNetUnfolderBase]: For 87727/90763 co-relation queries the response was YES. [2023-08-27 03:47:33,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60171 conditions, 10475 events. 6769/10475 cut-off events. For 87727/90763 co-relation queries the response was YES. Maximal size of possible extension queue 870. Compared 72951 event pairs, 195 based on Foata normal form. 1128/11021 useless extension candidates. Maximal degree in co-relation 60115. Up to 3040 conditions per place. [2023-08-27 03:47:33,700 INFO L140 encePairwiseOnDemand]: 252/260 looper letters, 80 selfloop transitions, 27 changer transitions 120/234 dead transitions. [2023-08-27 03:47:33,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 234 transitions, 3279 flow [2023-08-27 03:47:33,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 03:47:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 03:47:33,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1327 transitions. [2023-08-27 03:47:33,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46398601398601397 [2023-08-27 03:47:33,703 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1327 transitions. [2023-08-27 03:47:33,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1327 transitions. [2023-08-27 03:47:33,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:33,703 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1327 transitions. [2023-08-27 03:47:33,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 120.63636363636364) internal successors, (1327), 11 states have internal predecessors, (1327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:33,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 260.0) internal successors, (3120), 12 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:33,710 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 260.0) internal successors, (3120), 12 states have internal predecessors, (3120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:33,710 INFO L175 Difference]: Start difference. First operand has 113 places, 86 transitions, 1074 flow. Second operand 11 states and 1327 transitions. [2023-08-27 03:47:33,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 234 transitions, 3279 flow [2023-08-27 03:47:35,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 234 transitions, 2901 flow, removed 100 selfloop flow, removed 24 redundant places. [2023-08-27 03:47:35,298 INFO L231 Difference]: Finished difference. Result has 91 places, 59 transitions, 549 flow [2023-08-27 03:47:35,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=549, PETRI_PLACES=91, PETRI_TRANSITIONS=59} [2023-08-27 03:47:35,299 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 41 predicate places. [2023-08-27 03:47:35,299 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 59 transitions, 549 flow [2023-08-27 03:47:35,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 113.0) internal successors, (791), 7 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:35,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:35,300 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 03:47:35,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 03:47:35,306 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 03:47:35,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:35,306 INFO L85 PathProgramCache]: Analyzing trace with hash 355029632, now seen corresponding path program 1 times [2023-08-27 03:47:35,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:35,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464246762] [2023-08-27 03:47:35,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:35,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:35,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:35,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464246762] [2023-08-27 03:47:35,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464246762] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:35,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:35,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 03:47:35,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841724935] [2023-08-27 03:47:35,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:35,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:47:35,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:35,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:47:35,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:47:35,729 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 260 [2023-08-27 03:47:35,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 59 transitions, 549 flow. Second operand has 7 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:35,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:35,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 260 [2023-08-27 03:47:35,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:36,224 INFO L124 PetriNetUnfolderBase]: 1814/2892 cut-off events. [2023-08-27 03:47:36,224 INFO L125 PetriNetUnfolderBase]: For 19776/19776 co-relation queries the response was YES. [2023-08-27 03:47:36,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16286 conditions, 2892 events. 1814/2892 cut-off events. For 19776/19776 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 15308 event pairs, 122 based on Foata normal form. 1/2820 useless extension candidates. Maximal degree in co-relation 16245. Up to 1126 conditions per place. [2023-08-27 03:47:36,234 INFO L140 encePairwiseOnDemand]: 247/260 looper letters, 78 selfloop transitions, 40 changer transitions 73/191 dead transitions. [2023-08-27 03:47:36,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 191 transitions, 2110 flow [2023-08-27 03:47:36,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-08-27 03:47:36,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-08-27 03:47:36,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1120 transitions. [2023-08-27 03:47:36,237 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4307692307692308 [2023-08-27 03:47:36,237 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1120 transitions. [2023-08-27 03:47:36,237 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1120 transitions. [2023-08-27 03:47:36,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:36,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1120 transitions. [2023-08-27 03:47:36,246 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 260.0) internal successors, (2860), 11 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,250 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 260.0) internal successors, (2860), 11 states have internal predecessors, (2860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,250 INFO L175 Difference]: Start difference. First operand has 91 places, 59 transitions, 549 flow. Second operand 10 states and 1120 transitions. [2023-08-27 03:47:36,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 191 transitions, 2110 flow [2023-08-27 03:47:36,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 191 transitions, 1668 flow, removed 34 selfloop flow, removed 21 redundant places. [2023-08-27 03:47:36,299 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 714 flow [2023-08-27 03:47:36,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=714, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2023-08-27 03:47:36,300 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2023-08-27 03:47:36,300 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 714 flow [2023-08-27 03:47:36,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 105.71428571428571) internal successors, (740), 7 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:36,300 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 03:47:36,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 03:47:36,300 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 03:47:36,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:36,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1036435106, now seen corresponding path program 2 times [2023-08-27 03:47:36,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:36,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967936824] [2023-08-27 03:47:36,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:36,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:36,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:36,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967936824] [2023-08-27 03:47:36,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967936824] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:36,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:36,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:47:36,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502741445] [2023-08-27 03:47:36,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:36,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:47:36,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:36,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:47:36,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:47:36,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 260 [2023-08-27 03:47:36,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 714 flow. Second operand has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:36,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 260 [2023-08-27 03:47:36,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:36,681 INFO L124 PetriNetUnfolderBase]: 577/998 cut-off events. [2023-08-27 03:47:36,681 INFO L125 PetriNetUnfolderBase]: For 3956/3990 co-relation queries the response was YES. [2023-08-27 03:47:36,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5017 conditions, 998 events. 577/998 cut-off events. For 3956/3990 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 4364 event pairs, 113 based on Foata normal form. 17/1013 useless extension candidates. Maximal degree in co-relation 4992. Up to 515 conditions per place. [2023-08-27 03:47:36,683 INFO L140 encePairwiseOnDemand]: 256/260 looper letters, 37 selfloop transitions, 1 changer transitions 72/112 dead transitions. [2023-08-27 03:47:36,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 112 transitions, 1157 flow [2023-08-27 03:47:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:47:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:47:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2023-08-27 03:47:36,685 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4707692307692308 [2023-08-27 03:47:36,685 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2023-08-27 03:47:36,685 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2023-08-27 03:47:36,685 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:36,685 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2023-08-27 03:47:36,686 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,688 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 260.0) internal successors, (1560), 6 states have internal predecessors, (1560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,688 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 714 flow. Second operand 5 states and 612 transitions. [2023-08-27 03:47:36,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 112 transitions, 1157 flow [2023-08-27 03:47:36,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 112 transitions, 1129 flow, removed 14 selfloop flow, removed 5 redundant places. [2023-08-27 03:47:36,698 INFO L231 Difference]: Finished difference. Result has 75 places, 38 transitions, 251 flow [2023-08-27 03:47:36,698 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=75, PETRI_TRANSITIONS=38} [2023-08-27 03:47:36,698 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 25 predicate places. [2023-08-27 03:47:36,698 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 38 transitions, 251 flow [2023-08-27 03:47:36,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:36,699 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:36,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 03:47:36,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 03:47:36,699 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 03:47:36,699 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1819599902, now seen corresponding path program 3 times [2023-08-27 03:47:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:36,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84435507] [2023-08-27 03:47:36,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:36,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:36,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:47:37,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:47:37,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:47:37,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84435507] [2023-08-27 03:47:37,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84435507] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:47:37,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:47:37,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:47:37,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472185904] [2023-08-27 03:47:37,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:47:37,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:47:37,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:47:37,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:47:37,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:47:37,329 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 260 [2023-08-27 03:47:37,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 38 transitions, 251 flow. Second operand has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:37,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:47:37,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 260 [2023-08-27 03:47:37,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:47:37,513 INFO L124 PetriNetUnfolderBase]: 108/220 cut-off events. [2023-08-27 03:47:37,514 INFO L125 PetriNetUnfolderBase]: For 976/981 co-relation queries the response was YES. [2023-08-27 03:47:37,514 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1079 conditions, 220 events. 108/220 cut-off events. For 976/981 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 756 event pairs, 14 based on Foata normal form. 2/220 useless extension candidates. Maximal degree in co-relation 1056. Up to 95 conditions per place. [2023-08-27 03:47:37,515 INFO L140 encePairwiseOnDemand]: 253/260 looper letters, 40 selfloop transitions, 4 changer transitions 23/70 dead transitions. [2023-08-27 03:47:37,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 70 transitions, 600 flow [2023-08-27 03:47:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-27 03:47:37,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-27 03:47:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 910 transitions. [2023-08-27 03:47:37,516 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4375 [2023-08-27 03:47:37,516 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 910 transitions. [2023-08-27 03:47:37,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 910 transitions. [2023-08-27 03:47:37,517 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:47:37,517 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 910 transitions. [2023-08-27 03:47:37,518 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.75) internal successors, (910), 8 states have internal predecessors, (910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:37,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:37,521 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 260.0) internal successors, (2340), 9 states have internal predecessors, (2340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:37,521 INFO L175 Difference]: Start difference. First operand has 75 places, 38 transitions, 251 flow. Second operand 8 states and 910 transitions. [2023-08-27 03:47:37,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 70 transitions, 600 flow [2023-08-27 03:47:37,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 70 transitions, 467 flow, removed 13 selfloop flow, removed 24 redundant places. [2023-08-27 03:47:37,524 INFO L231 Difference]: Finished difference. Result has 56 places, 38 transitions, 176 flow [2023-08-27 03:47:37,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=260, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=176, PETRI_PLACES=56, PETRI_TRANSITIONS=38} [2023-08-27 03:47:37,524 INFO L281 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2023-08-27 03:47:37,524 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 38 transitions, 176 flow [2023-08-27 03:47:37,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:47:37,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:47:37,525 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 03:47:37,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 03:47:37,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 03:47:37,525 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:47:37,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1864262288, now seen corresponding path program 4 times [2023-08-27 03:47:37,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:47:37,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956918720] [2023-08-27 03:47:37,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:47:37,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:47:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:37,569 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:47:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:47:37,641 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:47:37,641 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:47:37,642 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 03:47:37,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 23 remaining) [2023-08-27 03:47:37,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 03:47:37,644 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 03:47:37,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 03:47:37,645 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (15 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 03:47:37,646 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 03:47:37,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 03:47:37,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 03:47:37,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 03:47:37,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONASSERT (2 of 23 remaining) [2023-08-27 03:47:37,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 03:47:37,647 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 03:47:37,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 03:47:37,647 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:47:37,652 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:47:37,652 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:47:37,743 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:47:37 BasicIcfg [2023-08-27 03:47:37,743 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:47:37,743 INFO L158 Benchmark]: Toolchain (without parser) took 63835.30ms. Allocated memory was 341.8MB in the beginning and 13.3GB in the end (delta: 13.0GB). Free memory was 316.6MB in the beginning and 10.6GB in the end (delta: -10.3GB). Peak memory consumption was 2.7GB. Max. memory is 16.0GB. [2023-08-27 03:47:37,744 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 341.8MB. Free memory is still 318.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:47:37,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.33ms. Allocated memory is still 341.8MB. Free memory was 316.6MB in the beginning and 293.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:37,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.57ms. Allocated memory is still 341.8MB. Free memory was 293.4MB in the beginning and 291.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:37,744 INFO L158 Benchmark]: Boogie Preprocessor took 26.16ms. Allocated memory is still 341.8MB. Free memory was 291.0MB in the beginning and 288.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:47:37,744 INFO L158 Benchmark]: RCFGBuilder took 724.37ms. Allocated memory is still 341.8MB. Free memory was 288.9MB in the beginning and 306.0MB in the end (delta: -17.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. [2023-08-27 03:47:37,748 INFO L158 Benchmark]: TraceAbstraction took 62535.35ms. Allocated memory was 341.8MB in the beginning and 13.3GB in the end (delta: 13.0GB). Free memory was 306.0MB in the beginning and 10.6GB in the end (delta: -10.3GB). Peak memory consumption was 2.6GB. Max. memory is 16.0GB. [2023-08-27 03:47:37,749 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.13ms. Allocated memory is still 341.8MB. Free memory is still 318.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 500.33ms. Allocated memory is still 341.8MB. Free memory was 316.6MB in the beginning and 293.4MB in the end (delta: 23.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 42.57ms. Allocated memory is still 341.8MB. Free memory was 293.4MB in the beginning and 291.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.16ms. Allocated memory is still 341.8MB. Free memory was 291.0MB in the beginning and 288.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 724.37ms. Allocated memory is still 341.8MB. Free memory was 288.9MB in the beginning and 306.0MB in the end (delta: -17.2MB). Peak memory consumption was 31.5MB. Max. memory is 16.0GB. * TraceAbstraction took 62535.35ms. Allocated memory was 341.8MB in the beginning and 13.3GB in the end (delta: 13.0GB). Free memory was 306.0MB in the beginning and 10.6GB in the end (delta: -10.3GB). Peak memory consumption was 2.6GB. 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.0s, 147 PlacesBefore, 50 PlacesAfterwards, 137 TransitionsBefore, 38 TransitionsAfterwards, 4152 CoEnabledTransitionPairs, 7 FixpointIterations, 43 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 119 TotalNumberOfCompositions, 14574 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4849, independent: 4516, independent conditional: 0, independent unconditional: 4516, dependent: 333, dependent conditional: 0, dependent unconditional: 333, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2226, independent: 2172, independent conditional: 0, independent unconditional: 2172, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4849, independent: 2344, independent conditional: 0, independent unconditional: 2344, dependent: 279, dependent conditional: 0, dependent unconditional: 279, unknown: 2226, unknown conditional: 0, unknown unconditional: 2226] , Statistics on independence cache: Total cache size (in pairs): 245, Positive cache size: 219, Positive conditional cache size: 0, Positive unconditional cache size: 219, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, 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_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1061, ((void *)0), P0, ((void *)0))=-1, t1061={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] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1062, ((void *)0), P1, ((void *)0))=0, t1061={5:0}, t1062={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] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1063, ((void *)0), P2, ((void *)0))=1, t1061={5:0}, t1062={6:0}, t1063={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] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1064, ((void *)0), P3, ((void *)0))=2, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={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] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=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}, b=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] [L823] 4 a = 1 [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=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}, b=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] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=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}, b=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] [L752] 1 b = 1 VAL [__unbuffered_cnt=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}, b=1, 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] [L755] 1 x = 1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L767] 2 x = 2 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L770] 2 y = 1 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, 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] [L782] 3 y = 2 VAL [__unbuffered_cnt=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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L760] EXPR 1 __unbuffered_cnt + 1 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L762] 1 return 0; [L775] EXPR 2 __unbuffered_cnt + 1 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 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) [L790] 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)) [L791] 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)) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, 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] [L832] 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) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 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_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}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, 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] [L839] EXPR 4 __unbuffered_cnt + 1 [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L841] 4 return 0; [L803] EXPR 3 __unbuffered_cnt + 1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 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) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 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 [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 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_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice2=1, x=2, y=2, 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] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L876] 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", "mix040.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_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}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=2, 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: 760]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 775]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 803]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 803]: 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: 839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 839]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 861]: 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, 183 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: 62.3s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 54.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1015 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1015 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 62 mSDsCounter, 109 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2756 IncrementalHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 109 mSolverCounterUnsat, 53 mSDtfsCounter, 2756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 96 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4019occurred in iteration=12, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 295 ConstructedInterpolants, 0 QuantifiedInterpolants, 1930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:47:37,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...