/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/mix038_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 03:46:14,211 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 03:46:14,292 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:14,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 03:46:14,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 03:46:14,326 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 03:46:14,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 03:46:14,331 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 03:46:14,331 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 03:46:14,335 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 03:46:14,335 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 03:46:14,335 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 03:46:14,335 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 03:46:14,336 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 03:46:14,337 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 03:46:14,337 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 03:46:14,337 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 03:46:14,337 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 03:46:14,337 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 03:46:14,338 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 03:46:14,338 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 03:46:14,339 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 03:46:14,339 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 03:46:14,339 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 03:46:14,339 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 03:46:14,340 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 03:46:14,340 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 03:46:14,340 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:46:14,340 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 03:46:14,340 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 03:46:14,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 03:46:14,341 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 03:46:14,342 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 03:46:14,342 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 03:46:14,342 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 03:46:14,342 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:14,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 03:46:14,641 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 03:46:14,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 03:46:14,644 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 03:46:14,644 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 03:46:14,645 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 03:46:15,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 03:46:15,942 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 03:46:15,943 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 03:46:15,960 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b63b9934/f0663207e80c478197aa82f4d1dc677a/FLAGf99604323 [2023-08-27 03:46:15,971 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b63b9934/f0663207e80c478197aa82f4d1dc677a [2023-08-27 03:46:15,973 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 03:46:15,974 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 03:46:15,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 03:46:15,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 03:46:15,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 03:46:15,977 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:46:15" (1/1) ... [2023-08-27 03:46:15,978 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@774dd3f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:15, skipping insertion in model container [2023-08-27 03:46:15,978 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 03:46:15" (1/1) ... [2023-08-27 03:46:16,024 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 03:46:16,355 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:46:16,370 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 03:46:16,396 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:46:16,398 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 03:46:16,433 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 03:46:16,474 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:46:16,474 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 03:46:16,480 INFO L206 MainTranslator]: Completed translation [2023-08-27 03:46:16,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:16 WrapperNode [2023-08-27 03:46:16,481 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 03:46:16,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 03:46:16,482 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 03:46:16,482 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 03:46:16,488 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:16" (1/1) ... [2023-08-27 03:46:16,518 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:16" (1/1) ... [2023-08-27 03:46:16,538 INFO L138 Inliner]: procedures = 176, calls = 59, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 138 [2023-08-27 03:46:16,538 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 03:46:16,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 03:46:16,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 03:46:16,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 03:46:16,546 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:16" (1/1) ... [2023-08-27 03:46:16,546 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:16" (1/1) ... [2023-08-27 03:46:16,549 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:16" (1/1) ... [2023-08-27 03:46:16,549 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:16" (1/1) ... [2023-08-27 03:46:16,570 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:16" (1/1) ... [2023-08-27 03:46:16,572 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:16" (1/1) ... [2023-08-27 03:46:16,573 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:16" (1/1) ... [2023-08-27 03:46:16,574 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:16" (1/1) ... [2023-08-27 03:46:16,577 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 03:46:16,578 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 03:46:16,578 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 03:46:16,578 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 03:46:16,578 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:16" (1/1) ... [2023-08-27 03:46:16,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 03:46:16,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 03:46:16,622 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:16,643 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:16,658 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 03:46:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 03:46:16,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 03:46:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 03:46:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 03:46:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 03:46:16,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 03:46:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 03:46:16,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 03:46:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 03:46:16,660 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 03:46:16,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 03:46:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 03:46:16,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 03:46:16,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 03:46:16,663 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:16,823 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 03:46:16,824 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 03:46:17,137 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 03:46:17,303 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 03:46:17,303 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 03:46:17,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:46:17 BoogieIcfgContainer [2023-08-27 03:46:17,305 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 03:46:17,307 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 03:46:17,307 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 03:46:17,309 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 03:46:17,309 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 03:46:15" (1/3) ... [2023-08-27 03:46:17,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686510bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:46:17, skipping insertion in model container [2023-08-27 03:46:17,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 03:46:16" (2/3) ... [2023-08-27 03:46:17,310 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@686510bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 03:46:17, skipping insertion in model container [2023-08-27 03:46:17,310 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 03:46:17" (3/3) ... [2023-08-27 03:46:17,311 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 03:46:17,326 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 03:46:17,326 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2023-08-27 03:46:17,327 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 03:46:17,382 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 03:46:17,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 122 transitions, 259 flow [2023-08-27 03:46:17,474 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-27 03:46:17,474 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:17,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-27 03:46:17,479 INFO L82 GeneralOperation]: Start removeDead. Operand has 129 places, 122 transitions, 259 flow [2023-08-27 03:46:17,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 126 places, 119 transitions, 247 flow [2023-08-27 03:46:17,487 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 03:46:17,494 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-27 03:46:17,496 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 126 places, 119 transitions, 247 flow [2023-08-27 03:46:17,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 126 places, 119 transitions, 247 flow [2023-08-27 03:46:17,519 INFO L124 PetriNetUnfolderBase]: 3/119 cut-off events. [2023-08-27 03:46:17,519 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:17,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 92 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2023-08-27 03:46:17,522 INFO L119 LiptonReduction]: Number of co-enabled transitions 2984 [2023-08-27 03:46:21,063 INFO L134 LiptonReduction]: Checked pairs total: 10888 [2023-08-27 03:46:21,063 INFO L136 LiptonReduction]: Total number of compositions: 107 [2023-08-27 03:46:21,075 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 03:46:21,080 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;@16c8eaa3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 03:46:21,080 INFO L358 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2023-08-27 03:46:21,083 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 03:46:21,083 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-08-27 03:46:21,083 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 03:46:21,083 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:21,084 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 03:46:21,084 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:21,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:21,088 INFO L85 PathProgramCache]: Analyzing trace with hash 547757, now seen corresponding path program 1 times [2023-08-27 03:46:21,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:21,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580105782] [2023-08-27 03:46:21,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:21,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:21,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:21,445 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:21,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:21,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580105782] [2023-08-27 03:46:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580105782] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:21,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:21,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143289487] [2023-08-27 03:46:21,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:21,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:21,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:21,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:21,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 229 [2023-08-27 03:46:21,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have 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:21,487 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:21,487 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 229 [2023-08-27 03:46:21,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:21,930 INFO L124 PetriNetUnfolderBase]: 2064/3327 cut-off events. [2023-08-27 03:46:21,931 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2023-08-27 03:46:21,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6394 conditions, 3327 events. 2064/3327 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19067 event pairs, 597 based on Foata normal form. 0/2654 useless extension candidates. Maximal degree in co-relation 6383. Up to 2549 conditions per place. [2023-08-27 03:46:21,962 INFO L140 encePairwiseOnDemand]: 225/229 looper letters, 40 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-08-27 03:46:21,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 47 transitions, 193 flow [2023-08-27 03:46:21,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:21,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2023-08-27 03:46:21,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5065502183406113 [2023-08-27 03:46:21,980 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2023-08-27 03:46:21,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2023-08-27 03:46:21,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:21,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2023-08-27 03:46:21,990 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have 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:21,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have 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:21,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have 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:21,996 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 3 states and 348 transitions. [2023-08-27 03:46:21,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 47 transitions, 193 flow [2023-08-27 03:46:22,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 47 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-27 03:46:22,002 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 68 flow [2023-08-27 03:46:22,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-08-27 03:46:22,006 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-08-27 03:46:22,006 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 68 flow [2023-08-27 03:46:22,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have 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:22,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:22,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 03:46:22,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 03:46:22,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:22,009 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:22,009 INFO L85 PathProgramCache]: Analyzing trace with hash -861224296, now seen corresponding path program 1 times [2023-08-27 03:46:22,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:22,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153162223] [2023-08-27 03:46:22,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:22,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:22,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:22,107 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:22,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153162223] [2023-08-27 03:46:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153162223] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:22,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:22,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149863165] [2023-08-27 03:46:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:22,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:22,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:22,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-27 03:46:22,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have 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:22,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:22,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-27 03:46:22,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:22,411 INFO L124 PetriNetUnfolderBase]: 1615/2458 cut-off events. [2023-08-27 03:46:22,412 INFO L125 PetriNetUnfolderBase]: For 149/149 co-relation queries the response was YES. [2023-08-27 03:46:22,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5116 conditions, 2458 events. 1615/2458 cut-off events. For 149/149 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12089 event pairs, 559 based on Foata normal form. 0/1918 useless extension candidates. Maximal degree in co-relation 5106. Up to 1741 conditions per place. [2023-08-27 03:46:22,426 INFO L140 encePairwiseOnDemand]: 219/229 looper letters, 42 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-08-27 03:46:22,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 204 flow [2023-08-27 03:46:22,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:22,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:22,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2023-08-27 03:46:22,430 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4992721979621543 [2023-08-27 03:46:22,430 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 343 transitions. [2023-08-27 03:46:22,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 343 transitions. [2023-08-27 03:46:22,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:22,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 343 transitions. [2023-08-27 03:46:22,431 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have 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:22,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have 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:22,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have 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:22,435 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 68 flow. Second operand 3 states and 343 transitions. [2023-08-27 03:46:22,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 204 flow [2023-08-27 03:46:22,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:22,437 INFO L231 Difference]: Finished difference. Result has 39 places, 32 transitions, 100 flow [2023-08-27 03:46:22,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=39, PETRI_TRANSITIONS=32} [2023-08-27 03:46:22,439 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2023-08-27 03:46:22,440 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 32 transitions, 100 flow [2023-08-27 03:46:22,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have 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:22,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:22,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:22,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 03:46:22,448 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:22,448 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:22,449 INFO L85 PathProgramCache]: Analyzing trace with hash 441429799, now seen corresponding path program 1 times [2023-08-27 03:46:22,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:22,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472647534] [2023-08-27 03:46:22,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:22,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:22,587 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:22,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:22,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472647534] [2023-08-27 03:46:22,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472647534] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:22,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:22,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 03:46:22,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002215986] [2023-08-27 03:46:22,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:22,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 03:46:22,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:22,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 03:46:22,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 03:46:22,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 229 [2023-08-27 03:46:22,590 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 32 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have 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:22,590 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:22,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 229 [2023-08-27 03:46:22,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:22,882 INFO L124 PetriNetUnfolderBase]: 1310/2065 cut-off events. [2023-08-27 03:46:22,882 INFO L125 PetriNetUnfolderBase]: For 228/263 co-relation queries the response was YES. [2023-08-27 03:46:22,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4940 conditions, 2065 events. 1310/2065 cut-off events. For 228/263 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 10341 event pairs, 413 based on Foata normal form. 0/1766 useless extension candidates. Maximal degree in co-relation 4929. Up to 1438 conditions per place. [2023-08-27 03:46:22,894 INFO L140 encePairwiseOnDemand]: 226/229 looper letters, 38 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-27 03:46:22,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 45 transitions, 220 flow [2023-08-27 03:46:22,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 03:46:22,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 03:46:22,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 333 transitions. [2023-08-27 03:46:22,896 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4847161572052402 [2023-08-27 03:46:22,896 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 333 transitions. [2023-08-27 03:46:22,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 333 transitions. [2023-08-27 03:46:22,897 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:22,897 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 333 transitions. [2023-08-27 03:46:22,898 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have 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:22,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have 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:22,900 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have 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:22,900 INFO L175 Difference]: Start difference. First operand has 39 places, 32 transitions, 100 flow. Second operand 3 states and 333 transitions. [2023-08-27 03:46:22,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 45 transitions, 220 flow [2023-08-27 03:46:22,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 45 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 03:46:22,903 INFO L231 Difference]: Finished difference. Result has 41 places, 32 transitions, 104 flow [2023-08-27 03:46:22,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=41, PETRI_TRANSITIONS=32} [2023-08-27 03:46:22,904 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-08-27 03:46:22,904 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 32 transitions, 104 flow [2023-08-27 03:46:22,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have 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:22,905 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:22,905 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:22,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 03:46:22,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:22,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:22,909 INFO L85 PathProgramCache]: Analyzing trace with hash -989295568, now seen corresponding path program 1 times [2023-08-27 03:46:22,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:22,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292934402] [2023-08-27 03:46:22,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:22,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:23,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 03:46:23,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:23,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292934402] [2023-08-27 03:46:23,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292934402] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:23,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:23,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:23,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317821611] [2023-08-27 03:46:23,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:23,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:23,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:23,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:23,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:23,066 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2023-08-27 03:46:23,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 104 flow. Second operand has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:23,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:23,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2023-08-27 03:46:23,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:23,575 INFO L124 PetriNetUnfolderBase]: 3094/4876 cut-off events. [2023-08-27 03:46:23,575 INFO L125 PetriNetUnfolderBase]: For 806/857 co-relation queries the response was YES. [2023-08-27 03:46:23,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11575 conditions, 4876 events. 3094/4876 cut-off events. For 806/857 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 28321 event pairs, 351 based on Foata normal form. 96/4540 useless extension candidates. Maximal degree in co-relation 11562. Up to 2684 conditions per place. [2023-08-27 03:46:23,599 INFO L140 encePairwiseOnDemand]: 221/229 looper letters, 59 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2023-08-27 03:46:23,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 71 transitions, 350 flow [2023-08-27 03:46:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:23,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:23,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 436 transitions. [2023-08-27 03:46:23,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4759825327510917 [2023-08-27 03:46:23,601 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 436 transitions. [2023-08-27 03:46:23,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 436 transitions. [2023-08-27 03:46:23,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:23,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 436 transitions. [2023-08-27 03:46:23,602 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:23,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:23,604 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:23,604 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 104 flow. Second operand 4 states and 436 transitions. [2023-08-27 03:46:23,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 71 transitions, 350 flow [2023-08-27 03:46:23,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 71 transitions, 342 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:23,607 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 169 flow [2023-08-27 03:46:23,607 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-27 03:46:23,607 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-27 03:46:23,608 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 169 flow [2023-08-27 03:46:23,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:23,608 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:23,608 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:23,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 03:46:23,608 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:23,609 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:23,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1588592971, now seen corresponding path program 1 times [2023-08-27 03:46:23,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:23,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55076633] [2023-08-27 03:46:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:23,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:23,657 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:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55076633] [2023-08-27 03:46:23,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55076633] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:23,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150756036] [2023-08-27 03:46:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:23,659 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-27 03:46:23,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:23,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:23,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-27 03:46:23,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:24,119 INFO L124 PetriNetUnfolderBase]: 2473/3852 cut-off events. [2023-08-27 03:46:24,120 INFO L125 PetriNetUnfolderBase]: For 2434/2443 co-relation queries the response was YES. [2023-08-27 03:46:24,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10833 conditions, 3852 events. 2473/3852 cut-off events. For 2434/2443 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 21292 event pairs, 764 based on Foata normal form. 2/3482 useless extension candidates. Maximal degree in co-relation 10817. Up to 2433 conditions per place. [2023-08-27 03:46:24,146 INFO L140 encePairwiseOnDemand]: 222/229 looper letters, 49 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2023-08-27 03:46:24,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 58 transitions, 345 flow [2023-08-27 03:46:24,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:24,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:24,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2023-08-27 03:46:24,148 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737991266375546 [2023-08-27 03:46:24,148 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 434 transitions. [2023-08-27 03:46:24,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 434 transitions. [2023-08-27 03:46:24,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:24,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 434 transitions. [2023-08-27 03:46:24,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.5) internal successors, (434), 4 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have 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:24,151 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:24,151 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:24,152 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 169 flow. Second operand 4 states and 434 transitions. [2023-08-27 03:46:24,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 58 transitions, 345 flow [2023-08-27 03:46:24,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 58 transitions, 345 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:46:24,154 INFO L231 Difference]: Finished difference. Result has 45 places, 37 transitions, 165 flow [2023-08-27 03:46:24,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=45, PETRI_TRANSITIONS=37} [2023-08-27 03:46:24,155 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2023-08-27 03:46:24,155 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 37 transitions, 165 flow [2023-08-27 03:46:24,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:24,156 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:24,156 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:24,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 03:46:24,156 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:24,156 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:24,157 INFO L85 PathProgramCache]: Analyzing trace with hash 241707370, now seen corresponding path program 1 times [2023-08-27 03:46:24,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:24,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296497998] [2023-08-27 03:46:24,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:24,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:24,201 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:24,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:24,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296497998] [2023-08-27 03:46:24,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296497998] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:24,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:24,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 03:46:24,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178400784] [2023-08-27 03:46:24,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:24,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:24,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:24,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:24,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-27 03:46:24,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 37 transitions, 165 flow. Second operand has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:24,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:24,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-27 03:46:24,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:24,613 INFO L124 PetriNetUnfolderBase]: 2050/3165 cut-off events. [2023-08-27 03:46:24,613 INFO L125 PetriNetUnfolderBase]: For 2748/2757 co-relation queries the response was YES. [2023-08-27 03:46:24,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9266 conditions, 3165 events. 2050/3165 cut-off events. For 2748/2757 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 16890 event pairs, 694 based on Foata normal form. 2/3089 useless extension candidates. Maximal degree in co-relation 9248. Up to 1279 conditions per place. [2023-08-27 03:46:24,629 INFO L140 encePairwiseOnDemand]: 222/229 looper letters, 67 selfloop transitions, 7 changer transitions 0/79 dead transitions. [2023-08-27 03:46:24,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 79 transitions, 477 flow [2023-08-27 03:46:24,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:24,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:24,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2023-08-27 03:46:24,631 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4923580786026201 [2023-08-27 03:46:24,631 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2023-08-27 03:46:24,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2023-08-27 03:46:24,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:24,632 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2023-08-27 03:46:24,633 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have 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:24,634 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:24,635 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:24,635 INFO L175 Difference]: Start difference. First operand has 45 places, 37 transitions, 165 flow. Second operand 4 states and 451 transitions. [2023-08-27 03:46:24,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 79 transitions, 477 flow [2023-08-27 03:46:24,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 79 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:24,638 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 204 flow [2023-08-27 03:46:24,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-08-27 03:46:24,639 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2023-08-27 03:46:24,639 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 204 flow [2023-08-27 03:46:24,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.5) internal successors, (398), 4 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:24,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:24,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:24,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 03:46:24,640 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:24,640 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:24,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1232939176, now seen corresponding path program 1 times [2023-08-27 03:46:24,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:24,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544919474] [2023-08-27 03:46:24,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:24,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:24,740 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:24,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:24,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544919474] [2023-08-27 03:46:24,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544919474] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:24,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:24,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052322627] [2023-08-27 03:46:24,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:24,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:24,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:24,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:24,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:24,742 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2023-08-27 03:46:24,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have 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:24,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:24,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2023-08-27 03:46:24,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:25,057 INFO L124 PetriNetUnfolderBase]: 1354/2267 cut-off events. [2023-08-27 03:46:25,058 INFO L125 PetriNetUnfolderBase]: For 2483/2489 co-relation queries the response was YES. [2023-08-27 03:46:25,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7252 conditions, 2267 events. 1354/2267 cut-off events. For 2483/2489 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 12495 event pairs, 234 based on Foata normal form. 201/2397 useless extension candidates. Maximal degree in co-relation 7233. Up to 1393 conditions per place. [2023-08-27 03:46:25,071 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 77 selfloop transitions, 8 changer transitions 3/93 dead transitions. [2023-08-27 03:46:25,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 93 transitions, 619 flow [2023-08-27 03:46:25,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 03:46:25,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 03:46:25,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2023-08-27 03:46:25,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646288209606987 [2023-08-27 03:46:25,074 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2023-08-27 03:46:25,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2023-08-27 03:46:25,074 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:25,074 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2023-08-27 03:46:25,075 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have 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:25,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have 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:25,077 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have 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:25,077 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 204 flow. Second operand 5 states and 532 transitions. [2023-08-27 03:46:25,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 93 transitions, 619 flow [2023-08-27 03:46:25,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 93 transitions, 593 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:25,082 INFO L231 Difference]: Finished difference. Result has 52 places, 44 transitions, 247 flow [2023-08-27 03:46:25,083 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=247, PETRI_PLACES=52, PETRI_TRANSITIONS=44} [2023-08-27 03:46:25,083 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 12 predicate places. [2023-08-27 03:46:25,083 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 44 transitions, 247 flow [2023-08-27 03:46:25,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.0) internal successors, (384), 4 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have 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:25,084 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:25,084 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:25,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 03:46:25,084 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:25,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:25,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1491109816, now seen corresponding path program 1 times [2023-08-27 03:46:25,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:25,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540386174] [2023-08-27 03:46:25,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:25,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:25,255 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:25,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:25,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540386174] [2023-08-27 03:46:25,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540386174] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:25,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:25,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:25,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877382540] [2023-08-27 03:46:25,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:25,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:25,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:25,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:25,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:25,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2023-08-27 03:46:25,257 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 44 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have 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:25,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:25,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2023-08-27 03:46:25,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:25,733 INFO L124 PetriNetUnfolderBase]: 2075/3433 cut-off events. [2023-08-27 03:46:25,733 INFO L125 PetriNetUnfolderBase]: For 4491/4491 co-relation queries the response was YES. [2023-08-27 03:46:25,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11604 conditions, 3433 events. 2075/3433 cut-off events. For 4491/4491 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 19316 event pairs, 559 based on Foata normal form. 39/3415 useless extension candidates. Maximal degree in co-relation 11582. Up to 1850 conditions per place. [2023-08-27 03:46:25,750 INFO L140 encePairwiseOnDemand]: 221/229 looper letters, 81 selfloop transitions, 14 changer transitions 3/98 dead transitions. [2023-08-27 03:46:25,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 98 transitions, 719 flow [2023-08-27 03:46:25,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:25,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-08-27 03:46:25,752 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47925764192139736 [2023-08-27 03:46:25,752 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-08-27 03:46:25,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-08-27 03:46:25,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:25,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-08-27 03:46:25,753 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:25,755 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:25,755 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:25,755 INFO L175 Difference]: Start difference. First operand has 52 places, 44 transitions, 247 flow. Second operand 4 states and 439 transitions. [2023-08-27 03:46:25,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 98 transitions, 719 flow [2023-08-27 03:46:25,765 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 98 transitions, 699 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:25,768 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 354 flow [2023-08-27 03:46:25,768 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=354, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2023-08-27 03:46:25,770 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 16 predicate places. [2023-08-27 03:46:25,770 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 354 flow [2023-08-27 03:46:25,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have 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:25,771 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:25,771 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:25,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 03:46:25,771 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:25,771 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:25,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1004416171, now seen corresponding path program 1 times [2023-08-27 03:46:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:25,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174327515] [2023-08-27 03:46:25,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:25,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:25,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:46:25,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:25,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174327515] [2023-08-27 03:46:25,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174327515] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:25,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:25,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 03:46:25,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409568452] [2023-08-27 03:46:25,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:25,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 03:46:25,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:25,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 03:46:25,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 03:46:25,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 229 [2023-08-27 03:46:25,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 354 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 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:25,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:25,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 229 [2023-08-27 03:46:25,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:26,525 INFO L124 PetriNetUnfolderBase]: 2902/4911 cut-off events. [2023-08-27 03:46:26,525 INFO L125 PetriNetUnfolderBase]: For 7989/8026 co-relation queries the response was YES. [2023-08-27 03:46:26,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17524 conditions, 4911 events. 2902/4911 cut-off events. For 7989/8026 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 31586 event pairs, 474 based on Foata normal form. 75/4871 useless extension candidates. Maximal degree in co-relation 17499. Up to 2497 conditions per place. [2023-08-27 03:46:26,550 INFO L140 encePairwiseOnDemand]: 226/229 looper letters, 95 selfloop transitions, 4 changer transitions 0/103 dead transitions. [2023-08-27 03:46:26,550 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 103 transitions, 883 flow [2023-08-27 03:46:26,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 03:46:26,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 03:46:26,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2023-08-27 03:46:26,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47925764192139736 [2023-08-27 03:46:26,552 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 439 transitions. [2023-08-27 03:46:26,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 439 transitions. [2023-08-27 03:46:26,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:26,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 439 transitions. [2023-08-27 03:46:26,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 03:46:26,555 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:26,555 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have 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:26,555 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 354 flow. Second operand 4 states and 439 transitions. [2023-08-27 03:46:26,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 103 transitions, 883 flow [2023-08-27 03:46:26,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 103 transitions, 883 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 03:46:26,569 INFO L231 Difference]: Finished difference. Result has 61 places, 55 transitions, 399 flow [2023-08-27 03:46:26,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=61, PETRI_TRANSITIONS=55} [2023-08-27 03:46:26,570 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 21 predicate places. [2023-08-27 03:46:26,570 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 55 transitions, 399 flow [2023-08-27 03:46:26,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 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:26,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:26,571 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:26,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 03:46:26,571 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:26,571 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:26,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1691146277, now seen corresponding path program 2 times [2023-08-27 03:46:26,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:26,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151738420] [2023-08-27 03:46:26,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:26,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:26,698 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:26,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:26,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151738420] [2023-08-27 03:46:26,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151738420] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:26,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:26,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 03:46:26,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240664327] [2023-08-27 03:46:26,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:26,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 03:46:26,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:26,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 03:46:26,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 03:46:26,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2023-08-27 03:46:26,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 55 transitions, 399 flow. Second operand has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have 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:26,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:26,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2023-08-27 03:46:26,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:27,171 INFO L124 PetriNetUnfolderBase]: 1863/3338 cut-off events. [2023-08-27 03:46:27,171 INFO L125 PetriNetUnfolderBase]: For 5550/5571 co-relation queries the response was YES. [2023-08-27 03:46:27,177 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12069 conditions, 3338 events. 1863/3338 cut-off events. For 5550/5571 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 21847 event pairs, 257 based on Foata normal form. 269/3462 useless extension candidates. Maximal degree in co-relation 12041. Up to 802 conditions per place. [2023-08-27 03:46:27,186 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 102 selfloop transitions, 15 changer transitions 3/129 dead transitions. [2023-08-27 03:46:27,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 129 transitions, 1027 flow [2023-08-27 03:46:27,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:46:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:46:27,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 743 transitions. [2023-08-27 03:46:27,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46350592638802246 [2023-08-27 03:46:27,189 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 743 transitions. [2023-08-27 03:46:27,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 743 transitions. [2023-08-27 03:46:27,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:27,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 743 transitions. [2023-08-27 03:46:27,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.14285714285714) internal successors, (743), 7 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have 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:27,193 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have 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:27,194 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have 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:27,194 INFO L175 Difference]: Start difference. First operand has 61 places, 55 transitions, 399 flow. Second operand 7 states and 743 transitions. [2023-08-27 03:46:27,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 129 transitions, 1027 flow [2023-08-27 03:46:27,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 129 transitions, 1010 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-08-27 03:46:27,228 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 440 flow [2023-08-27 03:46:27,228 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=440, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-08-27 03:46:27,229 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2023-08-27 03:46:27,229 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 440 flow [2023-08-27 03:46:27,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.8) internal successors, (479), 5 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have 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:27,229 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:27,229 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:46:27,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 03:46:27,230 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:27,230 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:27,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1772534322, now seen corresponding path program 1 times [2023-08-27 03:46:27,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:27,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375313484] [2023-08-27 03:46:27,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:27,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:27,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:27,409 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:27,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:27,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375313484] [2023-08-27 03:46:27,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375313484] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:27,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:27,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:46:27,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15995773] [2023-08-27 03:46:27,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:27,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 03:46:27,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:27,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 03:46:27,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 03:46:27,411 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 229 [2023-08-27 03:46:27,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 440 flow. Second operand has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have 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:27,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:27,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 229 [2023-08-27 03:46:27,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:27,883 INFO L124 PetriNetUnfolderBase]: 1681/2913 cut-off events. [2023-08-27 03:46:27,883 INFO L125 PetriNetUnfolderBase]: For 7337/7354 co-relation queries the response was YES. [2023-08-27 03:46:27,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11987 conditions, 2913 events. 1681/2913 cut-off events. For 7337/7354 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 18434 event pairs, 189 based on Foata normal form. 73/2954 useless extension candidates. Maximal degree in co-relation 11956. Up to 802 conditions per place. [2023-08-27 03:46:27,894 INFO L140 encePairwiseOnDemand]: 220/229 looper letters, 35 selfloop transitions, 10 changer transitions 73/120 dead transitions. [2023-08-27 03:46:27,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 120 transitions, 976 flow [2023-08-27 03:46:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 03:46:27,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 03:46:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 930 transitions. [2023-08-27 03:46:27,897 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4512372634643377 [2023-08-27 03:46:27,897 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 930 transitions. [2023-08-27 03:46:27,897 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 930 transitions. [2023-08-27 03:46:27,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:27,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 930 transitions. [2023-08-27 03:46:27,900 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 103.33333333333333) internal successors, (930), 9 states have internal predecessors, (930), 0 states have call successors, (0), 0 states have 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:27,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have 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:27,903 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 229.0) internal successors, (2290), 10 states have internal predecessors, (2290), 0 states have call successors, (0), 0 states have 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:27,903 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 440 flow. Second operand 9 states and 930 transitions. [2023-08-27 03:46:27,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 120 transitions, 976 flow [2023-08-27 03:46:27,981 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 932 flow, removed 2 selfloop flow, removed 5 redundant places. [2023-08-27 03:46:27,983 INFO L231 Difference]: Finished difference. Result has 71 places, 28 transitions, 191 flow [2023-08-27 03:46:27,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=191, PETRI_PLACES=71, PETRI_TRANSITIONS=28} [2023-08-27 03:46:27,983 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2023-08-27 03:46:27,984 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 28 transitions, 191 flow [2023-08-27 03:46:27,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.83333333333333) internal successors, (575), 6 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have 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:27,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:27,984 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:46:27,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 03:46:27,984 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:27,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:27,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1257935492, now seen corresponding path program 1 times [2023-08-27 03:46:27,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:27,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786384530] [2023-08-27 03:46:27,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:27,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:28,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 03:46:29,256 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:29,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 03:46:29,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786384530] [2023-08-27 03:46:29,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786384530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 03:46:29,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 03:46:29,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 03:46:29,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77831] [2023-08-27 03:46:29,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 03:46:29,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 03:46:29,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 03:46:29,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 03:46:29,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-08-27 03:46:29,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 229 [2023-08-27 03:46:29,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 28 transitions, 191 flow. Second operand has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have 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:29,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 03:46:29,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 229 [2023-08-27 03:46:29,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 03:46:29,589 INFO L124 PetriNetUnfolderBase]: 140/290 cut-off events. [2023-08-27 03:46:29,590 INFO L125 PetriNetUnfolderBase]: For 755/755 co-relation queries the response was YES. [2023-08-27 03:46:29,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 290 events. 140/290 cut-off events. For 755/755 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1110 event pairs, 9 based on Foata normal form. 1/290 useless extension candidates. Maximal degree in co-relation 1160. Up to 165 conditions per place. [2023-08-27 03:46:29,591 INFO L140 encePairwiseOnDemand]: 223/229 looper letters, 32 selfloop transitions, 4 changer transitions 22/60 dead transitions. [2023-08-27 03:46:29,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 511 flow [2023-08-27 03:46:29,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 03:46:29,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 03:46:29,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 675 transitions. [2023-08-27 03:46:29,594 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42108546475358705 [2023-08-27 03:46:29,594 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 675 transitions. [2023-08-27 03:46:29,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 675 transitions. [2023-08-27 03:46:29,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 03:46:29,595 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 675 transitions. [2023-08-27 03:46:29,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.42857142857143) internal successors, (675), 7 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have 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:29,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have 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:29,599 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have 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:29,599 INFO L175 Difference]: Start difference. First operand has 71 places, 28 transitions, 191 flow. Second operand 7 states and 675 transitions. [2023-08-27 03:46:29,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 511 flow [2023-08-27 03:46:29,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 374 flow, removed 29 selfloop flow, removed 20 redundant places. [2023-08-27 03:46:29,603 INFO L231 Difference]: Finished difference. Result has 49 places, 28 transitions, 133 flow [2023-08-27 03:46:29,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=133, PETRI_PLACES=49, PETRI_TRANSITIONS=28} [2023-08-27 03:46:29,603 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2023-08-27 03:46:29,603 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 28 transitions, 133 flow [2023-08-27 03:46:29,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.85714285714286) internal successors, (650), 7 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have 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:29,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 03:46:29,604 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:46:29,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 03:46:29,604 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2023-08-27 03:46:29,604 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 03:46:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash -42436346, now seen corresponding path program 2 times [2023-08-27 03:46:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 03:46:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144288913] [2023-08-27 03:46:29,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 03:46:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 03:46:29,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:46:29,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 03:46:29,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 03:46:29,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 03:46:29,719 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 03:46:29,720 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (17 of 18 remaining) [2023-08-27 03:46:29,721 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (16 of 18 remaining) [2023-08-27 03:46:29,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 18 remaining) [2023-08-27 03:46:29,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 18 remaining) [2023-08-27 03:46:29,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 18 remaining) [2023-08-27 03:46:29,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 18 remaining) [2023-08-27 03:46:29,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 18 remaining) [2023-08-27 03:46:29,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 18 remaining) [2023-08-27 03:46:29,722 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 18 remaining) [2023-08-27 03:46:29,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 18 remaining) [2023-08-27 03:46:29,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 18 remaining) [2023-08-27 03:46:29,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (6 of 18 remaining) [2023-08-27 03:46:29,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 18 remaining) [2023-08-27 03:46:29,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 18 remaining) [2023-08-27 03:46:29,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 18 remaining) [2023-08-27 03:46:29,723 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 18 remaining) [2023-08-27 03:46:29,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 18 remaining) [2023-08-27 03:46:29,724 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 18 remaining) [2023-08-27 03:46:29,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 03:46:29,724 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 03:46:29,729 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 03:46:29,729 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 03:46:29,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 03:46:29 BasicIcfg [2023-08-27 03:46:29,780 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 03:46:29,780 INFO L158 Benchmark]: Toolchain (without parser) took 13806.31ms. Allocated memory was 375.4MB in the beginning and 889.2MB in the end (delta: 513.8MB). Free memory was 350.6MB in the beginning and 662.6MB in the end (delta: -312.1MB). Peak memory consumption was 202.2MB. Max. memory is 16.0GB. [2023-08-27 03:46:29,781 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 375.4MB. Free memory is still 352.1MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 03:46:29,781 INFO L158 Benchmark]: CACSL2BoogieTranslator took 506.36ms. Allocated memory is still 375.4MB. Free memory was 350.1MB in the beginning and 326.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 03:46:29,781 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.23ms. Allocated memory is still 375.4MB. Free memory was 326.9MB in the beginning and 324.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:46:29,781 INFO L158 Benchmark]: Boogie Preprocessor took 38.36ms. Allocated memory is still 375.4MB. Free memory was 324.5MB in the beginning and 322.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 03:46:29,781 INFO L158 Benchmark]: RCFGBuilder took 727.60ms. Allocated memory is still 375.4MB. Free memory was 322.4MB in the beginning and 335.4MB in the end (delta: -13.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. [2023-08-27 03:46:29,782 INFO L158 Benchmark]: TraceAbstraction took 12473.26ms. Allocated memory was 375.4MB in the beginning and 889.2MB in the end (delta: 513.8MB). Free memory was 335.4MB in the beginning and 662.6MB in the end (delta: -327.2MB). Peak memory consumption was 185.4MB. Max. memory is 16.0GB. [2023-08-27 03:46:29,783 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 375.4MB. Free memory is still 352.1MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 506.36ms. Allocated memory is still 375.4MB. Free memory was 350.1MB in the beginning and 326.9MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 56.23ms. Allocated memory is still 375.4MB. Free memory was 326.9MB in the beginning and 324.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 38.36ms. Allocated memory is still 375.4MB. Free memory was 324.5MB in the beginning and 322.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 727.60ms. Allocated memory is still 375.4MB. Free memory was 322.4MB in the beginning and 335.4MB in the end (delta: -13.0MB). Peak memory consumption was 29.4MB. Max. memory is 16.0GB. * TraceAbstraction took 12473.26ms. Allocated memory was 375.4MB in the beginning and 889.2MB in the end (delta: 513.8MB). Free memory was 335.4MB in the beginning and 662.6MB in the end (delta: -327.2MB). Peak memory consumption was 185.4MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] - GenericResultAtLocation [Line: 267]: Unsoundness Warning unspecified type, defaulting to int C: short [267] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.6s, 126 PlacesBefore, 40 PlacesAfterwards, 119 TransitionsBefore, 31 TransitionsAfterwards, 2984 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 51 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 14 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 10888 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3767, independent: 3464, independent conditional: 0, independent unconditional: 3464, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1738, independent: 1685, independent conditional: 0, independent unconditional: 1685, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3767, independent: 1779, independent conditional: 0, independent unconditional: 1779, dependent: 250, dependent conditional: 0, dependent unconditional: 250, unknown: 1738, unknown conditional: 0, unknown unconditional: 1738] , Statistics on independence cache: Total cache size (in pairs): 184, Positive cache size: 162, Positive conditional cache size: 0, Positive unconditional cache size: 162, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L717] 0 int a = 0; [L718] 0 _Bool a$flush_delayed; [L719] 0 int a$mem_tmp; [L720] 0 _Bool a$r_buff0_thd0; [L721] 0 _Bool a$r_buff0_thd1; [L722] 0 _Bool a$r_buff0_thd2; [L723] 0 _Bool a$r_buff0_thd3; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$read_delayed; [L729] 0 int *a$read_delayed_var; [L730] 0 int a$w_buff0; [L731] 0 _Bool a$w_buff0_used; [L732] 0 int a$w_buff1; [L733] 0 _Bool a$w_buff1_used; [L734] 0 _Bool main$tmp_guard0; [L735] 0 _Bool main$tmp_guard1; [L737] 0 int x = 0; [L739] 0 int y = 0; [L741] 0 int z = 0; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t1001; [L844] FCALL, FORK 0 pthread_create(&t1001, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1001, ((void *)0), P0, ((void *)0))=-3, t1001={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1002; [L846] FCALL, FORK 0 pthread_create(&t1002, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1002, ((void *)0), P1, ((void *)0))=-2, t1001={5:0}, t1002={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L847] 0 pthread_t t1003; [L848] FCALL, FORK 0 pthread_create(&t1003, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1003, ((void *)0), P2, ((void *)0))=-1, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L747] 1 a$w_buff1 = a$w_buff0 [L748] 1 a$w_buff0 = 1 [L749] 1 a$w_buff1_used = a$w_buff0_used [L750] 1 a$w_buff0_used = (_Bool)1 [L751] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L751] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L752] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L753] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L754] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L755] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L779] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L796] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L782] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L783] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L784] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L785] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L786] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L799] 3 z = 1 [L802] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 a$flush_delayed = weak$$choice2 [L808] 3 a$mem_tmp = a [L809] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L810] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L811] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L812] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L813] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L815] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = a [L817] 3 a = a$flush_delayed ? a$mem_tmp : a [L818] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L821] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L822] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L823] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L824] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L825] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L762] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L763] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L764] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L765] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L766] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] [L769] EXPR 1 __unbuffered_cnt + 1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L789] EXPR 2 __unbuffered_cnt + 1 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L828] EXPR 3 __unbuffered_cnt + 1 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L852] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L852] RET 0 assume_abort_if_not(main$tmp_guard0) [L854] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L855] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L856] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L857] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L858] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1001={5:0}, t1002={6:0}, t1003={3:0}, weak$$choice2=1, x=2, y=1, z=1] [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L863] 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", "mix038_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 769]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 789]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 828]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 846]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 848]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 844]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 156 locations, 18 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 360 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 360 mSDsluCounter, 14 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1093 IncrementalHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 10 mSDtfsCounter, 1093 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=440occurred in iteration=10, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 172 NumberOfCodeBlocks, 172 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 1038 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 03:46:29,804 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...