/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.order.of.the.error.locations.to.be.checked PROGRAM_FIRST -tc /storage/repos/CAV22/benchmarks/AutomizerCInline.xml -i /storage/repos/CAV22/benchmarks/increased_bounds/weaver_bench-exp1x3.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 08:08:00,456 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 08:08:00,528 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 08:08:00,535 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 08:08:00,535 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 08:08:00,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 08:08:00,536 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 08:08:00,572 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 08:08:00,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 08:08:00,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 08:08:00,577 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 08:08:00,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 08:08:00,578 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 08:08:00,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 08:08:00,579 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 08:08:00,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 08:08:00,580 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 08:08:00,580 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 08:08:00,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 08:08:00,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 08:08:00,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 08:08:00,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 08:08:00,581 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 08:08:00,581 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 08:08:00,582 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 08:08:00,582 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 08:08:00,583 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 08:08:00,583 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 08:08:00,583 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 08:08:00,584 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 08:08:00,584 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 08:08:00,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 08:08:00,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 08:08:00,585 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 08:08:00,585 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 08:08:00,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 08:08:00,585 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 08:08:00,585 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 08:08:00,586 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 08:08:00,586 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 08:08:00,586 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 08:08:00,586 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-08-04 08:08:00,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 08:08:00,870 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 08:08:00,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 08:08:00,874 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 08:08:00,874 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 08:08:00,875 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_bench-exp1x3.wvr_bound2.c [2023-08-04 08:08:02,029 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 08:08:02,207 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 08:08:02,209 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_bench-exp1x3.wvr_bound2.c [2023-08-04 08:08:02,216 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554f159ee/1c7e0b54917c4c7daf72eb5cc648f74b/FLAG7cab5d65c [2023-08-04 08:08:02,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/554f159ee/1c7e0b54917c4c7daf72eb5cc648f74b [2023-08-04 08:08:02,235 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 08:08:02,237 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 08:08:02,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 08:08:02,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 08:08:02,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 08:08:02,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,244 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b38253 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02, skipping insertion in model container [2023-08-04 08:08:02,244 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,266 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 08:08:02,435 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_bench-exp1x3.wvr_bound2.c[2011,2024] [2023-08-04 08:08:02,436 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 08:08:02,445 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 08:08:02,464 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/CAV22/benchmarks/increased_bounds/weaver_bench-exp1x3.wvr_bound2.c[2011,2024] [2023-08-04 08:08:02,465 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 08:08:02,477 INFO L206 MainTranslator]: Completed translation [2023-08-04 08:08:02,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02 WrapperNode [2023-08-04 08:08:02,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 08:08:02,478 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 08:08:02,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 08:08:02,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 08:08:02,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,499 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,525 INFO L138 Inliner]: procedures = 18, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 92 [2023-08-04 08:08:02,525 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 08:08:02,526 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 08:08:02,526 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 08:08:02,526 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 08:08:02,533 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,534 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,557 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,560 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,565 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,566 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,567 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 08:08:02,568 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 08:08:02,568 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 08:08:02,568 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 08:08:02,569 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (1/1) ... [2023-08-04 08:08:02,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 08:08:02,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:02,602 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-04 08:08:02,608 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-04 08:08:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 08:08:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 08:08:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 08:08:02,636 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 08:08:02,636 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 08:08:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 08:08:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 08:08:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 08:08:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 08:08:02,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 08:08:02,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 08:08:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 08:08:02,640 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-04 08:08:02,749 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 08:08:02,751 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 08:08:02,983 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 08:08:02,989 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 08:08:02,989 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-08-04 08:08:02,991 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 08:08:02 BoogieIcfgContainer [2023-08-04 08:08:02,991 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 08:08:02,993 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 08:08:02,993 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 08:08:02,995 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 08:08:02,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 08:08:02" (1/3) ... [2023-08-04 08:08:02,996 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6380fac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 08:08:02, skipping insertion in model container [2023-08-04 08:08:02,996 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 08:08:02" (2/3) ... [2023-08-04 08:08:02,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6380fac4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 08:08:02, skipping insertion in model container [2023-08-04 08:08:02,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 08:08:02" (3/3) ... [2023-08-04 08:08:03,000 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_bench-exp1x3.wvr_bound2.c [2023-08-04 08:08:03,007 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 08:08:03,015 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 08:08:03,016 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 08:08:03,016 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 08:08:03,098 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-04 08:08:03,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:03,239 INFO L124 PetriNetUnfolderBase]: 33/243 cut-off events. [2023-08-04 08:08:03,239 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 08:08:03,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 243 events. 33/243 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 736 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 08:08:03,246 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:03,252 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:03,255 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 08:08:03,289 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:03,291 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:03,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:03,344 INFO L124 PetriNetUnfolderBase]: 33/243 cut-off events. [2023-08-04 08:08:03,345 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 08:08:03,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 243 events. 33/243 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 736 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 08:08:03,351 INFO L119 LiptonReduction]: Number of co-enabled transitions 1392 [2023-08-04 08:08:05,417 INFO L134 LiptonReduction]: Checked pairs total: 1922 [2023-08-04 08:08:05,417 INFO L136 LiptonReduction]: Total number of compositions: 92 [2023-08-04 08:08:05,428 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 08:08:05,434 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=true, 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;@623e1261, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 08:08:05,434 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 08:08:05,438 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 08:08:05,438 INFO L124 PetriNetUnfolderBase]: 2/15 cut-off events. [2023-08-04 08:08:05,438 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 08:08:05,438 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:05,439 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 08:08:05,439 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:05,443 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:05,443 INFO L85 PathProgramCache]: Analyzing trace with hash 388896772, now seen corresponding path program 1 times [2023-08-04 08:08:05,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:05,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996056312] [2023-08-04 08:08:05,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:05,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:05,603 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-04 08:08:05,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:05,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996056312] [2023-08-04 08:08:05,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996056312] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:05,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:08:05,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 08:08:05,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027229449] [2023-08-04 08:08:05,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:05,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:05,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:05,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:05,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 08:08:05,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-08-04 08:08:05,659 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:05,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:05,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-08-04 08:08:05,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:05,723 INFO L124 PetriNetUnfolderBase]: 108/203 cut-off events. [2023-08-04 08:08:05,724 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-04 08:08:05,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 203 events. 108/203 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 597 event pairs, 21 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 308. Up to 183 conditions per place. [2023-08-04 08:08:05,726 INFO L140 encePairwiseOnDemand]: 195/199 looper letters, 23 selfloop transitions, 2 changer transitions 3/30 dead transitions. [2023-08-04 08:08:05,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 30 transitions, 134 flow [2023-08-04 08:08:05,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:05,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:05,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 292 transitions. [2023-08-04 08:08:05,738 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48911222780569513 [2023-08-04 08:08:05,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 292 transitions. [2023-08-04 08:08:05,738 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 292 transitions. [2023-08-04 08:08:05,740 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:05,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 292 transitions. [2023-08-04 08:08:05,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:05,749 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:05,749 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:05,751 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 78 flow. Second operand 3 states and 292 transitions. [2023-08-04 08:08:05,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 30 transitions, 134 flow [2023-08-04 08:08:05,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 30 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 08:08:05,754 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 76 flow [2023-08-04 08:08:05,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-04 08:08:05,759 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-08-04 08:08:05,759 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 76 flow [2023-08-04 08:08:05,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:05,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:05,760 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:05,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 08:08:05,760 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:05,760 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:05,761 INFO L85 PathProgramCache]: Analyzing trace with hash 313032223, now seen corresponding path program 1 times [2023-08-04 08:08:05,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:05,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264695438] [2023-08-04 08:08:05,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:05,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:05,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:05,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 08:08:05,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:05,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264695438] [2023-08-04 08:08:05,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264695438] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:05,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057572562] [2023-08-04 08:08:05,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:05,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:05,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:05,893 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:05,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-04 08:08:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:05,955 INFO L262 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:08:05,958 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:05,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 08:08:05,970 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:08:05,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057572562] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:05,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:08:05,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 08:08:05,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91895553] [2023-08-04 08:08:05,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:05,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:05,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:05,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:05,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:05,990 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-08-04 08:08:05,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:05,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:05,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-08-04 08:08:05,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:06,064 INFO L124 PetriNetUnfolderBase]: 106/195 cut-off events. [2023-08-04 08:08:06,065 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-04 08:08:06,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 411 conditions, 195 events. 106/195 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 453 event pairs, 24 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 384. Up to 168 conditions per place. [2023-08-04 08:08:06,066 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 25 selfloop transitions, 2 changer transitions 1/30 dead transitions. [2023-08-04 08:08:06,066 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 30 transitions, 142 flow [2023-08-04 08:08:06,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:06,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-08-04 08:08:06,073 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490787269681742 [2023-08-04 08:08:06,073 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-08-04 08:08:06,074 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-08-04 08:08:06,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:06,077 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-08-04 08:08:06,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,083 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,083 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 76 flow. Second operand 3 states and 293 transitions. [2023-08-04 08:08:06,084 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 30 transitions, 142 flow [2023-08-04 08:08:06,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 30 transitions, 132 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 08:08:06,087 INFO L231 Difference]: Finished difference. Result has 26 places, 25 transitions, 74 flow [2023-08-04 08:08:06,087 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=26, PETRI_TRANSITIONS=25} [2023-08-04 08:08:06,088 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -1 predicate places. [2023-08-04 08:08:06,088 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 25 transitions, 74 flow [2023-08-04 08:08:06,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,088 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:06,088 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:06,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-04 08:08:06,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:06,294 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:06,295 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:06,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1689856470, now seen corresponding path program 1 times [2023-08-04 08:08:06,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:06,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330090472] [2023-08-04 08:08:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:06,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 08:08:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330090472] [2023-08-04 08:08:06,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330090472] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633217531] [2023-08-04 08:08:06,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:06,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:06,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:06,365 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:06,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-04 08:08:06,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:06,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:08:06,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 08:08:06,430 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:08:06,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633217531] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:06,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:08:06,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 08:08:06,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438101170] [2023-08-04 08:08:06,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:06,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:06,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:06,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:06,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:06,455 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-08-04 08:08:06,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 25 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:06,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-08-04 08:08:06,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:06,515 INFO L124 PetriNetUnfolderBase]: 74/143 cut-off events. [2023-08-04 08:08:06,515 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2023-08-04 08:08:06,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 316 conditions, 143 events. 74/143 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 281 event pairs, 24 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 139. Up to 106 conditions per place. [2023-08-04 08:08:06,516 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 29 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-08-04 08:08:06,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 33 transitions, 156 flow [2023-08-04 08:08:06,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:06,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-04 08:08:06,518 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49581239530988275 [2023-08-04 08:08:06,518 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-04 08:08:06,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-04 08:08:06,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:06,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-04 08:08:06,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,526 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,526 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,526 INFO L175 Difference]: Start difference. First operand has 26 places, 25 transitions, 74 flow. Second operand 3 states and 296 transitions. [2023-08-04 08:08:06,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 33 transitions, 156 flow [2023-08-04 08:08:06,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 33 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 08:08:06,530 INFO L231 Difference]: Finished difference. Result has 27 places, 26 transitions, 82 flow [2023-08-04 08:08:06,530 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=27, PETRI_TRANSITIONS=26} [2023-08-04 08:08:06,531 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2023-08-04 08:08:06,531 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 26 transitions, 82 flow [2023-08-04 08:08:06,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.66666666666667) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,532 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:06,532 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:06,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-04 08:08:06,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-08-04 08:08:06,738 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:06,739 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -193676115, now seen corresponding path program 1 times [2023-08-04 08:08:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121303534] [2023-08-04 08:08:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 08:08:06,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121303534] [2023-08-04 08:08:06,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121303534] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:06,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786587667] [2023-08-04 08:08:06,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:06,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:06,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:06,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:06,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-04 08:08:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:06,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:08:06,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:06,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 08:08:06,920 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:08:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786587667] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:06,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:08:06,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 08:08:06,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193009055] [2023-08-04 08:08:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:06,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:06,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:06,941 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 199 [2023-08-04 08:08:06,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 26 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:06,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 199 [2023-08-04 08:08:06,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:06,990 INFO L124 PetriNetUnfolderBase]: 69/136 cut-off events. [2023-08-04 08:08:06,990 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-08-04 08:08:06,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 315 conditions, 136 events. 69/136 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 251 event pairs, 29 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 142. Up to 111 conditions per place. [2023-08-04 08:08:06,991 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 25 selfloop transitions, 2 changer transitions 2/31 dead transitions. [2023-08-04 08:08:06,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 31 transitions, 150 flow [2023-08-04 08:08:06,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:06,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:06,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2023-08-04 08:08:06,993 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.490787269681742 [2023-08-04 08:08:06,993 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 293 transitions. [2023-08-04 08:08:06,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 293 transitions. [2023-08-04 08:08:06,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:06,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 293 transitions. [2023-08-04 08:08:06,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,996 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,996 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 199.0) internal successors, (796), 4 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,996 INFO L175 Difference]: Start difference. First operand has 27 places, 26 transitions, 82 flow. Second operand 3 states and 293 transitions. [2023-08-04 08:08:06,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 31 transitions, 150 flow [2023-08-04 08:08:06,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 31 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:06,998 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 84 flow [2023-08-04 08:08:06,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-04 08:08:06,999 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, 2 predicate places. [2023-08-04 08:08:06,999 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 84 flow [2023-08-04 08:08:06,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:06,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:06,999 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-04 08:08:07,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-04 08:08:07,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:07,206 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:07,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1519543393, now seen corresponding path program 1 times [2023-08-04 08:08:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:07,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574766813] [2023-08-04 08:08:07,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:07,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:07,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 08:08:07,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:07,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574766813] [2023-08-04 08:08:07,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574766813] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:07,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155563176] [2023-08-04 08:08:07,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:07,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:07,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:07,314 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:07,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-04 08:08:07,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:07,377 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:08:07,379 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:07,416 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 08:08:07,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:08:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 08:08:07,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155563176] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:08:07,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:08:07,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 08:08:07,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991078093] [2023-08-04 08:08:07,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:08:07,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:08:07,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:07,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:08:07,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:07,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 199 [2023-08-04 08:08:07,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 84 flow. Second operand has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:07,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:07,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 199 [2023-08-04 08:08:07,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:07,487 INFO L124 PetriNetUnfolderBase]: 5/13 cut-off events. [2023-08-04 08:08:07,487 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 08:08:07,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38 conditions, 13 events. 5/13 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 11 event pairs, 0 based on Foata normal form. 2/12 useless extension candidates. Maximal degree in co-relation 29. Up to 8 conditions per place. [2023-08-04 08:08:07,487 INFO L140 encePairwiseOnDemand]: 196/199 looper letters, 0 selfloop transitions, 0 changer transitions 9/9 dead transitions. [2023-08-04 08:08:07,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 16 places, 9 transitions, 40 flow [2023-08-04 08:08:07,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:08:07,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:08:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2023-08-04 08:08:07,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44974874371859297 [2023-08-04 08:08:07,489 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 358 transitions. [2023-08-04 08:08:07,489 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 358 transitions. [2023-08-04 08:08:07,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:07,489 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 358 transitions. [2023-08-04 08:08:07,490 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:07,491 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:07,492 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 199.0) internal successors, (995), 5 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:07,492 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 84 flow. Second operand 4 states and 358 transitions. [2023-08-04 08:08:07,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 16 places, 9 transitions, 40 flow [2023-08-04 08:08:07,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 15 places, 9 transitions, 38 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:07,492 INFO L231 Difference]: Finished difference. Result has 15 places, 0 transitions, 0 flow [2023-08-04 08:08:07,492 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=199, PETRI_DIFFERENCE_MINUEND_FLOW=14, PETRI_DIFFERENCE_MINUEND_PLACES=12, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=6, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=6, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=15, PETRI_TRANSITIONS=0} [2023-08-04 08:08:07,495 INFO L281 CegarLoopForPetriNet]: 27 programPoint places, -12 predicate places. [2023-08-04 08:08:07,495 INFO L495 AbstractCegarLoop]: Abstraction has has 15 places, 0 transitions, 0 flow [2023-08-04 08:08:07,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.6) internal successors, (458), 5 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:07,498 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 08:08:07,504 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-04 08:08:07,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:07,704 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-04 08:08:07,706 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 08:08:07,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:07,728 INFO L124 PetriNetUnfolderBase]: 33/243 cut-off events. [2023-08-04 08:08:07,728 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 08:08:07,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 243 events. 33/243 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 736 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 08:08:07,730 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:07,731 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:07,731 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 08:08:07,731 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:07,732 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:07,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 98 places, 107 transitions, 236 flow [2023-08-04 08:08:07,754 INFO L124 PetriNetUnfolderBase]: 33/243 cut-off events. [2023-08-04 08:08:07,754 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2023-08-04 08:08:07,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 243 events. 33/243 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 736 event pairs, 0 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 129. Up to 8 conditions per place. [2023-08-04 08:08:07,756 INFO L119 LiptonReduction]: Number of co-enabled transitions 1392 [2023-08-04 08:08:09,563 INFO L134 LiptonReduction]: Checked pairs total: 1916 [2023-08-04 08:08:09,563 INFO L136 LiptonReduction]: Total number of compositions: 93 [2023-08-04 08:08:09,565 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 08:08:09,566 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=true, 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;@623e1261, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 08:08:09,566 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2023-08-04 08:08:09,568 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 08:08:09,568 INFO L124 PetriNetUnfolderBase]: 2/24 cut-off events. [2023-08-04 08:08:09,568 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 08:08:09,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:09,569 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-04 08:08:09,569 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2023-08-04 08:08:09,569 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:09,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1937254316, now seen corresponding path program 1 times [2023-08-04 08:08:09,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:09,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779045844] [2023-08-04 08:08:09,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:09,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:09,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 08:08:09,592 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 08:08:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 08:08:09,632 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 08:08:09,632 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 08:08:09,633 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2023-08-04 08:08:09,633 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2023-08-04 08:08:09,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-04 08:08:09,633 INFO L445 BasicCegarLoop]: Path program histogram: [1] [2023-08-04 08:08:09,634 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN (2/2) [2023-08-04 08:08:09,634 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 08:08:09,634 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 08:08:09,660 INFO L144 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2023-08-04 08:08:09,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 125 transitions, 298 flow [2023-08-04 08:08:09,737 INFO L124 PetriNetUnfolderBase]: 134/798 cut-off events. [2023-08-04 08:08:09,737 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 08:08:09,740 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 798 events. 134/798 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3903 event pairs, 1 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 471. Up to 32 conditions per place. [2023-08-04 08:08:09,741 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 125 transitions, 298 flow [2023-08-04 08:08:09,744 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 125 transitions, 298 flow [2023-08-04 08:08:09,744 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 08:08:09,744 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 125 transitions, 298 flow [2023-08-04 08:08:09,745 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 125 transitions, 298 flow [2023-08-04 08:08:09,745 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 112 places, 125 transitions, 298 flow [2023-08-04 08:08:09,793 INFO L124 PetriNetUnfolderBase]: 134/798 cut-off events. [2023-08-04 08:08:09,794 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-08-04 08:08:09,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 798 events. 134/798 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3903 event pairs, 1 based on Foata normal form. 0/661 useless extension candidates. Maximal degree in co-relation 471. Up to 32 conditions per place. [2023-08-04 08:08:09,805 INFO L119 LiptonReduction]: Number of co-enabled transitions 3312 [2023-08-04 08:08:11,543 INFO L134 LiptonReduction]: Checked pairs total: 9288 [2023-08-04 08:08:11,543 INFO L136 LiptonReduction]: Total number of compositions: 94 [2023-08-04 08:08:11,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 08:08:11,545 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=true, 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;@623e1261, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 08:08:11,545 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 08:08:11,547 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 08:08:11,547 INFO L124 PetriNetUnfolderBase]: 1/15 cut-off events. [2023-08-04 08:08:11,547 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 08:08:11,547 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:11,547 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-04 08:08:11,547 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:11,548 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:11,548 INFO L85 PathProgramCache]: Analyzing trace with hash 701910641, now seen corresponding path program 1 times [2023-08-04 08:08:11,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:11,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088831196] [2023-08-04 08:08:11,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:11,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:11,592 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-04 08:08:11,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:11,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088831196] [2023-08-04 08:08:11,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088831196] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:11,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:08:11,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 08:08:11,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314462294] [2023-08-04 08:08:11,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:11,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:11,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:11,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 08:08:11,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 219 [2023-08-04 08:08:11,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 44 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:11,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:11,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 219 [2023-08-04 08:08:11,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:11,779 INFO L124 PetriNetUnfolderBase]: 1074/1923 cut-off events. [2023-08-04 08:08:11,779 INFO L125 PetriNetUnfolderBase]: For 352/352 co-relation queries the response was YES. [2023-08-04 08:08:11,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3957 conditions, 1923 events. 1074/1923 cut-off events. For 352/352 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 9610 event pairs, 641 based on Foata normal form. 0/1706 useless extension candidates. Maximal degree in co-relation 1499. Up to 1725 conditions per place. [2023-08-04 08:08:11,795 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 30 selfloop transitions, 2 changer transitions 0/46 dead transitions. [2023-08-04 08:08:11,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 46 transitions, 204 flow [2023-08-04 08:08:11,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:11,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 328 transitions. [2023-08-04 08:08:11,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4992389649923896 [2023-08-04 08:08:11,797 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 328 transitions. [2023-08-04 08:08:11,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 328 transitions. [2023-08-04 08:08:11,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:11,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 328 transitions. [2023-08-04 08:08:11,798 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:11,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:11,801 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:11,801 INFO L175 Difference]: Start difference. First operand has 41 places, 44 transitions, 136 flow. Second operand 3 states and 328 transitions. [2023-08-04 08:08:11,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 46 transitions, 204 flow [2023-08-04 08:08:11,805 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 46 transitions, 204 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 08:08:11,806 INFO L231 Difference]: Finished difference. Result has 43 places, 44 transitions, 146 flow [2023-08-04 08:08:11,806 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=43, PETRI_TRANSITIONS=44} [2023-08-04 08:08:11,808 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 2 predicate places. [2023-08-04 08:08:11,808 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 44 transitions, 146 flow [2023-08-04 08:08:11,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:11,808 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:11,808 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:11,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-04 08:08:11,808 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:11,809 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:11,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1700750565, now seen corresponding path program 1 times [2023-08-04 08:08:11,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:11,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859190074] [2023-08-04 08:08:11,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:11,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:11,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 08:08:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859190074] [2023-08-04 08:08:11,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859190074] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:11,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426779535] [2023-08-04 08:08:11,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:11,871 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:11,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:11,873 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:11,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-04 08:08:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:11,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:08:11,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:11,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 08:08:11,943 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:08:11,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426779535] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:11,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:08:11,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 08:08:11,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292347269] [2023-08-04 08:08:11,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:11,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:11,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:11,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:11,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:11,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 219 [2023-08-04 08:08:11,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 44 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:11,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:11,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 219 [2023-08-04 08:08:11,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:12,140 INFO L124 PetriNetUnfolderBase]: 1068/1929 cut-off events. [2023-08-04 08:08:12,140 INFO L125 PetriNetUnfolderBase]: For 287/287 co-relation queries the response was YES. [2023-08-04 08:08:12,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3974 conditions, 1929 events. 1068/1929 cut-off events. For 287/287 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9772 event pairs, 644 based on Foata normal form. 0/1724 useless extension candidates. Maximal degree in co-relation 3946. Up to 1679 conditions per place. [2023-08-04 08:08:12,158 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 33 selfloop transitions, 2 changer transitions 0/49 dead transitions. [2023-08-04 08:08:12,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 49 transitions, 226 flow [2023-08-04 08:08:12,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:12,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:12,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 329 transitions. [2023-08-04 08:08:12,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007610350076104 [2023-08-04 08:08:12,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 329 transitions. [2023-08-04 08:08:12,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 329 transitions. [2023-08-04 08:08:12,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:12,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 329 transitions. [2023-08-04 08:08:12,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,164 INFO L175 Difference]: Start difference. First operand has 43 places, 44 transitions, 146 flow. Second operand 3 states and 329 transitions. [2023-08-04 08:08:12,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 49 transitions, 226 flow [2023-08-04 08:08:12,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:12,167 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 156 flow [2023-08-04 08:08:12,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-04 08:08:12,168 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2023-08-04 08:08:12,168 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 156 flow [2023-08-04 08:08:12,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:12,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:12,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-08-04 08:08:12,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:12,373 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:12,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:12,373 INFO L85 PathProgramCache]: Analyzing trace with hash 559145469, now seen corresponding path program 1 times [2023-08-04 08:08:12,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:12,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677765495] [2023-08-04 08:08:12,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:12,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:12,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-04 08:08:12,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677765495] [2023-08-04 08:08:12,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677765495] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:12,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596251882] [2023-08-04 08:08:12,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:12,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:12,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:12,408 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:12,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-04 08:08:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:12,460 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:08:12,461 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:12,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 08:08:12,469 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:08:12,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596251882] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:12,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:08:12,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2023-08-04 08:08:12,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970896694] [2023-08-04 08:08:12,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:12,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:12,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:12,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:12,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:12,479 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 219 [2023-08-04 08:08:12,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:12,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 219 [2023-08-04 08:08:12,480 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:12,641 INFO L124 PetriNetUnfolderBase]: 978/1815 cut-off events. [2023-08-04 08:08:12,641 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2023-08-04 08:08:12,648 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3839 conditions, 1815 events. 978/1815 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 9278 event pairs, 620 based on Foata normal form. 0/1678 useless extension candidates. Maximal degree in co-relation 1714. Up to 1295 conditions per place. [2023-08-04 08:08:12,656 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 39 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-08-04 08:08:12,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 55 transitions, 270 flow [2023-08-04 08:08:12,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:12,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:12,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-04 08:08:12,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083713850837138 [2023-08-04 08:08:12,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-04 08:08:12,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-04 08:08:12,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:12,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-04 08:08:12,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,660 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,661 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,661 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 156 flow. Second operand 3 states and 334 transitions. [2023-08-04 08:08:12,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 55 transitions, 270 flow [2023-08-04 08:08:12,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 55 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:12,663 INFO L231 Difference]: Finished difference. Result has 47 places, 46 transitions, 166 flow [2023-08-04 08:08:12,663 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=47, PETRI_TRANSITIONS=46} [2023-08-04 08:08:12,664 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2023-08-04 08:08:12,664 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 46 transitions, 166 flow [2023-08-04 08:08:12,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,664 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:12,664 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-04 08:08:12,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-04 08:08:12,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:12,869 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:12,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:12,869 INFO L85 PathProgramCache]: Analyzing trace with hash 55439209, now seen corresponding path program 1 times [2023-08-04 08:08:12,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:12,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266833355] [2023-08-04 08:08:12,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:12,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:12,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-08-04 08:08:12,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:12,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266833355] [2023-08-04 08:08:12,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266833355] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70956561] [2023-08-04 08:08:12,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:12,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:12,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:12,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:12,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-04 08:08:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:12,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 08:08:12,970 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 08:08:12,976 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 08:08:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70956561] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:12,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 08:08:12,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-04 08:08:12,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927389706] [2023-08-04 08:08:12,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:12,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:12,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:12,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:12,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:12,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 219 [2023-08-04 08:08:12,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 46 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:12,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:12,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 219 [2023-08-04 08:08:12,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:13,152 INFO L124 PetriNetUnfolderBase]: 985/1874 cut-off events. [2023-08-04 08:08:13,152 INFO L125 PetriNetUnfolderBase]: For 582/582 co-relation queries the response was YES. [2023-08-04 08:08:13,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4211 conditions, 1874 events. 985/1874 cut-off events. For 582/582 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 9560 event pairs, 675 based on Foata normal form. 0/1834 useless extension candidates. Maximal degree in co-relation 1993. Up to 1281 conditions per place. [2023-08-04 08:08:13,169 INFO L140 encePairwiseOnDemand]: 216/219 looper letters, 40 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-04 08:08:13,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 56 transitions, 282 flow [2023-08-04 08:08:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:13,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:13,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-04 08:08:13,170 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083713850837138 [2023-08-04 08:08:13,170 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-04 08:08:13,170 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-04 08:08:13,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:13,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-04 08:08:13,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:13,173 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:13,173 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:13,173 INFO L175 Difference]: Start difference. First operand has 47 places, 46 transitions, 166 flow. Second operand 3 states and 334 transitions. [2023-08-04 08:08:13,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 56 transitions, 282 flow [2023-08-04 08:08:13,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 280 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:13,176 INFO L231 Difference]: Finished difference. Result has 49 places, 47 transitions, 176 flow [2023-08-04 08:08:13,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=49, PETRI_TRANSITIONS=47} [2023-08-04 08:08:13,177 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2023-08-04 08:08:13,177 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 47 transitions, 176 flow [2023-08-04 08:08:13,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:13,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:13,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:13,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-04 08:08:13,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:13,386 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:13,386 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:13,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1939995993, now seen corresponding path program 1 times [2023-08-04 08:08:13,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686790124] [2023-08-04 08:08:13,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:13,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 08:08:13,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686790124] [2023-08-04 08:08:13,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686790124] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:13,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413118766] [2023-08-04 08:08:13,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:13,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:13,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:13,446 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:13,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-04 08:08:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:13,506 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:08:13,507 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:13,521 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 08:08:13,522 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:08:13,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-08-04 08:08:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413118766] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:08:13,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:08:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 08:08:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163206980] [2023-08-04 08:08:13,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:08:13,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:08:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:13,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:08:13,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:13,556 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-04 08:08:13,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:13,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:13,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-04 08:08:13,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:13,750 INFO L124 PetriNetUnfolderBase]: 877/1662 cut-off events. [2023-08-04 08:08:13,750 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2023-08-04 08:08:13,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 1662 events. 877/1662 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 8283 event pairs, 387 based on Foata normal form. 2/1659 useless extension candidates. Maximal degree in co-relation 2232. Up to 1465 conditions per place. [2023-08-04 08:08:13,765 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 34 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-08-04 08:08:13,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 262 flow [2023-08-04 08:08:13,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:08:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:08:13,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 424 transitions. [2023-08-04 08:08:13,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4840182648401826 [2023-08-04 08:08:13,767 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 424 transitions. [2023-08-04 08:08:13,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 424 transitions. [2023-08-04 08:08:13,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:13,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 424 transitions. [2023-08-04 08:08:13,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:13,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:13,770 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:13,770 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 176 flow. Second operand 4 states and 424 transitions. [2023-08-04 08:08:13,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 262 flow [2023-08-04 08:08:13,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 52 transitions, 260 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:13,778 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 194 flow [2023-08-04 08:08:13,779 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2023-08-04 08:08:13,779 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2023-08-04 08:08:13,779 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 194 flow [2023-08-04 08:08:13,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:13,780 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:13,780 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:13,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-08-04 08:08:13,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-04 08:08:13,985 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:13,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:13,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1813330782, now seen corresponding path program 1 times [2023-08-04 08:08:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:13,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093596491] [2023-08-04 08:08:13,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:13,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:13,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:14,027 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 08:08:14,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:14,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093596491] [2023-08-04 08:08:14,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093596491] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:14,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880957510] [2023-08-04 08:08:14,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:14,028 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:14,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-04 08:08:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:14,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:08:14,088 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:14,098 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 08:08:14,098 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:08:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-08-04 08:08:14,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880957510] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:08:14,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:08:14,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 08:08:14,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855185001] [2023-08-04 08:08:14,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:08:14,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:08:14,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:14,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:08:14,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:14,122 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-04 08:08:14,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:14,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-04 08:08:14,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:14,273 INFO L124 PetriNetUnfolderBase]: 829/1576 cut-off events. [2023-08-04 08:08:14,273 INFO L125 PetriNetUnfolderBase]: For 422/422 co-relation queries the response was YES. [2023-08-04 08:08:14,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3644 conditions, 1576 events. 829/1576 cut-off events. For 422/422 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 7508 event pairs, 368 based on Foata normal form. 8/1579 useless extension candidates. Maximal degree in co-relation 2221. Up to 1253 conditions per place. [2023-08-04 08:08:14,285 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 39 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2023-08-04 08:08:14,286 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 298 flow [2023-08-04 08:08:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:08:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:08:14,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2023-08-04 08:08:14,287 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4885844748858447 [2023-08-04 08:08:14,287 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2023-08-04 08:08:14,288 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2023-08-04 08:08:14,288 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:14,288 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2023-08-04 08:08:14,289 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,290 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,291 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 194 flow. Second operand 4 states and 428 transitions. [2023-08-04 08:08:14,291 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 298 flow [2023-08-04 08:08:14,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 57 transitions, 294 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:14,295 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 210 flow [2023-08-04 08:08:14,296 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=210, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-08-04 08:08:14,296 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2023-08-04 08:08:14,296 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 210 flow [2023-08-04 08:08:14,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:14,297 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:14,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-08-04 08:08:14,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:14,502 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:14,502 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:14,502 INFO L85 PathProgramCache]: Analyzing trace with hash -239452059, now seen corresponding path program 1 times [2023-08-04 08:08:14,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:14,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913799134] [2023-08-04 08:08:14,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:14,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:14,552 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 08:08:14,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:14,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913799134] [2023-08-04 08:08:14,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913799134] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:14,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569258125] [2023-08-04 08:08:14,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:14,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:14,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:14,556 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:14,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-04 08:08:14,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:14,619 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:08:14,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 08:08:14,635 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:08:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-08-04 08:08:14,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569258125] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:08:14,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:08:14,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 08:08:14,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792572081] [2023-08-04 08:08:14,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:08:14,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:08:14,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:14,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:08:14,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:14,661 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-04 08:08:14,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 210 flow. Second operand has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:14,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-04 08:08:14,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:14,794 INFO L124 PetriNetUnfolderBase]: 585/1140 cut-off events. [2023-08-04 08:08:14,794 INFO L125 PetriNetUnfolderBase]: For 526/526 co-relation queries the response was YES. [2023-08-04 08:08:14,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2725 conditions, 1140 events. 585/1140 cut-off events. For 526/526 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4884 event pairs, 251 based on Foata normal form. 32/1167 useless extension candidates. Maximal degree in co-relation 2188. Up to 500 conditions per place. [2023-08-04 08:08:14,803 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 45 selfloop transitions, 4 changer transitions 0/63 dead transitions. [2023-08-04 08:08:14,803 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 63 transitions, 348 flow [2023-08-04 08:08:14,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:08:14,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:08:14,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-08-04 08:08:14,805 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942922374429224 [2023-08-04 08:08:14,805 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-08-04 08:08:14,805 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-08-04 08:08:14,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:14,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-08-04 08:08:14,806 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,808 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,808 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 210 flow. Second operand 4 states and 433 transitions. [2023-08-04 08:08:14,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 63 transitions, 348 flow [2023-08-04 08:08:14,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 344 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:14,811 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 226 flow [2023-08-04 08:08:14,812 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=226, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-08-04 08:08:14,812 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2023-08-04 08:08:14,812 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 226 flow [2023-08-04 08:08:14,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.0) internal successors, (510), 5 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:14,813 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:14,813 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:14,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-04 08:08:15,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 08:08:15,018 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:15,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1682613844, now seen corresponding path program 1 times [2023-08-04 08:08:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137676765] [2023-08-04 08:08:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 08:08:15,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:15,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137676765] [2023-08-04 08:08:15,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137676765] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:15,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1282981246] [2023-08-04 08:08:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:15,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:15,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:15,080 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:15,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-04 08:08:15,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:15,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 08:08:15,148 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 08:08:15,160 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:08:15,172 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 08:08:15,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1282981246] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:08:15,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:08:15,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 08:08:15,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818481204] [2023-08-04 08:08:15,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:08:15,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 08:08:15,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:15,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 08:08:15,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 08:08:15,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-04 08:08:15,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 226 flow. Second operand has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:15,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:15,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-04 08:08:15,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:15,333 INFO L124 PetriNetUnfolderBase]: 581/1129 cut-off events. [2023-08-04 08:08:15,333 INFO L125 PetriNetUnfolderBase]: For 835/835 co-relation queries the response was YES. [2023-08-04 08:08:15,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2954 conditions, 1129 events. 581/1129 cut-off events. For 835/835 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 4815 event pairs, 475 based on Foata normal form. 9/1133 useless extension candidates. Maximal degree in co-relation 2412. Up to 805 conditions per place. [2023-08-04 08:08:15,341 INFO L140 encePairwiseOnDemand]: 215/219 looper letters, 46 selfloop transitions, 3 changer transitions 1/64 dead transitions. [2023-08-04 08:08:15,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 64 transitions, 366 flow [2023-08-04 08:08:15,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:08:15,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:08:15,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 433 transitions. [2023-08-04 08:08:15,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4942922374429224 [2023-08-04 08:08:15,345 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 433 transitions. [2023-08-04 08:08:15,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 433 transitions. [2023-08-04 08:08:15,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:15,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 433 transitions. [2023-08-04 08:08:15,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:15,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:15,350 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:15,350 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 226 flow. Second operand 4 states and 433 transitions. [2023-08-04 08:08:15,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 64 transitions, 366 flow [2023-08-04 08:08:15,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 64 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:15,356 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 236 flow [2023-08-04 08:08:15,356 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2023-08-04 08:08:15,358 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2023-08-04 08:08:15,358 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 236 flow [2023-08-04 08:08:15,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:15,359 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:15,359 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:15,366 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-04 08:08:15,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-08-04 08:08:15,564 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:15,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:15,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1400255505, now seen corresponding path program 1 times [2023-08-04 08:08:15,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:15,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125769551] [2023-08-04 08:08:15,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:15,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:15,794 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 08:08:15,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:15,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125769551] [2023-08-04 08:08:15,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125769551] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:15,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:08:15,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-04 08:08:15,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006542693] [2023-08-04 08:08:15,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:15,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 08:08:15,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 219 [2023-08-04 08:08:15,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:15,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:15,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 219 [2023-08-04 08:08:15,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:16,093 INFO L124 PetriNetUnfolderBase]: 2159/3301 cut-off events. [2023-08-04 08:08:16,094 INFO L125 PetriNetUnfolderBase]: For 1997/1997 co-relation queries the response was YES. [2023-08-04 08:08:16,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8056 conditions, 3301 events. 2159/3301 cut-off events. For 1997/1997 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 14488 event pairs, 544 based on Foata normal form. 1/3297 useless extension candidates. Maximal degree in co-relation 7806. Up to 2016 conditions per place. [2023-08-04 08:08:16,114 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 65 selfloop transitions, 5 changer transitions 9/87 dead transitions. [2023-08-04 08:08:16,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 87 transitions, 581 flow [2023-08-04 08:08:16,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:16,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:16,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 346 transitions. [2023-08-04 08:08:16,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5266362252663622 [2023-08-04 08:08:16,116 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 346 transitions. [2023-08-04 08:08:16,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 346 transitions. [2023-08-04 08:08:16,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:16,116 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 346 transitions. [2023-08-04 08:08:16,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:16,118 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:16,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:16,118 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 236 flow. Second operand 3 states and 346 transitions. [2023-08-04 08:08:16,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 87 transitions, 581 flow [2023-08-04 08:08:16,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 87 transitions, 569 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-08-04 08:08:16,127 INFO L231 Difference]: Finished difference. Result has 66 places, 49 transitions, 233 flow [2023-08-04 08:08:16,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=66, PETRI_TRANSITIONS=49} [2023-08-04 08:08:16,128 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2023-08-04 08:08:16,128 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 49 transitions, 233 flow [2023-08-04 08:08:16,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:16,128 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:16,128 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:16,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-04 08:08:16,128 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:16,129 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:16,129 INFO L85 PathProgramCache]: Analyzing trace with hash -844023012, now seen corresponding path program 1 times [2023-08-04 08:08:16,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:16,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483561916] [2023-08-04 08:08:16,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:16,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 08:08:16,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:16,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483561916] [2023-08-04 08:08:16,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483561916] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:16,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:08:16,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 08:08:16,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912300358] [2023-08-04 08:08:16,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:16,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:16,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:16,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:16,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 08:08:16,203 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-08-04 08:08:16,204 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 49 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:16,204 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:16,204 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-08-04 08:08:16,204 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:16,619 INFO L124 PetriNetUnfolderBase]: 3079/4863 cut-off events. [2023-08-04 08:08:16,619 INFO L125 PetriNetUnfolderBase]: For 3858/3858 co-relation queries the response was YES. [2023-08-04 08:08:16,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13302 conditions, 4863 events. 3079/4863 cut-off events. For 3858/3858 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 24665 event pairs, 1042 based on Foata normal form. 0/4346 useless extension candidates. Maximal degree in co-relation 12990. Up to 2280 conditions per place. [2023-08-04 08:08:16,658 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 66 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2023-08-04 08:08:16,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 82 transitions, 549 flow [2023-08-04 08:08:16,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:16,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2023-08-04 08:08:16,660 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5159817351598174 [2023-08-04 08:08:16,660 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2023-08-04 08:08:16,660 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2023-08-04 08:08:16,661 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:16,661 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2023-08-04 08:08:16,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:16,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:16,663 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:16,663 INFO L175 Difference]: Start difference. First operand has 66 places, 49 transitions, 233 flow. Second operand 3 states and 339 transitions. [2023-08-04 08:08:16,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 82 transitions, 549 flow [2023-08-04 08:08:16,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 82 transitions, 507 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-04 08:08:16,681 INFO L231 Difference]: Finished difference. Result has 60 places, 55 transitions, 270 flow [2023-08-04 08:08:16,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=60, PETRI_TRANSITIONS=55} [2023-08-04 08:08:16,681 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 19 predicate places. [2023-08-04 08:08:16,681 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 55 transitions, 270 flow [2023-08-04 08:08:16,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:16,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:16,682 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:16,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-08-04 08:08:16,682 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:16,682 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:16,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1231839256, now seen corresponding path program 1 times [2023-08-04 08:08:16,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:16,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151091791] [2023-08-04 08:08:16,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:16,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:16,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:16,890 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 08:08:16,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151091791] [2023-08-04 08:08:16,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151091791] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:16,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441654234] [2023-08-04 08:08:16,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:16,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:16,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:16,893 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:16,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-08-04 08:08:16,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:16,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-04 08:08:16,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:17,099 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 08:08:17,099 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:08:17,183 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 08:08:17,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441654234] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:08:17,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:08:17,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2023-08-04 08:08:17,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114353081] [2023-08-04 08:08:17,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:08:17,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 08:08:17,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:17,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 08:08:17,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-04 08:08:17,237 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 219 [2023-08-04 08:08:17,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 55 transitions, 270 flow. Second operand has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:17,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:17,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 219 [2023-08-04 08:08:17,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:18,950 INFO L124 PetriNetUnfolderBase]: 11439/16438 cut-off events. [2023-08-04 08:08:18,952 INFO L125 PetriNetUnfolderBase]: For 20229/20229 co-relation queries the response was YES. [2023-08-04 08:08:19,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51861 conditions, 16438 events. 11439/16438 cut-off events. For 20229/20229 co-relation queries the response was YES. Maximal size of possible extension queue 463. Compared 93525 event pairs, 1035 based on Foata normal form. 304/15793 useless extension candidates. Maximal degree in co-relation 51208. Up to 6567 conditions per place. [2023-08-04 08:08:19,084 INFO L140 encePairwiseOnDemand]: 206/219 looper letters, 208 selfloop transitions, 29 changer transitions 1/242 dead transitions. [2023-08-04 08:08:19,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 242 transitions, 1652 flow [2023-08-04 08:08:19,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 08:08:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 08:08:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 891 transitions. [2023-08-04 08:08:19,087 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5085616438356164 [2023-08-04 08:08:19,087 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 891 transitions. [2023-08-04 08:08:19,087 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 891 transitions. [2023-08-04 08:08:19,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:19,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 891 transitions. [2023-08-04 08:08:19,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.375) internal successors, (891), 8 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:19,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:19,092 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:19,092 INFO L175 Difference]: Start difference. First operand has 60 places, 55 transitions, 270 flow. Second operand 8 states and 891 transitions. [2023-08-04 08:08:19,092 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 242 transitions, 1652 flow [2023-08-04 08:08:19,178 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 242 transitions, 1620 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 08:08:19,181 INFO L231 Difference]: Finished difference. Result has 72 places, 77 transitions, 522 flow [2023-08-04 08:08:19,181 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=522, PETRI_PLACES=72, PETRI_TRANSITIONS=77} [2023-08-04 08:08:19,181 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 31 predicate places. [2023-08-04 08:08:19,182 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 77 transitions, 522 flow [2023-08-04 08:08:19,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.28571428571429) internal successors, (632), 7 states have internal predecessors, (632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:19,182 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:19,182 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:19,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-08-04 08:08:19,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-04 08:08:19,388 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:19,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash 748186480, now seen corresponding path program 1 times [2023-08-04 08:08:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:19,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706128573] [2023-08-04 08:08:19,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:19,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:19,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-08-04 08:08:19,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:19,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706128573] [2023-08-04 08:08:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706128573] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:19,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:08:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 08:08:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307598817] [2023-08-04 08:08:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:19,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 08:08:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 08:08:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 08:08:19,463 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-08-04 08:08:19,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 77 transitions, 522 flow. Second operand has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:19,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:19,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-08-04 08:08:19,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:19,765 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][36], [Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 19#L65-6true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, thread2Thread1of2ForFork0InUse, Black: 392#true, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,766 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,766 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 08:08:19,766 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-04 08:08:19,766 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-04 08:08:19,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 19#L65-6true, Black: 973#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, 3#L38-1true, thread2Thread1of2ForFork0InUse, Black: 392#true, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,766 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,766 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 08:08:19,766 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-04 08:08:19,766 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-04 08:08:19,766 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), 18#L38-1true, Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 22#thread1EXITtrue, 19#L65-6true, Black: 973#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, thread2Thread1of2ForFork0InUse, Black: 392#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,767 INFO L294 olderBase$Statistics]: this new event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,767 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 08:08:19,767 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-04 08:08:19,767 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-08-04 08:08:19,842 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][63], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,843 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,843 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,843 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,843 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][36], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,843 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,843 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,843 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,843 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,844 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,844 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,844 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,844 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,844 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 22#thread1EXITtrue, Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,844 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,844 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,844 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,844 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][36], [Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 76#L65-11true, Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,914 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,914 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 08:08:19,914 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 08:08:19,914 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,914 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][36], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,914 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:19,914 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,914 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,914 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][36], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,915 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,915 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:19,915 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,915 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:19,915 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 76#L65-11true, Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,915 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,915 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 08:08:19,915 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,915 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 08:08:19,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,916 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:19,916 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,916 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,916 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,916 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,916 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,916 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:19,916 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,916 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:19,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 22#thread1EXITtrue, Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), 76#L65-11true, Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,917 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,917 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 08:08:19,917 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-08-04 08:08:19,917 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,917 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 22#thread1EXITtrue, Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,917 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:19,917 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,917 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:19,917 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:19,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 22#thread1EXITtrue, Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,918 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,918 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,918 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:19,918 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:19,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][63], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,924 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,924 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,924 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,924 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,924 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([591] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][36], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,924 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,924 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,924 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,924 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,925 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,925 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,925 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,925 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,925 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 22#thread1EXITtrue, Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:19,925 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:19,925 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,925 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:19,925 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][63], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,007 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,008 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,008 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,008 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,008 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][63], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, 20#L66-8true, Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,008 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,008 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,008 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:20,008 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:20,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,009 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,009 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,009 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,009 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,009 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,009 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,009 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:20,009 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:20,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 22#thread1EXITtrue, Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,010 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,010 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,010 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,010 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,010 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 22#thread1EXITtrue, Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,010 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,010 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,010 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:20,011 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2023-08-04 08:08:20,190 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([597] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][63], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, 20#L66-8true, Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,191 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([597] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][63], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 57#L46-1true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,191 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,191 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([591] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][36], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, 20#L66-8true, Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,192 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([591] L47-->L46-1: Formula: (= (* v_~x2~0_4 2) v_~x2~0_3) InVars {~x2~0=v_~x2~0_4} OutVars{~x2~0=v_~x2~0_3} AuxVars[] AssignedVars[~x2~0][36], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 30#L46-1true, 18#L38-1true, Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 973#true, thread1Thread1of2ForFork1InUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,192 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,192 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,192 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([687] L38-1-->thread1EXIT: Formula: (and (<= (mod v_~n~0_97 4294967296) (mod v_~x1~0_131 4294967296)) (= |v_thread1Thread1of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread1of2ForFork1_#res.base_9| 0)) InVars {~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} OutVars{thread1Thread1of2ForFork1_#res.offset=|v_thread1Thread1of2ForFork1_#res.offset_9|, thread1Thread1of2ForFork1_#res.base=|v_thread1Thread1of2ForFork1_#res.base_9|, ~n~0=v_~n~0_97, ~x1~0=v_~x1~0_131} AuxVars[] AssignedVars[thread1Thread1of2ForFork1_#res.offset, thread1Thread1of2ForFork1_#res.base][8], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, 3#L38-1true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,193 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, 20#L66-8true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 22#thread1EXITtrue, Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,193 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-04 08:08:20,193 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,194 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2023-08-04 08:08:20,194 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([685] L38-1-->thread1EXIT: Formula: (and (= |v_thread1Thread2of2ForFork1_#res.offset_9| 0) (= |v_thread1Thread2of2ForFork1_#res.base_9| 0) (<= (mod v_~n~0_93 4294967296) (mod v_~x1~0_129 4294967296))) InVars {~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} OutVars{thread1Thread2of2ForFork1_#res.offset=|v_thread1Thread2of2ForFork1_#res.offset_9|, thread1Thread2of2ForFork1_#res.base=|v_thread1Thread2of2ForFork1_#res.base_9|, ~n~0=v_~n~0_93, ~x1~0=v_~x1~0_129} AuxVars[] AssignedVars[thread1Thread2of2ForFork1_#res.offset, thread1Thread2of2ForFork1_#res.base][14], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 18#L38-1true, Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 967#true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 22#thread1EXITtrue, Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,194 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,194 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,194 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2023-08-04 08:08:20,194 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,194 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,253 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 20#L66-8true, 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 9#L39true, Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,254 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,254 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,254 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,254 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,254 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 20#L66-8true, 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 9#L39true, Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,254 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,254 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,254 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,254 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,260 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 20#L66-8true, 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 22#thread1EXITtrue, Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,260 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,260 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,260 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,261 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,261 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 20#L66-8true, 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 22#thread1EXITtrue, Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,261 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,261 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,261 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,261 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-04 08:08:20,332 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 9#L39true, Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,332 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 08:08:20,332 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,332 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,332 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 08:08:20,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 9#L39true, Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 52#thread1EXITtrue, thread1Thread1of2ForFork1InUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,333 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 08:08:20,333 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,333 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,333 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 08:08:20,338 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), 22#thread1EXITtrue, Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,338 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 08:08:20,338 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,338 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 08:08:20,338 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,339 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), 22#thread1EXITtrue, Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,339 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-04 08:08:20,339 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,339 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-04 08:08:20,339 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-04 08:08:20,403 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 90#L66-4true, Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 9#L39true, Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1NotInUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,403 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,404 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,404 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,404 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), 90#L66-4true, Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 9#L39true, Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1NotInUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,404 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,404 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,404 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,404 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,407 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), 90#L66-4true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,407 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,407 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,407 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,407 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), 90#L66-4true, Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), Black: 556#true, Black: 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,408 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,408 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,408 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,408 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2023-08-04 08:08:20,572 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 20#L66-8true, 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 9#L39true, Black: 556#true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1NotInUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,572 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 08:08:20,572 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,573 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,573 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 08:08:20,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 20#L66-8true, 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 9#L39true, Black: 556#true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1NotInUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,573 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 08:08:20,573 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 08:08:20,573 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,573 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,575 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 20#L66-8true, 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, Black: 556#true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,575 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 08:08:20,575 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,575 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 08:08:20,575 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,576 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 20#L66-8true, 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, Black: 556#true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,576 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-08-04 08:08:20,576 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,576 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-08-04 08:08:20,576 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-04 08:08:20,616 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 9#L39true, Black: 556#true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1NotInUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,616 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 08:08:20,616 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 08:08:20,616 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 08:08:20,616 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 08:08:20,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, 9#L39true, Black: 556#true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1NotInUse, 38#L47true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,617 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 08:08:20,617 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 08:08:20,617 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 08:08:20,617 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 08:08:20,618 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([594] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][53], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, Black: 556#true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,618 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 08:08:20,618 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 08:08:20,618 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 08:08:20,618 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 08:08:20,619 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([588] L46-1-->L47: Formula: (< (mod v_~x2~0_2 4294967296) (mod v_~n~0_4 4294967296)) InVars {~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} OutVars{~n~0=v_~n~0_4, ~x2~0=v_~x2~0_2} AuxVars[] AssignedVars[][27], [Black: 747#(<= |ULTIMATE.start_main_~asdf~3#1| 1), Black: 188#(<= |ULTIMATE.start_main_~asdf~2#1| 0), 977#(<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))), Black: 255#(<= |ULTIMATE.start_main_~asdf~0#1| 1), Black: 964#(= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))), 84#L66-3true, Black: 969#(< (+ (* (div ~x1~0 4294967296) 4294967296) ~n~0) (+ ~x1~0 (* (div ~n~0 4294967296) 4294967296) 1)), Black: 999#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296))), Black: 1233#(and (< (* (div ~x2~0 4294967296) 4294967296) ~x2~0) (< (mod ~x2~0 4294967296) (mod ~n~0 4294967296)) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 142#(<= |ULTIMATE.start_main_~asdf~1#1| 0), Black: 975#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 1235#(and (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< ~x2~0 (+ (mod ~x1~0 4294967296) (* (div ~x2~0 4294967296) 4294967296) 1))), Black: 976#(and (= (+ (* (div ~x1~0 4294967296) 4294967296) ~x2~0) (+ ~x1~0 (* (div ~x2~0 4294967296) 4294967296))) (<= (+ ~x2~0 (* (div ~n~0 4294967296) 4294967296) 1) (+ ~n~0 (* (div ~x2~0 4294967296) 4294967296))) (< (* (div ~x1~0 4294967296) 4294967296) ~x1~0)), Black: 973#true, Black: 556#true, 80#L47true, Black: 395#(<= |ULTIMATE.start_main_~asdf~1#1| 1), thread2Thread1of2ForFork0InUse, 559#(<= |ULTIMATE.start_main_~asdf~2#1| 1), thread1Thread1of2ForFork1InUse, 38#L47true, 27#L39true, 1244#true, Black: 117#(= 0 |ULTIMATE.start_main_~asdf~0#1|), Black: 249#(<= |ULTIMATE.start_main_~asdf~3#1| 0)]) [2023-08-04 08:08:20,619 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-04 08:08:20,619 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 08:08:20,619 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-04 08:08:20,619 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-08-04 08:08:20,734 INFO L124 PetriNetUnfolderBase]: 7858/12052 cut-off events. [2023-08-04 08:08:20,734 INFO L125 PetriNetUnfolderBase]: For 55555/60955 co-relation queries the response was YES. [2023-08-04 08:08:20,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52862 conditions, 12052 events. 7858/12052 cut-off events. For 55555/60955 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 72493 event pairs, 2167 based on Foata normal form. 1392/12761 useless extension candidates. Maximal degree in co-relation 52263. Up to 6790 conditions per place. [2023-08-04 08:08:20,860 INFO L140 encePairwiseOnDemand]: 213/219 looper letters, 84 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2023-08-04 08:08:20,860 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 106 transitions, 881 flow [2023-08-04 08:08:20,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 08:08:20,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 08:08:20,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2023-08-04 08:08:20,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5083713850837138 [2023-08-04 08:08:20,862 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2023-08-04 08:08:20,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2023-08-04 08:08:20,862 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:20,862 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2023-08-04 08:08:20,863 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:20,864 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:20,864 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:20,864 INFO L175 Difference]: Start difference. First operand has 72 places, 77 transitions, 522 flow. Second operand 3 states and 334 transitions. [2023-08-04 08:08:20,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 106 transitions, 881 flow [2023-08-04 08:08:20,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 106 transitions, 868 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-08-04 08:08:20,923 INFO L231 Difference]: Finished difference. Result has 75 places, 81 transitions, 581 flow [2023-08-04 08:08:20,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=509, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=75, PETRI_TRANSITIONS=81} [2023-08-04 08:08:20,924 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 34 predicate places. [2023-08-04 08:08:20,924 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 81 transitions, 581 flow [2023-08-04 08:08:20,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:20,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:20,925 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:20,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-08-04 08:08:20,925 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:20,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:20,925 INFO L85 PathProgramCache]: Analyzing trace with hash 455809576, now seen corresponding path program 2 times [2023-08-04 08:08:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769030107] [2023-08-04 08:08:20,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:20,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:20,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:21,167 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-08-04 08:08:21,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:21,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769030107] [2023-08-04 08:08:21,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769030107] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 08:08:21,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 08:08:21,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 08:08:21,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449104998] [2023-08-04 08:08:21,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 08:08:21,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-04 08:08:21,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:21,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-04 08:08:21,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-04 08:08:21,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 219 [2023-08-04 08:08:21,216 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 81 transitions, 581 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:21,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:21,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 219 [2023-08-04 08:08:21,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:22,320 INFO L124 PetriNetUnfolderBase]: 9167/13318 cut-off events. [2023-08-04 08:08:22,321 INFO L125 PetriNetUnfolderBase]: For 66033/66033 co-relation queries the response was YES. [2023-08-04 08:08:22,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62636 conditions, 13318 events. 9167/13318 cut-off events. For 66033/66033 co-relation queries the response was YES. Maximal size of possible extension queue 352. Compared 70857 event pairs, 2510 based on Foata normal form. 127/13444 useless extension candidates. Maximal degree in co-relation 62070. Up to 11641 conditions per place. [2023-08-04 08:08:22,429 INFO L140 encePairwiseOnDemand]: 206/219 looper letters, 88 selfloop transitions, 5 changer transitions 38/135 dead transitions. [2023-08-04 08:08:22,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 135 transitions, 1220 flow [2023-08-04 08:08:22,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 08:08:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 08:08:22,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 425 transitions. [2023-08-04 08:08:22,532 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851598173515982 [2023-08-04 08:08:22,532 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 425 transitions. [2023-08-04 08:08:22,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 425 transitions. [2023-08-04 08:08:22,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:22,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 425 transitions. [2023-08-04 08:08:22,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:22,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:22,535 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:22,535 INFO L175 Difference]: Start difference. First operand has 75 places, 81 transitions, 581 flow. Second operand 4 states and 425 transitions. [2023-08-04 08:08:22,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 135 transitions, 1220 flow [2023-08-04 08:08:22,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 135 transitions, 1196 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-08-04 08:08:22,610 INFO L231 Difference]: Finished difference. Result has 78 places, 81 transitions, 596 flow [2023-08-04 08:08:22,610 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=596, PETRI_PLACES=78, PETRI_TRANSITIONS=81} [2023-08-04 08:08:22,611 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 37 predicate places. [2023-08-04 08:08:22,611 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 81 transitions, 596 flow [2023-08-04 08:08:22,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:22,611 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:22,611 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:22,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-08-04 08:08:22,612 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:22,612 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:22,612 INFO L85 PathProgramCache]: Analyzing trace with hash -715099526, now seen corresponding path program 3 times [2023-08-04 08:08:22,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:22,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275761921] [2023-08-04 08:08:22,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:22,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 08:08:22,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275761921] [2023-08-04 08:08:22,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275761921] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:22,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491133645] [2023-08-04 08:08:22,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-04 08:08:22,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:22,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:22,809 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:22,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-08-04 08:08:22,933 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-04 08:08:22,933 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-04 08:08:22,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-04 08:08:22,936 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 08:08:23,077 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:08:23,152 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 08:08:23,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491133645] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:08:23,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:08:23,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2023-08-04 08:08:23,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254511480] [2023-08-04 08:08:23,153 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:08:23,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-04 08:08:23,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:08:23,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-04 08:08:23,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-08-04 08:08:23,196 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 219 [2023-08-04 08:08:23,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 81 transitions, 596 flow. Second operand has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:23,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:08:23,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 219 [2023-08-04 08:08:23,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:08:24,875 INFO L124 PetriNetUnfolderBase]: 11522/16230 cut-off events. [2023-08-04 08:08:24,875 INFO L125 PetriNetUnfolderBase]: For 79370/79370 co-relation queries the response was YES. [2023-08-04 08:08:24,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76110 conditions, 16230 events. 11522/16230 cut-off events. For 79370/79370 co-relation queries the response was YES. Maximal size of possible extension queue 382. Compared 85557 event pairs, 1193 based on Foata normal form. 760/16975 useless extension candidates. Maximal degree in co-relation 75634. Up to 10225 conditions per place. [2023-08-04 08:08:25,004 INFO L140 encePairwiseOnDemand]: 206/219 looper letters, 191 selfloop transitions, 29 changer transitions 0/224 dead transitions. [2023-08-04 08:08:25,004 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 224 transitions, 1970 flow [2023-08-04 08:08:25,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-04 08:08:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-04 08:08:25,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 842 transitions. [2023-08-04 08:08:25,007 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805936073059361 [2023-08-04 08:08:25,007 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 842 transitions. [2023-08-04 08:08:25,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 842 transitions. [2023-08-04 08:08:25,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 08:08:25,007 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 842 transitions. [2023-08-04 08:08:25,009 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 105.25) internal successors, (842), 8 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:25,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:25,012 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:25,012 INFO L175 Difference]: Start difference. First operand has 78 places, 81 transitions, 596 flow. Second operand 8 states and 842 transitions. [2023-08-04 08:08:25,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 224 transitions, 1970 flow [2023-08-04 08:08:25,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 224 transitions, 1928 flow, removed 16 selfloop flow, removed 3 redundant places. [2023-08-04 08:08:25,090 INFO L231 Difference]: Finished difference. Result has 86 places, 101 transitions, 897 flow [2023-08-04 08:08:25,090 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=897, PETRI_PLACES=86, PETRI_TRANSITIONS=101} [2023-08-04 08:08:25,091 INFO L281 CegarLoopForPetriNet]: 41 programPoint places, 45 predicate places. [2023-08-04 08:08:25,091 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 101 transitions, 897 flow [2023-08-04 08:08:25,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 91.42857142857143) internal successors, (640), 7 states have internal predecessors, (640), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:08:25,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 08:08:25,091 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:08:25,097 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-08-04 08:08:25,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2023-08-04 08:08:25,297 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 08:08:25,298 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 08:08:25,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1781727087, now seen corresponding path program 1 times [2023-08-04 08:08:25,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 08:08:25,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084221900] [2023-08-04 08:08:25,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:25,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 08:08:25,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:25,869 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-08-04 08:08:25,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 08:08:25,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084221900] [2023-08-04 08:08:25,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084221900] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 08:08:25,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162244924] [2023-08-04 08:08:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 08:08:25,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:08:25,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 08:08:25,873 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 08:08:25,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-08-04 08:08:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 08:08:26,005 INFO L262 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-04 08:08:26,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 08:08:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 2 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 08:08:55,173 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 08:09:19,016 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 08:09:19,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162244924] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 08:09:19,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 08:09:19,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-04 08:09:19,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127717906] [2023-08-04 08:09:19,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 08:09:19,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-04 08:09:19,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 08:09:19,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-04 08:09:19,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=218, Unknown=19, NotChecked=0, Total=306 [2023-08-04 08:09:21,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:09:23,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:09:25,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:09:27,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:09:29,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:09:31,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:09:33,091 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:09:35,103 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:09:35,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 219 [2023-08-04 08:09:35,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 101 transitions, 897 flow. Second operand has 18 states, 18 states have (on average 86.33333333333333) internal successors, (1554), 18 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 08:09:35,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 08:09:35,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 219 [2023-08-04 08:09:35,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 08:10:28,747 WARN L233 SmtUtils]: Spent 52.57s on a formula simplification. DAG size of input: 72 DAG size of output: 64 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 08:10:44,393 WARN L233 SmtUtils]: Spent 12.41s on a formula simplification. DAG size of input: 56 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 08:11:57,919 WARN L233 SmtUtils]: Spent 1.22m on a formula simplification. DAG size of input: 74 DAG size of output: 36 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 08:12:00,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:12:03,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:12:14,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:12:56,936 WARN L233 SmtUtils]: Spent 33.95s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 08:12:59,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:13:02,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:13:05,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:13:06,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:13:39,439 WARN L233 SmtUtils]: Spent 23.90s on a formula simplification. DAG size of input: 51 DAG size of output: 21 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 08:13:41,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:13:43,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:29,569 WARN L233 SmtUtils]: Spent 39.74s on a formula simplification. DAG size of input: 53 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 08:14:31,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:35,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:37,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:39,284 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:42,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:44,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:46,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:48,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:50,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:52,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:54,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:56,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:14:58,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:00,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:03,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:04,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:06,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:08,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:11,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:13,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:16,072 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:32,989 WARN L233 SmtUtils]: Spent 6.53s on a formula simplification that was a NOOP. DAG size: 44 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 08:15:34,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:37,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:39,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:41,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:43,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:45,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:47,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:49,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:53,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:55,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:57,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:15:59,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:01,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:03,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:05,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:07,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:09,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:12,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:14,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:16,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:18,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:20,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:22,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:24,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:26,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:28,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:30,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:32,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:34,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:36,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:38,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:40,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:41,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:43,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:45,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:47,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:49,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:51,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:54,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:56,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:16:58,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:00,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:02,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:04,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:06,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:09,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:11,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:13,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:15,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:18,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:27,647 WARN L233 SmtUtils]: Spent 7.33s on a formula simplification. DAG size of input: 32 DAG size of output: 24 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 08:17:29,650 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:31,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:33,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:35,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:37,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:39,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:41,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:43,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:45,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:47,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:49,737 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:51,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:53,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:56,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:17:58,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:00,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:02,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:10,824 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:12,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:14,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:16,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:18,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:20,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:22,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:24,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:26,906 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:28,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:30,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:32,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:34,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:37,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:39,070 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:41,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:56,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:18:58,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:00,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:02,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:04,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:06,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:08,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:14,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:16,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:18,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:20,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:22,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:24,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:28,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:29,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:31,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:33,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:35,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:37,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:40,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:42,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:44,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:46,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:49,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:51,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:54,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:19:56,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:12,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:15,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:17,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:19,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:22,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:24,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:27,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:29,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:31,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:35,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:37,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:39,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:42,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:43,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:45,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:47,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:50,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:52,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:54,120 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:56,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:20:58,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:17,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:24,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:26,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:28,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:30,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:32,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:34,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:37,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:39,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:42,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:44,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:46,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:48,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:50,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:52,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:54,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:56,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:21:58,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:00,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:02,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:05,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:07,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:09,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:11,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:13,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:15,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:17,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:20,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:22,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:24,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:26,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-04 08:22:28,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Received shutdown request... [2023-08-04 08:22:30,510 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 08:22:30,510 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 08:22:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-08-04 08:22:31,465 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 08:22:31,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-08-04 08:22:31,520 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 [2023-08-04 08:22:31,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 08:22:31,666 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. [2023-08-04 08:22:31,666 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 08:22:31,667 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2023-08-04 08:22:31,667 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 08:22:31,668 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 08:22:31,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 08:22:31 BasicIcfg [2023-08-04 08:22:31,671 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 08:22:31,671 INFO L158 Benchmark]: Toolchain (without parser) took 869434.10ms. Allocated memory was 362.8MB in the beginning and 6.3GB in the end (delta: 5.9GB). Free memory was 313.8MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 537.4MB. Max. memory is 16.0GB. [2023-08-04 08:22:31,671 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 362.8MB. Free memory is still 313.6MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 08:22:31,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.37ms. Allocated memory is still 362.8MB. Free memory was 313.8MB in the beginning and 302.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. [2023-08-04 08:22:31,672 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.21ms. Allocated memory is still 362.8MB. Free memory was 302.7MB in the beginning and 300.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 08:22:31,672 INFO L158 Benchmark]: Boogie Preprocessor took 41.65ms. Allocated memory is still 362.8MB. Free memory was 300.9MB in the beginning and 299.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 08:22:31,672 INFO L158 Benchmark]: RCFGBuilder took 422.95ms. Allocated memory is still 362.8MB. Free memory was 299.5MB in the beginning and 286.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-04 08:22:31,672 INFO L158 Benchmark]: TraceAbstraction took 868678.00ms. Allocated memory was 362.8MB in the beginning and 6.3GB in the end (delta: 5.9GB). Free memory was 285.7MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 510.1MB. Max. memory is 16.0GB. [2023-08-04 08:22:31,673 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 362.8MB. Free memory is still 313.6MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 237.37ms. Allocated memory is still 362.8MB. Free memory was 313.8MB in the beginning and 302.7MB in the end (delta: 11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 47.21ms. Allocated memory is still 362.8MB. Free memory was 302.7MB in the beginning and 300.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 41.65ms. Allocated memory is still 362.8MB. Free memory was 300.9MB in the beginning and 299.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 422.95ms. Allocated memory is still 362.8MB. Free memory was 299.5MB in the beginning and 286.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * TraceAbstraction took 868678.00ms. Allocated memory was 362.8MB in the beginning and 6.3GB in the end (delta: 5.9GB). Free memory was 285.7MB in the beginning and 5.7GB in the end (delta: -5.4GB). Peak memory consumption was 510.1MB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.1s, 98 PlacesBefore, 27 PlacesAfterwards, 107 TransitionsBefore, 28 TransitionsAfterwards, 1392 CoEnabledTransitionPairs, 6 FixpointIterations, 30 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 14 ConcurrentYvCompositions, 8 ChoiceCompositions, 92 TotalNumberOfCompositions, 1922 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1910, independent: 1906, independent conditional: 0, independent unconditional: 1906, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 740, independent: 738, independent conditional: 0, independent unconditional: 738, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1910, independent: 1168, independent conditional: 0, independent unconditional: 1168, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 740, unknown conditional: 0, unknown unconditional: 740] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 98 PlacesBefore, 27 PlacesAfterwards, 107 TransitionsBefore, 28 TransitionsAfterwards, 1392 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 14 ConcurrentYvCompositions, 8 ChoiceCompositions, 93 TotalNumberOfCompositions, 1916 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1908, independent: 1904, independent conditional: 0, independent unconditional: 1904, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 737, independent: 735, independent conditional: 0, independent unconditional: 735, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1908, independent: 1169, independent conditional: 0, independent unconditional: 1169, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 737, unknown conditional: 0, unknown unconditional: 737] , Statistics on independence cache: Total cache size (in pairs): 49, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 1.8s, 112 PlacesBefore, 41 PlacesAfterwards, 125 TransitionsBefore, 44 TransitionsAfterwards, 3312 CoEnabledTransitionPairs, 6 FixpointIterations, 28 TrivialSequentialCompositions, 37 ConcurrentSequentialCompositions, 1 TrivialYvCompositions, 18 ConcurrentYvCompositions, 10 ChoiceCompositions, 94 TotalNumberOfCompositions, 9288 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 6613, independent: 6505, independent conditional: 0, independent unconditional: 6505, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1881, independent: 1857, independent conditional: 0, independent unconditional: 1857, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 6613, independent: 4648, independent conditional: 0, independent unconditional: 4648, dependent: 84, dependent conditional: 0, dependent unconditional: 84, unknown: 1881, unknown conditional: 0, unknown unconditional: 1881] , Statistics on independence cache: Total cache size (in pairs): 269, Positive cache size: 261, Positive conditional cache size: 0, Positive unconditional cache size: 261, Negative cache size: 8, Negative conditional cache size: 0, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 70]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantifier-free) to 39 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 104 locations, 3 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: 4.6s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 16 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 257 IncrementalHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 16 mSDtfsCounter, 257 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 117 NumberOfCodeBlocks, 117 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 390 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 18/24 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 114 locations, 3 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: 862.0s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 801.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: 182 mSolverCounterUnknown, 994 SdHoareTripleChecker+Valid, 443.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 801 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 441.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 168 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2775 IncrementalHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 168 mSolverCounterUnsat, 43 mSDtfsCounter, 2775 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 599 GetRequests, 503 SyntacticMatches, 17 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 395.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=897occurred in iteration=14, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 55.2s InterpolantComputationTime, 751 NumberOfCodeBlocks, 751 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 967 ConstructedInterpolants, 0 QuantifiedInterpolants, 9509 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1368 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 32 InterpolantComputations, 8 PerfectInterpolantSequences, 397/448 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 - StatisticsResult: Ultimate Automizer benchmark data for thread instance sufficiency with 1 thread instances CFG has 5 procedures, 104 locations, 3 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: 1.9s, OverallIterations: 1, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.9s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 6 NumberOfCodeBlocks, 6 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 could not prove your program: Timeout Completed graceful shutdown