/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows true -i ../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-27 10:11:22,012 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-27 10:11:22,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-27 10:11:22,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-27 10:11:22,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-27 10:11:22,082 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-27 10:11:22,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-27 10:11:22,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-27 10:11:22,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-27 10:11:22,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-27 10:11:22,084 INFO L153 SettingsManager]: * Use SBE=true [2023-08-27 10:11:22,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-27 10:11:22,085 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-27 10:11:22,085 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-27 10:11:22,085 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-27 10:11:22,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-27 10:11:22,086 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-27 10:11:22,086 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-27 10:11:22,087 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-27 10:11:22,087 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-27 10:11:22,087 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-27 10:11:22,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-27 10:11:22,088 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-27 10:11:22,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-27 10:11:22,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-27 10:11:22,089 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-27 10:11:22,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-27 10:11:22,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:11:22,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-27 10:11:22,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-27 10:11:22,091 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-27 10:11:22,091 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-27 10:11:22,091 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-27 10:11:22,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-27 10:11:22,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-27 10:11:22,092 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Order of the error locations to be checked -> PROGRAM_FIRST Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> true [2023-08-27 10:11:22,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-27 10:11:22,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-27 10:11:22,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-27 10:11:22,452 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-27 10:11:22,452 INFO L274 PluginConnector]: CDTParser initialized [2023-08-27 10:11:22,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:11:23,566 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-27 10:11:23,806 INFO L384 CDTParser]: Found 1 translation units. [2023-08-27 10:11:23,807 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:11:23,821 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a89f4603/5de95d4b38234fbdb05adb82e9da9230/FLAG5325dc268 [2023-08-27 10:11:23,833 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a89f4603/5de95d4b38234fbdb05adb82e9da9230 [2023-08-27 10:11:23,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-27 10:11:23,836 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-27 10:11:23,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-27 10:11:23,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-27 10:11:23,839 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-27 10:11:23,840 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:11:23" (1/1) ... [2023-08-27 10:11:23,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@804e22e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:23, skipping insertion in model container [2023-08-27 10:11:23,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 10:11:23" (1/1) ... [2023-08-27 10:11:23,891 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-27 10:11:24,219 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:11:24,230 INFO L201 MainTranslator]: Completed pre-run [2023-08-27 10:11:24,265 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:11:24,266 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [267] [2023-08-27 10:11:24,306 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-27 10:11:24,331 WARN L669 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:11:24,331 WARN L669 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-27 10:11:24,337 INFO L206 MainTranslator]: Completed translation [2023-08-27 10:11:24,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24 WrapperNode [2023-08-27 10:11:24,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-27 10:11:24,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-27 10:11:24,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-27 10:11:24,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-27 10:11:24,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,366 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,386 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-08-27 10:11:24,386 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-27 10:11:24,387 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-27 10:11:24,387 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-27 10:11:24,387 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-27 10:11:24,394 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,394 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,398 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,398 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,405 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,409 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,410 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,413 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-27 10:11:24,414 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-27 10:11:24,414 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-27 10:11:24,414 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-27 10:11:24,415 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (1/1) ... [2023-08-27 10:11:24,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-27 10:11:24,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-27 10:11:24,474 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-27 10:11:24,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-27 10:11:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-27 10:11:24,507 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-27 10:11:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-27 10:11:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-27 10:11:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-27 10:11:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-27 10:11:24,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-27 10:11:24,508 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-27 10:11:24,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-27 10:11:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-27 10:11:24,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-27 10:11:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-08-27 10:11:24,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-08-27 10:11:24,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-27 10:11:24,510 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-27 10:11:24,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-27 10:11:24,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-27 10:11:24,512 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-27 10:11:24,635 INFO L236 CfgBuilder]: Building ICFG [2023-08-27 10:11:24,637 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-27 10:11:24,971 INFO L277 CfgBuilder]: Performing block encoding [2023-08-27 10:11:25,115 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-27 10:11:25,116 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-27 10:11:25,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:11:25 BoogieIcfgContainer [2023-08-27 10:11:25,118 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-27 10:11:25,122 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-27 10:11:25,123 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-27 10:11:25,125 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-27 10:11:25,126 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.08 10:11:23" (1/3) ... [2023-08-27 10:11:25,126 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aaa3456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:11:25, skipping insertion in model container [2023-08-27 10:11:25,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 10:11:24" (2/3) ... [2023-08-27 10:11:25,127 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7aaa3456 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.08 10:11:25, skipping insertion in model container [2023-08-27 10:11:25,127 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 10:11:25" (3/3) ... [2023-08-27 10:11:25,128 INFO L112 eAbstractionObserver]: Analyzing ICFG mix057_power.oepc_pso.oepc_rmo.oepc.i [2023-08-27 10:11:25,143 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-27 10:11:25,144 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2023-08-27 10:11:25,144 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-27 10:11:25,243 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-27 10:11:25,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 139 transitions, 298 flow [2023-08-27 10:11:25,366 INFO L124 PetriNetUnfolderBase]: 3/135 cut-off events. [2023-08-27 10:11:25,366 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:11:25,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 3/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 106 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 10:11:25,371 INFO L82 GeneralOperation]: Start removeDead. Operand has 149 places, 139 transitions, 298 flow [2023-08-27 10:11:25,378 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 135 transitions, 282 flow [2023-08-27 10:11:25,381 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-27 10:11:25,393 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 135 transitions, 282 flow [2023-08-27 10:11:25,396 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 135 transitions, 282 flow [2023-08-27 10:11:25,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 135 transitions, 282 flow [2023-08-27 10:11:25,442 INFO L124 PetriNetUnfolderBase]: 3/135 cut-off events. [2023-08-27 10:11:25,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:11:25,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 3/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 105 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 99. Up to 2 conditions per place. [2023-08-27 10:11:25,447 INFO L119 LiptonReduction]: Number of co-enabled transitions 4414 [2023-08-27 10:11:29,261 INFO L134 LiptonReduction]: Checked pairs total: 16842 [2023-08-27 10:11:29,261 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-27 10:11:29,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-27 10:11:29,277 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;@4f0819e3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-27 10:11:29,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2023-08-27 10:11:29,279 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-27 10:11:29,279 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2023-08-27 10:11:29,279 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:11:29,279 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:29,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-27 10:11:29,280 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:29,283 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:29,284 INFO L85 PathProgramCache]: Analyzing trace with hash 609073, now seen corresponding path program 1 times [2023-08-27 10:11:29,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:29,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269199307] [2023-08-27 10:11:29,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:29,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:29,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:29,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269199307] [2023-08-27 10:11:29,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269199307] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:29,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:29,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:11:29,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135851996] [2023-08-27 10:11:29,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:29,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:29,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:29,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:29,674 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 251 [2023-08-27 10:11:29,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:29,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:29,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 251 [2023-08-27 10:11:29,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:32,119 INFO L124 PetriNetUnfolderBase]: 16914/24840 cut-off events. [2023-08-27 10:11:32,119 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-08-27 10:11:32,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47633 conditions, 24840 events. 16914/24840 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 1130. Compared 171155 event pairs, 2494 based on Foata normal form. 750/19889 useless extension candidates. Maximal degree in co-relation 47621. Up to 18869 conditions per place. [2023-08-27 10:11:32,288 INFO L140 encePairwiseOnDemand]: 247/251 looper letters, 54 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-08-27 10:11:32,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 63 transitions, 259 flow [2023-08-27 10:11:32,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:32,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-08-27 10:11:32,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5325365205843293 [2023-08-27 10:11:32,304 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-08-27 10:11:32,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-08-27 10:11:32,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:32,309 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-08-27 10:11:32,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:32,321 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:32,322 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:32,323 INFO L175 Difference]: Start difference. First operand has 52 places, 40 transitions, 92 flow. Second operand 3 states and 401 transitions. [2023-08-27 10:11:32,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 63 transitions, 259 flow [2023-08-27 10:11:32,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 63 transitions, 252 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-27 10:11:32,328 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 88 flow [2023-08-27 10:11:32,330 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-27 10:11:32,332 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -3 predicate places. [2023-08-27 10:11:32,333 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 88 flow [2023-08-27 10:11:32,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:32,333 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:32,333 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:11:32,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-27 10:11:32,334 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:32,334 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:32,334 INFO L85 PathProgramCache]: Analyzing trace with hash 965487331, now seen corresponding path program 1 times [2023-08-27 10:11:32,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:32,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150707312] [2023-08-27 10:11:32,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:32,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:32,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:32,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:32,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150707312] [2023-08-27 10:11:32,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150707312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:32,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:32,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:11:32,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897148476] [2023-08-27 10:11:32,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:32,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:32,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:32,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:32,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:32,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-27 10:11:32,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:32,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:32,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-27 10:11:32,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:34,617 INFO L124 PetriNetUnfolderBase]: 16914/22512 cut-off events. [2023-08-27 10:11:34,617 INFO L125 PetriNetUnfolderBase]: For 1111/1111 co-relation queries the response was YES. [2023-08-27 10:11:34,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46415 conditions, 22512 events. 16914/22512 cut-off events. For 1111/1111 co-relation queries the response was YES. Maximal size of possible extension queue 921. Compared 119066 event pairs, 16914 based on Foata normal form. 0/16792 useless extension candidates. Maximal degree in co-relation 46405. Up to 22475 conditions per place. [2023-08-27 10:11:34,716 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 30 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2023-08-27 10:11:34,717 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 34 transitions, 142 flow [2023-08-27 10:11:34,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2023-08-27 10:11:34,720 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4807436918990704 [2023-08-27 10:11:34,720 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2023-08-27 10:11:34,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2023-08-27 10:11:34,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:34,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2023-08-27 10:11:34,721 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:34,723 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:34,724 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:34,724 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 88 flow. Second operand 3 states and 362 transitions. [2023-08-27 10:11:34,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 34 transitions, 142 flow [2023-08-27 10:11:34,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 34 transitions, 138 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:34,726 INFO L231 Difference]: Finished difference. Result has 45 places, 34 transitions, 78 flow [2023-08-27 10:11:34,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=45, PETRI_TRANSITIONS=34} [2023-08-27 10:11:34,729 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -7 predicate places. [2023-08-27 10:11:34,730 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 34 transitions, 78 flow [2023-08-27 10:11:34,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:34,731 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:34,735 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-27 10:11:34,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-27 10:11:34,735 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:34,737 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:34,737 INFO L85 PathProgramCache]: Analyzing trace with hash 965487332, now seen corresponding path program 1 times [2023-08-27 10:11:34,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:34,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735250348] [2023-08-27 10:11:34,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:34,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:34,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:34,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:34,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735250348] [2023-08-27 10:11:34,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735250348] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:34,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:34,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-27 10:11:34,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951845066] [2023-08-27 10:11:34,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:34,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-27 10:11:34,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:34,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-27 10:11:34,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-27 10:11:34,785 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-27 10:11:34,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 34 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:34,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:34,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-27 10:11:34,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:35,918 INFO L124 PetriNetUnfolderBase]: 10938/14951 cut-off events. [2023-08-27 10:11:35,919 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-27 10:11:35,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30102 conditions, 14951 events. 10938/14951 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 80893 event pairs, 2969 based on Foata normal form. 0/11907 useless extension candidates. Maximal degree in co-relation 30096. Up to 11983 conditions per place. [2023-08-27 10:11:36,012 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 51 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2023-08-27 10:11:36,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 59 transitions, 246 flow [2023-08-27 10:11:36,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-27 10:11:36,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-27 10:11:36,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2023-08-27 10:11:36,014 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5139442231075697 [2023-08-27 10:11:36,014 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 387 transitions. [2023-08-27 10:11:36,014 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 387 transitions. [2023-08-27 10:11:36,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:36,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 387 transitions. [2023-08-27 10:11:36,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.0) internal successors, (387), 3 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 10:11:36,017 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:36,018 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 251.0) internal successors, (1004), 4 states have internal predecessors, (1004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:36,018 INFO L175 Difference]: Start difference. First operand has 45 places, 34 transitions, 78 flow. Second operand 3 states and 387 transitions. [2023-08-27 10:11:36,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 59 transitions, 246 flow [2023-08-27 10:11:36,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 59 transitions, 245 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:11:36,020 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 116 flow [2023-08-27 10:11:36,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-08-27 10:11:36,021 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -5 predicate places. [2023-08-27 10:11:36,022 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 116 flow [2023-08-27 10:11:36,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:36,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:36,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:36,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-27 10:11:36,025 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:36,026 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:36,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1923049266, now seen corresponding path program 1 times [2023-08-27 10:11:36,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:36,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191613882] [2023-08-27 10:11:36,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:36,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:36,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:36,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:36,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191613882] [2023-08-27 10:11:36,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191613882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:36,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:36,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:36,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901432925] [2023-08-27 10:11:36,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:36,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:36,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:36,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:36,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:36,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-27 10:11:36,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 116 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:36,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:36,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-27 10:11:36,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:37,051 INFO L124 PetriNetUnfolderBase]: 7470/10254 cut-off events. [2023-08-27 10:11:37,051 INFO L125 PetriNetUnfolderBase]: For 852/852 co-relation queries the response was YES. [2023-08-27 10:11:37,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24394 conditions, 10254 events. 7470/10254 cut-off events. For 852/852 co-relation queries the response was YES. Maximal size of possible extension queue 429. Compared 53752 event pairs, 2185 based on Foata normal form. 0/9112 useless extension candidates. Maximal degree in co-relation 24386. Up to 3924 conditions per place. [2023-08-27 10:11:37,122 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 70 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2023-08-27 10:11:37,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 380 flow [2023-08-27 10:11:37,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-27 10:11:37,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-27 10:11:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 519 transitions. [2023-08-27 10:11:37,127 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5169322709163346 [2023-08-27 10:11:37,127 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 519 transitions. [2023-08-27 10:11:37,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 519 transitions. [2023-08-27 10:11:37,128 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:37,128 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 519 transitions. [2023-08-27 10:11:37,130 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.75) internal successors, (519), 4 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:37,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:37,133 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 251.0) internal successors, (1255), 5 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:37,133 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 116 flow. Second operand 4 states and 519 transitions. [2023-08-27 10:11:37,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 380 flow [2023-08-27 10:11:37,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 375 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:11:37,142 INFO L231 Difference]: Finished difference. Result has 50 places, 42 transitions, 169 flow [2023-08-27 10:11:37,142 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=50, PETRI_TRANSITIONS=42} [2023-08-27 10:11:37,144 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, -2 predicate places. [2023-08-27 10:11:37,144 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 42 transitions, 169 flow [2023-08-27 10:11:37,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:37,144 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:37,145 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:37,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-27 10:11:37,145 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:37,145 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:37,145 INFO L85 PathProgramCache]: Analyzing trace with hash -962466154, now seen corresponding path program 1 times [2023-08-27 10:11:37,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:37,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941715524] [2023-08-27 10:11:37,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:37,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:37,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:37,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:37,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941715524] [2023-08-27 10:11:37,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941715524] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:37,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:37,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:37,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877802570] [2023-08-27 10:11:37,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:37,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:37,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:37,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:37,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:37,375 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-27 10:11:37,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 42 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:37,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:37,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-27 10:11:37,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:40,340 INFO L124 PetriNetUnfolderBase]: 32649/44240 cut-off events. [2023-08-27 10:11:40,340 INFO L125 PetriNetUnfolderBase]: For 30651/30651 co-relation queries the response was YES. [2023-08-27 10:11:40,413 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112186 conditions, 44240 events. 32649/44240 cut-off events. For 30651/30651 co-relation queries the response was YES. Maximal size of possible extension queue 1381. Compared 252842 event pairs, 9151 based on Foata normal form. 0/40624 useless extension candidates. Maximal degree in co-relation 112176. Up to 17430 conditions per place. [2023-08-27 10:11:40,546 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 122 selfloop transitions, 16 changer transitions 0/138 dead transitions. [2023-08-27 10:11:40,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 138 transitions, 857 flow [2023-08-27 10:11:40,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:11:40,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:11:40,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 608 transitions. [2023-08-27 10:11:40,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48446215139442234 [2023-08-27 10:11:40,550 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 608 transitions. [2023-08-27 10:11:40,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 608 transitions. [2023-08-27 10:11:40,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:40,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 608 transitions. [2023-08-27 10:11:40,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.6) internal successors, (608), 5 states have internal predecessors, (608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:40,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:40,557 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:40,557 INFO L175 Difference]: Start difference. First operand has 50 places, 42 transitions, 169 flow. Second operand 5 states and 608 transitions. [2023-08-27 10:11:40,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 138 transitions, 857 flow [2023-08-27 10:11:40,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 138 transitions, 791 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-27 10:11:40,613 INFO L231 Difference]: Finished difference. Result has 56 places, 57 transitions, 279 flow [2023-08-27 10:11:40,613 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=279, PETRI_PLACES=56, PETRI_TRANSITIONS=57} [2023-08-27 10:11:40,615 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 4 predicate places. [2023-08-27 10:11:40,616 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 57 transitions, 279 flow [2023-08-27 10:11:40,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.0) internal successors, (412), 4 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:40,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:40,616 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:40,616 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-27 10:11:40,616 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:40,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:40,617 INFO L85 PathProgramCache]: Analyzing trace with hash 228254903, now seen corresponding path program 1 times [2023-08-27 10:11:40,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:40,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507078709] [2023-08-27 10:11:40,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:40,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:40,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:40,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:40,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507078709] [2023-08-27 10:11:40,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507078709] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:40,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:40,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:40,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367565723] [2023-08-27 10:11:40,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:40,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:40,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:40,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:40,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:40,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-27 10:11:40,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 57 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:40,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:40,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-27 10:11:40,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:45,413 INFO L124 PetriNetUnfolderBase]: 39100/54491 cut-off events. [2023-08-27 10:11:45,413 INFO L125 PetriNetUnfolderBase]: For 55173/55780 co-relation queries the response was YES. [2023-08-27 10:11:45,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164815 conditions, 54491 events. 39100/54491 cut-off events. For 55173/55780 co-relation queries the response was YES. Maximal size of possible extension queue 2189. Compared 348048 event pairs, 11456 based on Foata normal form. 1271/52145 useless extension candidates. Maximal degree in co-relation 164801. Up to 35896 conditions per place. [2023-08-27 10:11:45,826 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 124 selfloop transitions, 13 changer transitions 0/143 dead transitions. [2023-08-27 10:11:45,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 143 transitions, 975 flow [2023-08-27 10:11:45,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:11:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:11:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 617 transitions. [2023-08-27 10:11:45,829 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49163346613545816 [2023-08-27 10:11:45,829 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 617 transitions. [2023-08-27 10:11:45,829 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 617 transitions. [2023-08-27 10:11:45,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:45,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 617 transitions. [2023-08-27 10:11:45,831 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.4) internal successors, (617), 5 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:45,833 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:45,834 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:45,834 INFO L175 Difference]: Start difference. First operand has 56 places, 57 transitions, 279 flow. Second operand 5 states and 617 transitions. [2023-08-27 10:11:45,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 143 transitions, 975 flow [2023-08-27 10:11:45,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 143 transitions, 975 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:11:45,853 INFO L231 Difference]: Finished difference. Result has 63 places, 69 transitions, 424 flow [2023-08-27 10:11:45,853 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=424, PETRI_PLACES=63, PETRI_TRANSITIONS=69} [2023-08-27 10:11:45,855 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-27 10:11:45,856 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 69 transitions, 424 flow [2023-08-27 10:11:45,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:45,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:45,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:45,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-27 10:11:45,856 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:45,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:45,857 INFO L85 PathProgramCache]: Analyzing trace with hash 228282772, now seen corresponding path program 1 times [2023-08-27 10:11:45,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:45,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917095672] [2023-08-27 10:11:45,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:45,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:45,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:46,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:46,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917095672] [2023-08-27 10:11:46,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917095672] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:46,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:46,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:11:46,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384071789] [2023-08-27 10:11:46,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:46,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:11:46,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:46,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:11:46,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:11:46,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-27 10:11:46,007 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 69 transitions, 424 flow. Second operand has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:46,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:46,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-27 10:11:46,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:11:51,926 INFO L124 PetriNetUnfolderBase]: 51891/71316 cut-off events. [2023-08-27 10:11:51,927 INFO L125 PetriNetUnfolderBase]: For 120610/120610 co-relation queries the response was YES. [2023-08-27 10:11:52,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235807 conditions, 71316 events. 51891/71316 cut-off events. For 120610/120610 co-relation queries the response was YES. Maximal size of possible extension queue 2446. Compared 448758 event pairs, 3673 based on Foata normal form. 1027/69003 useless extension candidates. Maximal degree in co-relation 235788. Up to 19086 conditions per place. [2023-08-27 10:11:52,369 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 175 selfloop transitions, 46 changer transitions 0/221 dead transitions. [2023-08-27 10:11:52,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 221 transitions, 1718 flow [2023-08-27 10:11:52,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:11:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:11:52,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 836 transitions. [2023-08-27 10:11:52,372 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47581104154809334 [2023-08-27 10:11:52,372 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 836 transitions. [2023-08-27 10:11:52,372 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 836 transitions. [2023-08-27 10:11:52,373 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:11:52,373 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 836 transitions. [2023-08-27 10:11:52,374 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.42857142857143) internal successors, (836), 7 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:52,377 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:52,377 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:52,377 INFO L175 Difference]: Start difference. First operand has 63 places, 69 transitions, 424 flow. Second operand 7 states and 836 transitions. [2023-08-27 10:11:52,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 221 transitions, 1718 flow [2023-08-27 10:11:52,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 221 transitions, 1709 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-27 10:11:52,447 INFO L231 Difference]: Finished difference. Result has 74 places, 106 transitions, 935 flow [2023-08-27 10:11:52,447 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=935, PETRI_PLACES=74, PETRI_TRANSITIONS=106} [2023-08-27 10:11:52,447 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 22 predicate places. [2023-08-27 10:11:52,448 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 106 transitions, 935 flow [2023-08-27 10:11:52,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:52,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:11:52,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:11:52,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-27 10:11:52,448 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:11:52,449 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:11:52,449 INFO L85 PathProgramCache]: Analyzing trace with hash 116236239, now seen corresponding path program 1 times [2023-08-27 10:11:52,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:11:52,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512492743] [2023-08-27 10:11:52,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:11:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:11:52,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:11:52,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:11:52,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:11:52,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512492743] [2023-08-27 10:11:52,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512492743] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:11:52,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:11:52,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-27 10:11:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661492565] [2023-08-27 10:11:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:11:52,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:11:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:11:52,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:11:52,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:11:52,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-27 10:11:52,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 106 transitions, 935 flow. Second operand has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:11:52,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:11:52,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-27 10:11:52,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:01,445 INFO L124 PetriNetUnfolderBase]: 62584/89284 cut-off events. [2023-08-27 10:12:01,446 INFO L125 PetriNetUnfolderBase]: For 235072/236304 co-relation queries the response was YES. [2023-08-27 10:12:01,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313262 conditions, 89284 events. 62584/89284 cut-off events. For 235072/236304 co-relation queries the response was YES. Maximal size of possible extension queue 3799. Compared 638565 event pairs, 25969 based on Foata normal form. 1574/85532 useless extension candidates. Maximal degree in co-relation 313236. Up to 55352 conditions per place. [2023-08-27 10:12:02,104 INFO L140 encePairwiseOnDemand]: 246/251 looper letters, 174 selfloop transitions, 23 changer transitions 0/221 dead transitions. [2023-08-27 10:12:02,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 221 transitions, 2173 flow [2023-08-27 10:12:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:12:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:12:02,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-27 10:12:02,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4932270916334661 [2023-08-27 10:12:02,106 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-27 10:12:02,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-27 10:12:02,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:02,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-27 10:12:02,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:02,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:02,110 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:02,110 INFO L175 Difference]: Start difference. First operand has 74 places, 106 transitions, 935 flow. Second operand 5 states and 619 transitions. [2023-08-27 10:12:02,110 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 221 transitions, 2173 flow [2023-08-27 10:12:02,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 221 transitions, 2173 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-27 10:12:02,865 INFO L231 Difference]: Finished difference. Result has 81 places, 128 transitions, 1272 flow [2023-08-27 10:12:02,865 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1272, PETRI_PLACES=81, PETRI_TRANSITIONS=128} [2023-08-27 10:12:02,865 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 29 predicate places. [2023-08-27 10:12:02,866 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 128 transitions, 1272 flow [2023-08-27 10:12:02,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.5) internal successors, (442), 4 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:02,866 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:02,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:02,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-27 10:12:02,866 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:02,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:02,867 INFO L85 PathProgramCache]: Analyzing trace with hash 306349251, now seen corresponding path program 1 times [2023-08-27 10:12:02,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:02,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465635821] [2023-08-27 10:12:02,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:02,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:02,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:03,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:12:03,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:03,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465635821] [2023-08-27 10:12:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465635821] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:03,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:12:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346269381] [2023-08-27 10:12:03,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:03,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:12:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:03,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:12:03,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:12:03,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-27 10:12:03,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 128 transitions, 1272 flow. Second operand has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:03,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:03,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-27 10:12:03,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:17,603 INFO L124 PetriNetUnfolderBase]: 103410/144496 cut-off events. [2023-08-27 10:12:17,603 INFO L125 PetriNetUnfolderBase]: For 493476/493476 co-relation queries the response was YES. [2023-08-27 10:12:18,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536199 conditions, 144496 events. 103410/144496 cut-off events. For 493476/493476 co-relation queries the response was YES. Maximal size of possible extension queue 5182. Compared 1041289 event pairs, 17288 based on Foata normal form. 1150/137953 useless extension candidates. Maximal degree in co-relation 536168. Up to 46030 conditions per place. [2023-08-27 10:12:18,665 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 218 selfloop transitions, 83 changer transitions 0/301 dead transitions. [2023-08-27 10:12:18,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 301 transitions, 2934 flow [2023-08-27 10:12:18,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:12:18,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:12:18,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 856 transitions. [2023-08-27 10:12:18,668 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4871940808195788 [2023-08-27 10:12:18,668 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 856 transitions. [2023-08-27 10:12:18,668 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 856 transitions. [2023-08-27 10:12:18,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:18,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 856 transitions. [2023-08-27 10:12:18,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.28571428571429) internal successors, (856), 7 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:18,672 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:18,673 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:18,673 INFO L175 Difference]: Start difference. First operand has 81 places, 128 transitions, 1272 flow. Second operand 7 states and 856 transitions. [2023-08-27 10:12:18,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 301 transitions, 2934 flow [2023-08-27 10:12:20,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 301 transitions, 2921 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-08-27 10:12:20,359 INFO L231 Difference]: Finished difference. Result has 92 places, 153 transitions, 1907 flow [2023-08-27 10:12:20,359 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1259, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1907, PETRI_PLACES=92, PETRI_TRANSITIONS=153} [2023-08-27 10:12:20,360 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 40 predicate places. [2023-08-27 10:12:20,360 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 153 transitions, 1907 flow [2023-08-27 10:12:20,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.0) internal successors, (515), 5 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:20,360 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:20,360 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:20,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-27 10:12:20,360 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:20,361 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:20,361 INFO L85 PathProgramCache]: Analyzing trace with hash 308404830, now seen corresponding path program 1 times [2023-08-27 10:12:20,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:20,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509897520] [2023-08-27 10:12:20,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:20,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:20,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:20,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:12:20,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:20,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509897520] [2023-08-27 10:12:20,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509897520] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:20,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:20,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:12:20,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838561813] [2023-08-27 10:12:20,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:20,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-27 10:12:20,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:20,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-27 10:12:20,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-27 10:12:20,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-27 10:12:20,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 153 transitions, 1907 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:20,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:20,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-27 10:12:20,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:26,491 INFO L124 PetriNetUnfolderBase]: 36213/55376 cut-off events. [2023-08-27 10:12:26,491 INFO L125 PetriNetUnfolderBase]: For 258289/261225 co-relation queries the response was YES. [2023-08-27 10:12:26,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210665 conditions, 55376 events. 36213/55376 cut-off events. For 258289/261225 co-relation queries the response was YES. Maximal size of possible extension queue 2466. Compared 433248 event pairs, 11387 based on Foata normal form. 2502/51673 useless extension candidates. Maximal degree in co-relation 210627. Up to 41092 conditions per place. [2023-08-27 10:12:26,934 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 186 selfloop transitions, 12 changer transitions 0/243 dead transitions. [2023-08-27 10:12:26,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 243 transitions, 3073 flow [2023-08-27 10:12:26,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:12:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:12:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2023-08-27 10:12:26,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4932270916334661 [2023-08-27 10:12:26,936 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 619 transitions. [2023-08-27 10:12:26,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 619 transitions. [2023-08-27 10:12:26,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:26,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 619 transitions. [2023-08-27 10:12:26,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.8) internal successors, (619), 5 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:26,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:26,939 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:26,939 INFO L175 Difference]: Start difference. First operand has 92 places, 153 transitions, 1907 flow. Second operand 5 states and 619 transitions. [2023-08-27 10:12:26,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 243 transitions, 3073 flow [2023-08-27 10:12:28,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 243 transitions, 3025 flow, removed 24 selfloop flow, removed 0 redundant places. [2023-08-27 10:12:28,385 INFO L231 Difference]: Finished difference. Result has 99 places, 149 transitions, 1783 flow [2023-08-27 10:12:28,386 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1707, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1783, PETRI_PLACES=99, PETRI_TRANSITIONS=149} [2023-08-27 10:12:28,386 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 47 predicate places. [2023-08-27 10:12:28,386 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 149 transitions, 1783 flow [2023-08-27 10:12:28,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:28,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:28,387 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:12:28,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-27 10:12:28,387 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:28,387 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:28,387 INFO L85 PathProgramCache]: Analyzing trace with hash -559311899, now seen corresponding path program 1 times [2023-08-27 10:12:28,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:28,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107628586] [2023-08-27 10:12:28,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:28,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:28,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:28,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:12:28,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:28,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107628586] [2023-08-27 10:12:28,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107628586] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:28,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:28,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:12:28,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140312504] [2023-08-27 10:12:28,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:28,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:12:28,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:28,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:12:28,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:12:28,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-27 10:12:28,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 149 transitions, 1783 flow. Second operand has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:28,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:28,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-27 10:12:28,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:39,321 INFO L124 PetriNetUnfolderBase]: 66666/98822 cut-off events. [2023-08-27 10:12:39,321 INFO L125 PetriNetUnfolderBase]: For 548309/548309 co-relation queries the response was YES. [2023-08-27 10:12:39,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404995 conditions, 98822 events. 66666/98822 cut-off events. For 548309/548309 co-relation queries the response was YES. Maximal size of possible extension queue 3825. Compared 771745 event pairs, 10941 based on Foata normal form. 882/91210 useless extension candidates. Maximal degree in co-relation 404952. Up to 34107 conditions per place. [2023-08-27 10:12:40,191 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 240 selfloop transitions, 96 changer transitions 0/336 dead transitions. [2023-08-27 10:12:40,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 336 transitions, 3957 flow [2023-08-27 10:12:40,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:12:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:12:40,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 854 transitions. [2023-08-27 10:12:40,193 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4860557768924303 [2023-08-27 10:12:40,193 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 854 transitions. [2023-08-27 10:12:40,194 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 854 transitions. [2023-08-27 10:12:40,194 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:40,194 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 854 transitions. [2023-08-27 10:12:40,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.0) internal successors, (854), 7 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:40,198 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:40,198 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:40,198 INFO L175 Difference]: Start difference. First operand has 99 places, 149 transitions, 1783 flow. Second operand 7 states and 854 transitions. [2023-08-27 10:12:40,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 336 transitions, 3957 flow [2023-08-27 10:12:44,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 336 transitions, 3928 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-27 10:12:44,572 INFO L231 Difference]: Finished difference. Result has 110 places, 185 transitions, 2758 flow [2023-08-27 10:12:44,572 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=1772, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=149, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=60, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=2758, PETRI_PLACES=110, PETRI_TRANSITIONS=185} [2023-08-27 10:12:44,572 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 58 predicate places. [2023-08-27 10:12:44,572 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 185 transitions, 2758 flow [2023-08-27 10:12:44,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:44,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:44,573 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 10:12:44,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-27 10:12:44,573 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:44,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1996877183, now seen corresponding path program 1 times [2023-08-27 10:12:44,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:44,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860525385] [2023-08-27 10:12:44,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:44,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:12:44,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:44,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860525385] [2023-08-27 10:12:44,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860525385] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:44,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:44,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-27 10:12:44,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626274336] [2023-08-27 10:12:44,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:44,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:12:44,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:44,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:12:44,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:12:44,640 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-27 10:12:44,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 185 transitions, 2758 flow. Second operand has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:44,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:44,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-27 10:12:44,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:12:53,327 INFO L124 PetriNetUnfolderBase]: 45901/69526 cut-off events. [2023-08-27 10:12:53,328 INFO L125 PetriNetUnfolderBase]: For 440275/444051 co-relation queries the response was YES. [2023-08-27 10:12:53,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 282825 conditions, 69526 events. 45901/69526 cut-off events. For 440275/444051 co-relation queries the response was YES. Maximal size of possible extension queue 3473. Compared 560724 event pairs, 6766 based on Foata normal form. 1164/68877 useless extension candidates. Maximal degree in co-relation 282775. Up to 27834 conditions per place. [2023-08-27 10:12:53,960 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 287 selfloop transitions, 17 changer transitions 0/366 dead transitions. [2023-08-27 10:12:53,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 366 transitions, 5860 flow [2023-08-27 10:12:53,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-27 10:12:53,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-27 10:12:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 645 transitions. [2023-08-27 10:12:53,963 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5139442231075697 [2023-08-27 10:12:53,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 645 transitions. [2023-08-27 10:12:53,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 645 transitions. [2023-08-27 10:12:53,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:12:53,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 645 transitions. [2023-08-27 10:12:53,965 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.0) internal successors, (645), 5 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:53,966 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:53,966 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 251.0) internal successors, (1506), 6 states have internal predecessors, (1506), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:53,967 INFO L175 Difference]: Start difference. First operand has 110 places, 185 transitions, 2758 flow. Second operand 5 states and 645 transitions. [2023-08-27 10:12:53,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 366 transitions, 5860 flow [2023-08-27 10:12:56,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 366 transitions, 5685 flow, removed 17 selfloop flow, removed 1 redundant places. [2023-08-27 10:12:56,528 INFO L231 Difference]: Finished difference. Result has 114 places, 189 transitions, 2753 flow [2023-08-27 10:12:56,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2671, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2753, PETRI_PLACES=114, PETRI_TRANSITIONS=189} [2023-08-27 10:12:56,529 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 62 predicate places. [2023-08-27 10:12:56,529 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 189 transitions, 2753 flow [2023-08-27 10:12:56,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:56,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:12:56,529 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 10:12:56,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-27 10:12:56,529 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:12:56,529 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:12:56,530 INFO L85 PathProgramCache]: Analyzing trace with hash 231086338, now seen corresponding path program 1 times [2023-08-27 10:12:56,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:12:56,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708358897] [2023-08-27 10:12:56,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:12:56,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:12:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:12:56,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:12:56,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:12:56,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708358897] [2023-08-27 10:12:56,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708358897] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:12:56,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:12:56,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:12:56,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580609532] [2023-08-27 10:12:56,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:12:56,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:12:56,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:12:56,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:12:56,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:12:56,680 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 251 [2023-08-27 10:12:56,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 189 transitions, 2753 flow. Second operand has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:12:56,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:12:56,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 251 [2023-08-27 10:12:56,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:13,396 INFO L124 PetriNetUnfolderBase]: 88627/131053 cut-off events. [2023-08-27 10:13:13,396 INFO L125 PetriNetUnfolderBase]: For 1009749/1009749 co-relation queries the response was YES. [2023-08-27 10:13:14,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 596458 conditions, 131053 events. 88627/131053 cut-off events. For 1009749/1009749 co-relation queries the response was YES. Maximal size of possible extension queue 5631. Compared 1058100 event pairs, 21777 based on Foata normal form. 897/129450 useless extension candidates. Maximal degree in co-relation 596406. Up to 37035 conditions per place. [2023-08-27 10:13:14,671 INFO L140 encePairwiseOnDemand]: 241/251 looper letters, 315 selfloop transitions, 137 changer transitions 12/464 dead transitions. [2023-08-27 10:13:14,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 464 transitions, 6707 flow [2023-08-27 10:13:14,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:13:14,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:13:14,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 858 transitions. [2023-08-27 10:13:14,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48833238474672735 [2023-08-27 10:13:14,674 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 858 transitions. [2023-08-27 10:13:14,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 858 transitions. [2023-08-27 10:13:14,674 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:14,674 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 858 transitions. [2023-08-27 10:13:14,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:14,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:14,678 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:14,678 INFO L175 Difference]: Start difference. First operand has 114 places, 189 transitions, 2753 flow. Second operand 7 states and 858 transitions. [2023-08-27 10:13:14,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 464 transitions, 6707 flow [2023-08-27 10:13:34,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 464 transitions, 6513 flow, removed 48 selfloop flow, removed 3 redundant places. [2023-08-27 10:13:34,936 INFO L231 Difference]: Finished difference. Result has 123 places, 273 transitions, 4813 flow [2023-08-27 10:13:34,937 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2711, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=4813, PETRI_PLACES=123, PETRI_TRANSITIONS=273} [2023-08-27 10:13:34,937 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 71 predicate places. [2023-08-27 10:13:34,937 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 273 transitions, 4813 flow [2023-08-27 10:13:34,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.6) internal successors, (518), 5 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:34,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:34,938 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 10:13:34,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-27 10:13:34,938 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:13:34,938 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:34,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1895600764, now seen corresponding path program 1 times [2023-08-27 10:13:34,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:34,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373248338] [2023-08-27 10:13:34,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:34,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:34,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:35,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:13:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:35,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373248338] [2023-08-27 10:13:35,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373248338] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:35,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:35,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:13:35,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590054421] [2023-08-27 10:13:35,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:35,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-27 10:13:35,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:35,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-27 10:13:35,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-27 10:13:35,092 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-27 10:13:35,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 273 transitions, 4813 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:35,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:35,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-27 10:13:35,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:42,510 INFO L124 PetriNetUnfolderBase]: 34162/52857 cut-off events. [2023-08-27 10:13:42,510 INFO L125 PetriNetUnfolderBase]: For 386167/390934 co-relation queries the response was YES. [2023-08-27 10:13:42,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222806 conditions, 52857 events. 34162/52857 cut-off events. For 386167/390934 co-relation queries the response was YES. Maximal size of possible extension queue 2264. Compared 420590 event pairs, 4185 based on Foata normal form. 3491/54144 useless extension candidates. Maximal degree in co-relation 222748. Up to 18388 conditions per place. [2023-08-27 10:13:42,980 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 325 selfloop transitions, 22 changer transitions 4/417 dead transitions. [2023-08-27 10:13:42,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 417 transitions, 7239 flow [2023-08-27 10:13:42,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-27 10:13:42,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-27 10:13:42,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 865 transitions. [2023-08-27 10:13:42,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49231644849174727 [2023-08-27 10:13:42,983 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 865 transitions. [2023-08-27 10:13:42,983 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 865 transitions. [2023-08-27 10:13:42,983 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:42,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 865 transitions. [2023-08-27 10:13:42,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 123.57142857142857) internal successors, (865), 7 states have internal predecessors, (865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:42,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:42,987 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 251.0) internal successors, (2008), 8 states have internal predecessors, (2008), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:42,987 INFO L175 Difference]: Start difference. First operand has 123 places, 273 transitions, 4813 flow. Second operand 7 states and 865 transitions. [2023-08-27 10:13:42,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 417 transitions, 7239 flow [2023-08-27 10:13:48,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 417 transitions, 6927 flow, removed 51 selfloop flow, removed 1 redundant places. [2023-08-27 10:13:48,578 INFO L231 Difference]: Finished difference. Result has 131 places, 216 transitions, 3506 flow [2023-08-27 10:13:48,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=3398, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3506, PETRI_PLACES=131, PETRI_TRANSITIONS=216} [2023-08-27 10:13:48,578 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 79 predicate places. [2023-08-27 10:13:48,578 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 216 transitions, 3506 flow [2023-08-27 10:13:48,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:48,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:13:48,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:13:48,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-27 10:13:48,579 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:13:48,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:13:48,579 INFO L85 PathProgramCache]: Analyzing trace with hash 381525846, now seen corresponding path program 1 times [2023-08-27 10:13:48,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:13:48,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593027830] [2023-08-27 10:13:48,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:13:48,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:13:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:13:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:13:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:13:48,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593027830] [2023-08-27 10:13:48,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593027830] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:13:48,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:13:48,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-27 10:13:48,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330898736] [2023-08-27 10:13:48,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:13:48,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:13:48,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:13:48,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:13:48,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:13:48,763 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-27 10:13:48,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 216 transitions, 3506 flow. Second operand has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:48,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:13:48,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-27 10:13:48,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:13:54,381 INFO L124 PetriNetUnfolderBase]: 27377/41295 cut-off events. [2023-08-27 10:13:54,382 INFO L125 PetriNetUnfolderBase]: For 269793/273288 co-relation queries the response was YES. [2023-08-27 10:13:54,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194657 conditions, 41295 events. 27377/41295 cut-off events. For 269793/273288 co-relation queries the response was YES. Maximal size of possible extension queue 2183. Compared 308634 event pairs, 1665 based on Foata normal form. 2034/41439 useless extension candidates. Maximal degree in co-relation 194595. Up to 11506 conditions per place. [2023-08-27 10:13:54,757 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 331 selfloop transitions, 32 changer transitions 4/407 dead transitions. [2023-08-27 10:13:54,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 407 transitions, 6601 flow [2023-08-27 10:13:54,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:13:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:13:54,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1109 transitions. [2023-08-27 10:13:54,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4909251881363435 [2023-08-27 10:13:54,759 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1109 transitions. [2023-08-27 10:13:54,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1109 transitions. [2023-08-27 10:13:54,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:13:54,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1109 transitions. [2023-08-27 10:13:54,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.22222222222223) internal successors, (1109), 9 states have internal predecessors, (1109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:54,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:54,765 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:13:54,765 INFO L175 Difference]: Start difference. First operand has 131 places, 216 transitions, 3506 flow. Second operand 9 states and 1109 transitions. [2023-08-27 10:13:54,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 407 transitions, 6601 flow [2023-08-27 10:14:05,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 407 transitions, 6367 flow, removed 76 selfloop flow, removed 8 redundant places. [2023-08-27 10:14:05,661 INFO L231 Difference]: Finished difference. Result has 129 places, 162 transitions, 2390 flow [2023-08-27 10:14:05,661 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2266, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=156, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2390, PETRI_PLACES=129, PETRI_TRANSITIONS=162} [2023-08-27 10:14:05,662 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 77 predicate places. [2023-08-27 10:14:05,662 INFO L495 AbstractCegarLoop]: Abstraction has has 129 places, 162 transitions, 2390 flow [2023-08-27 10:14:05,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.16666666666667) internal successors, (661), 6 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:05,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:14:05,662 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:14:05,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-27 10:14:05,662 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:14:05,663 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:14:05,663 INFO L85 PathProgramCache]: Analyzing trace with hash -2131956766, now seen corresponding path program 1 times [2023-08-27 10:14:05,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:14:05,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613600441] [2023-08-27 10:14:05,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:14:05,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:14:05,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:14:05,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:14:05,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:14:05,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613600441] [2023-08-27 10:14:05,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613600441] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:14:05,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:14:05,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-27 10:14:05,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741053272] [2023-08-27 10:14:05,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:14:05,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-27 10:14:05,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:14:05,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-27 10:14:05,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-27 10:14:05,770 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 251 [2023-08-27 10:14:05,770 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 162 transitions, 2390 flow. Second operand has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 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 10:14:05,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:14:05,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 251 [2023-08-27 10:14:05,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:14:11,220 INFO L124 PetriNetUnfolderBase]: 27270/40891 cut-off events. [2023-08-27 10:14:11,220 INFO L125 PetriNetUnfolderBase]: For 284216/287577 co-relation queries the response was YES. [2023-08-27 10:14:11,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 206973 conditions, 40891 events. 27270/40891 cut-off events. For 284216/287577 co-relation queries the response was YES. Maximal size of possible extension queue 2187. Compared 300415 event pairs, 4776 based on Foata normal form. 1096/40814 useless extension candidates. Maximal degree in co-relation 206910. Up to 15628 conditions per place. [2023-08-27 10:14:11,518 INFO L140 encePairwiseOnDemand]: 242/251 looper letters, 114 selfloop transitions, 23 changer transitions 129/283 dead transitions. [2023-08-27 10:14:11,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 283 transitions, 4556 flow [2023-08-27 10:14:11,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-27 10:14:11,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-27 10:14:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 748 transitions. [2023-08-27 10:14:11,520 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49667994687915007 [2023-08-27 10:14:11,520 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 748 transitions. [2023-08-27 10:14:11,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 748 transitions. [2023-08-27 10:14:11,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:14:11,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 748 transitions. [2023-08-27 10:14:11,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 124.66666666666667) internal successors, (748), 6 states have internal predecessors, (748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:11,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:11,523 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 251.0) internal successors, (1757), 7 states have internal predecessors, (1757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:11,523 INFO L175 Difference]: Start difference. First operand has 129 places, 162 transitions, 2390 flow. Second operand 6 states and 748 transitions. [2023-08-27 10:14:11,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 283 transitions, 4556 flow [2023-08-27 10:14:26,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 283 transitions, 4489 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-08-27 10:14:26,358 INFO L231 Difference]: Finished difference. Result has 123 places, 84 transitions, 1081 flow [2023-08-27 10:14:26,358 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=2294, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1081, PETRI_PLACES=123, PETRI_TRANSITIONS=84} [2023-08-27 10:14:26,358 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 71 predicate places. [2023-08-27 10:14:26,358 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 84 transitions, 1081 flow [2023-08-27 10:14:26,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 112.5) internal successors, (675), 6 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 10:14:26,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:14:26,359 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:14:26,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-27 10:14:26,359 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:14:26,359 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:14:26,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1503787450, now seen corresponding path program 1 times [2023-08-27 10:14:26,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:14:26,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548609874] [2023-08-27 10:14:26,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:14:26,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:14:26,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:14:26,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:14:26,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:14:26,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548609874] [2023-08-27 10:14:26,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548609874] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:14:26,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:14:26,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-27 10:14:26,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691329964] [2023-08-27 10:14:26,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:14:26,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-27 10:14:26,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:14:26,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-27 10:14:26,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-27 10:14:26,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 251 [2023-08-27 10:14:26,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 84 transitions, 1081 flow. Second operand has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:26,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:14:26,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 251 [2023-08-27 10:14:26,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:14:29,412 INFO L124 PetriNetUnfolderBase]: 15688/24202 cut-off events. [2023-08-27 10:14:29,412 INFO L125 PetriNetUnfolderBase]: For 145367/147427 co-relation queries the response was YES. [2023-08-27 10:14:29,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110721 conditions, 24202 events. 15688/24202 cut-off events. For 145367/147427 co-relation queries the response was YES. Maximal size of possible extension queue 1562. Compared 183606 event pairs, 981 based on Foata normal form. 614/23732 useless extension candidates. Maximal degree in co-relation 110659. Up to 7453 conditions per place. [2023-08-27 10:14:29,554 INFO L140 encePairwiseOnDemand]: 243/251 looper letters, 53 selfloop transitions, 17 changer transitions 177/250 dead transitions. [2023-08-27 10:14:29,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 250 transitions, 3491 flow [2023-08-27 10:14:29,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-27 10:14:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-27 10:14:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1308 transitions. [2023-08-27 10:14:29,557 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4737413980441869 [2023-08-27 10:14:29,557 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1308 transitions. [2023-08-27 10:14:29,557 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1308 transitions. [2023-08-27 10:14:29,557 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:14:29,557 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1308 transitions. [2023-08-27 10:14:29,559 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 118.9090909090909) internal successors, (1308), 11 states have internal predecessors, (1308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:29,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 251.0) internal successors, (3012), 12 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:29,562 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 251.0) internal successors, (3012), 12 states have internal predecessors, (3012), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:29,562 INFO L175 Difference]: Start difference. First operand has 123 places, 84 transitions, 1081 flow. Second operand 11 states and 1308 transitions. [2023-08-27 10:14:29,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 250 transitions, 3491 flow [2023-08-27 10:14:35,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 250 transitions, 3120 flow, removed 81 selfloop flow, removed 26 redundant places. [2023-08-27 10:14:35,026 INFO L231 Difference]: Finished difference. Result has 97 places, 40 transitions, 321 flow [2023-08-27 10:14:35,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=867, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=321, PETRI_PLACES=97, PETRI_TRANSITIONS=40} [2023-08-27 10:14:35,026 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 45 predicate places. [2023-08-27 10:14:35,026 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 40 transitions, 321 flow [2023-08-27 10:14:35,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.14285714285714) internal successors, (771), 7 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:35,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:14:35,027 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:14:35,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-27 10:14:35,027 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:14:35,027 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:14:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash 739597991, now seen corresponding path program 1 times [2023-08-27 10:14:35,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:14:35,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938886212] [2023-08-27 10:14:35,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:14:35,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:14:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:14:36,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:14:36,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:14:36,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938886212] [2023-08-27 10:14:36,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938886212] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:14:36,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:14:36,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:14:36,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751672059] [2023-08-27 10:14:36,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:14:36,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:14:36,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:14:36,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:14:36,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:14:36,020 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 251 [2023-08-27 10:14:36,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 40 transitions, 321 flow. Second operand has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:36,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:14:36,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 251 [2023-08-27 10:14:36,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:14:36,420 INFO L124 PetriNetUnfolderBase]: 705/1126 cut-off events. [2023-08-27 10:14:36,420 INFO L125 PetriNetUnfolderBase]: For 4212/4212 co-relation queries the response was YES. [2023-08-27 10:14:36,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4854 conditions, 1126 events. 705/1126 cut-off events. For 4212/4212 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4375 event pairs, 51 based on Foata normal form. 1/1127 useless extension candidates. Maximal degree in co-relation 4811. Up to 323 conditions per place. [2023-08-27 10:14:36,424 INFO L140 encePairwiseOnDemand]: 238/251 looper letters, 60 selfloop transitions, 11 changer transitions 52/123 dead transitions. [2023-08-27 10:14:36,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 123 transitions, 1096 flow [2023-08-27 10:14:36,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:14:36,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:14:36,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 907 transitions. [2023-08-27 10:14:36,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40150509074811863 [2023-08-27 10:14:36,427 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 907 transitions. [2023-08-27 10:14:36,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 907 transitions. [2023-08-27 10:14:36,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:14:36,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 907 transitions. [2023-08-27 10:14:36,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.77777777777777) internal successors, (907), 9 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:36,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:36,431 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:36,431 INFO L175 Difference]: Start difference. First operand has 97 places, 40 transitions, 321 flow. Second operand 9 states and 907 transitions. [2023-08-27 10:14:36,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 123 transitions, 1096 flow [2023-08-27 10:14:36,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 123 transitions, 745 flow, removed 33 selfloop flow, removed 37 redundant places. [2023-08-27 10:14:36,437 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 224 flow [2023-08-27 10:14:36,437 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=224, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2023-08-27 10:14:36,437 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 11 predicate places. [2023-08-27 10:14:36,438 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 224 flow [2023-08-27 10:14:36,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:36,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:14:36,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:14:36,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-27 10:14:36,438 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:14:36,438 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:14:36,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1059596515, now seen corresponding path program 2 times [2023-08-27 10:14:36,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:14:36,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167242535] [2023-08-27 10:14:36,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:14:36,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:14:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-27 10:14:37,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-27 10:14:37,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-27 10:14:37,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167242535] [2023-08-27 10:14:37,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167242535] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-27 10:14:37,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-27 10:14:37,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-08-27 10:14:37,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588415790] [2023-08-27 10:14:37,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-27 10:14:37,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-08-27 10:14:37,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-27 10:14:37,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-08-27 10:14:37,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-08-27 10:14:37,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 251 [2023-08-27 10:14:37,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 224 flow. Second operand has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:37,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-27 10:14:37,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 251 [2023-08-27 10:14:37,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-27 10:14:37,639 INFO L124 PetriNetUnfolderBase]: 530/895 cut-off events. [2023-08-27 10:14:37,639 INFO L125 PetriNetUnfolderBase]: For 1170/1170 co-relation queries the response was YES. [2023-08-27 10:14:37,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3201 conditions, 895 events. 530/895 cut-off events. For 1170/1170 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3716 event pairs, 27 based on Foata normal form. 1/896 useless extension candidates. Maximal degree in co-relation 3185. Up to 195 conditions per place. [2023-08-27 10:14:37,642 INFO L140 encePairwiseOnDemand]: 237/251 looper letters, 98 selfloop transitions, 16 changer transitions 27/141 dead transitions. [2023-08-27 10:14:37,642 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 141 transitions, 992 flow [2023-08-27 10:14:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-27 10:14:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-27 10:14:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 902 transitions. [2023-08-27 10:14:37,643 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39929172200088536 [2023-08-27 10:14:37,643 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 902 transitions. [2023-08-27 10:14:37,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 902 transitions. [2023-08-27 10:14:37,644 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-27 10:14:37,644 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 902 transitions. [2023-08-27 10:14:37,645 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 100.22222222222223) internal successors, (902), 9 states have internal predecessors, (902), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:37,646 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:37,646 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 251.0) internal successors, (2510), 10 states have internal predecessors, (2510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:37,647 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 224 flow. Second operand 9 states and 902 transitions. [2023-08-27 10:14:37,647 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 141 transitions, 992 flow [2023-08-27 10:14:37,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 141 transitions, 964 flow, removed 11 selfloop flow, removed 5 redundant places. [2023-08-27 10:14:37,651 INFO L231 Difference]: Finished difference. Result has 67 places, 51 transitions, 296 flow [2023-08-27 10:14:37,651 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=251, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=296, PETRI_PLACES=67, PETRI_TRANSITIONS=51} [2023-08-27 10:14:37,651 INFO L281 CegarLoopForPetriNet]: 52 programPoint places, 15 predicate places. [2023-08-27 10:14:37,651 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 51 transitions, 296 flow [2023-08-27 10:14:37,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 94.11111111111111) internal successors, (847), 9 states have internal predecessors, (847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-27 10:14:37,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-27 10:14:37,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:14:37,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-27 10:14:37,652 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONASSERT === [P0Err0ASSERT_VIOLATIONASSERT, P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2023-08-27 10:14:37,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-27 10:14:37,652 INFO L85 PathProgramCache]: Analyzing trace with hash -285332405, now seen corresponding path program 3 times [2023-08-27 10:14:37,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-27 10:14:37,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297819477] [2023-08-27 10:14:37,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-27 10:14:37,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-27 10:14:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:14:37,697 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-27 10:14:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-27 10:14:37,794 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-27 10:14:37,794 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-27 10:14:37,795 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONASSERT (22 of 23 remaining) [2023-08-27 10:14:37,796 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (21 of 23 remaining) [2023-08-27 10:14:37,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 23 remaining) [2023-08-27 10:14:37,797 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 23 remaining) [2023-08-27 10:14:37,798 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 23 remaining) [2023-08-27 10:14:37,799 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONASSERT (8 of 23 remaining) [2023-08-27 10:14:37,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 23 remaining) [2023-08-27 10:14:37,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 23 remaining) [2023-08-27 10:14:37,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 23 remaining) [2023-08-27 10:14:37,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 23 remaining) [2023-08-27 10:14:37,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 23 remaining) [2023-08-27 10:14:37,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 23 remaining) [2023-08-27 10:14:37,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 23 remaining) [2023-08-27 10:14:37,800 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 23 remaining) [2023-08-27 10:14:37,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-08-27 10:14:37,801 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-27 10:14:37,805 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-27 10:14:37,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-27 10:14:37,909 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.08 10:14:37 BasicIcfg [2023-08-27 10:14:37,910 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-27 10:14:37,910 INFO L158 Benchmark]: Toolchain (without parser) took 194074.04ms. Allocated memory was 362.8MB in the beginning and 15.9GB in the end (delta: 15.5GB). Free memory was 337.1MB in the beginning and 14.8GB in the end (delta: -14.5GB). Peak memory consumption was 1.0GB. Max. memory is 16.0GB. [2023-08-27 10:14:37,910 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 362.8MB. Free memory is still 340.4MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-27 10:14:37,910 INFO L158 Benchmark]: CACSL2BoogieTranslator took 500.69ms. Allocated memory is still 362.8MB. Free memory was 337.1MB in the beginning and 313.3MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-27 10:14:37,910 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.18ms. Allocated memory is still 362.8MB. Free memory was 312.8MB in the beginning and 310.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:14:37,910 INFO L158 Benchmark]: Boogie Preprocessor took 26.59ms. Allocated memory is still 362.8MB. Free memory was 310.7MB in the beginning and 308.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-27 10:14:37,911 INFO L158 Benchmark]: RCFGBuilder took 704.15ms. Allocated memory is still 362.8MB. Free memory was 308.6MB in the beginning and 265.9MB in the end (delta: 42.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. [2023-08-27 10:14:37,911 INFO L158 Benchmark]: TraceAbstraction took 192787.12ms. Allocated memory was 362.8MB in the beginning and 15.9GB in the end (delta: 15.5GB). Free memory was 265.1MB in the beginning and 14.8GB in the end (delta: -14.6GB). Peak memory consumption was 957.3MB. Max. memory is 16.0GB. [2023-08-27 10:14:37,911 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.15ms. Allocated memory is still 362.8MB. Free memory is still 340.4MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 500.69ms. Allocated memory is still 362.8MB. Free memory was 337.1MB in the beginning and 313.3MB in the end (delta: 23.9MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 48.18ms. Allocated memory is still 362.8MB. Free memory was 312.8MB in the beginning and 310.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 26.59ms. Allocated memory is still 362.8MB. Free memory was 310.7MB in the beginning and 308.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 704.15ms. Allocated memory is still 362.8MB. Free memory was 308.6MB in the beginning and 265.9MB in the end (delta: 42.7MB). Peak memory consumption was 44.0MB. Max. memory is 16.0GB. * TraceAbstraction took 192787.12ms. Allocated memory was 362.8MB in the beginning and 15.9GB in the end (delta: 15.5GB). Free memory was 265.1MB in the beginning and 14.8GB in the end (delta: -14.6GB). Peak memory consumption was 957.3MB. 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.9s, 145 PlacesBefore, 52 PlacesAfterwards, 135 TransitionsBefore, 40 TransitionsAfterwards, 4414 CoEnabledTransitionPairs, 7 FixpointIterations, 40 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 17 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 16842 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4840, independent: 4475, independent conditional: 0, independent unconditional: 4475, dependent: 365, dependent conditional: 0, dependent unconditional: 365, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2352, independent: 2283, independent conditional: 0, independent unconditional: 2283, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4840, independent: 2192, independent conditional: 0, independent unconditional: 2192, dependent: 296, dependent conditional: 0, dependent unconditional: 296, unknown: 2352, unknown conditional: 0, unknown unconditional: 2352] , Statistics on independence cache: Total cache size (in pairs): 234, Positive cache size: 204, Positive conditional cache size: 0, Positive unconditional cache size: 204, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 17]: assertion can be violated assertion can be violated We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int a = 0; [L715] 0 _Bool a$flush_delayed; [L716] 0 int a$mem_tmp; [L717] 0 _Bool a$r_buff0_thd0; [L718] 0 _Bool a$r_buff0_thd1; [L719] 0 _Bool a$r_buff0_thd2; [L720] 0 _Bool a$r_buff0_thd3; [L721] 0 _Bool a$r_buff0_thd4; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$r_buff1_thd4; [L727] 0 _Bool a$read_delayed; [L728] 0 int *a$read_delayed_var; [L729] 0 int a$w_buff0; [L730] 0 _Bool a$w_buff0_used; [L731] 0 int a$w_buff1; [L732] 0 _Bool a$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L857] 0 pthread_t t1513; [L858] FCALL, FORK 0 pthread_create(&t1513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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(&t1513, ((void *)0), P0, ((void *)0))=-3, t1513={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L859] 0 pthread_t t1514; [L860] FCALL, FORK 0 pthread_create(&t1514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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(&t1514, ((void *)0), P1, ((void *)0))=-2, t1513={5:0}, t1514={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1515; [L862] FCALL, FORK 0 pthread_create(&t1515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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(&t1515, ((void *)0), P2, ((void *)0))=-1, t1513={5:0}, t1514={6:0}, t1515={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1516; [L864] FCALL, FORK 0 pthread_create(&t1516, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1516, ((void *)0), P3, ((void *)0))=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L746] 1 a$w_buff1 = a$w_buff0 [L747] 1 a$w_buff0 = 1 [L748] 1 a$w_buff1_used = a$w_buff0_used [L749] 1 a$w_buff0_used = (_Bool)1 [L750] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L750] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L751] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L752] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L753] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L754] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L755] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L756] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, 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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, 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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=0, z=0] [L779] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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] [L789] EXPR 2 __unbuffered_cnt + 1 [L789] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L791] 2 return 0; [L796] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L799] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L802] 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) [L803] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L804] 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 [L805] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L806] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L809] EXPR 3 __unbuffered_cnt + 1 [L809] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L811] 3 return 0; [L816] 4 z = 2 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2] [L819] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L820] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L821] 4 a$flush_delayed = weak$$choice2 [L822] 4 a$mem_tmp = a [L823] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L824] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L825] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L826] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L827] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L828] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L829] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 __unbuffered_p3_EAX = a [L831] 4 a = a$flush_delayed ? a$mem_tmp : a [L832] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L835] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L836] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L837] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L838] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L839] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] [L769] EXPR 1 __unbuffered_cnt + 1 [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L842] EXPR 4 __unbuffered_cnt + 1 [L842] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L844] 4 return 0; [L866] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L868] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L868] RET 0 assume_abort_if_not(main$tmp_guard0) [L870] 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) [L871] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L872] 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 [L873] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L874] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, t1513={5:0}, t1514={6:0}, t1515={7:0}, t1516={3:0}, weak$$choice2=0, x=2, y=2, z=2] [L877] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 0) [L879] 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", "mix057_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\read(__PRETTY_FUNCTION__)={49:50}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=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_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=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=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z=2] - 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: 809]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 842]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 862]: 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: 858]: 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: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 182 locations, 23 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 192.5s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 183.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1173 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1173 mSDsluCounter, 147 SdHoareTripleChecker+Invalid, 2.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 127 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2941 IncrementalHoareTripleChecker+Invalid, 3068 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 127 mSolverCounterUnsat, 65 mSDtfsCounter, 2941 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4813occurred in iteration=13, InterpolantAutomatonStates: 117, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 333 NumberOfCodeBlocks, 333 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 286 ConstructedInterpolants, 0 QuantifiedInterpolants, 2119 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-08-27 10:14:37,931 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...