/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_popl20-more-max-array.wvr_bound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-19404b3-m [2023-08-04 09:25:25,401 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-04 09:25:25,445 INFO L114 SettingsManager]: Loading settings from /storage/repos/CAV22/benchmarks/svcomp-Reach-32bit-Automizer_Default.epf [2023-08-04 09:25:25,449 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-04 09:25:25,449 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-08-04 09:25:25,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Translation Mode: [2023-08-04 09:25:25,450 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-04 09:25:25,469 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-04 09:25:25,469 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-04 09:25:25,470 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-04 09:25:25,470 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-04 09:25:25,470 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-04 09:25:25,471 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-04 09:25:25,471 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-04 09:25:25,472 INFO L153 SettingsManager]: * Use SBE=true [2023-08-04 09:25:25,472 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-04 09:25:25,472 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-04 09:25:25,473 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-04 09:25:25,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-04 09:25:25,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-04 09:25:25,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-04 09:25:25,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-04 09:25:25,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-04 09:25:25,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-04 09:25:25,475 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-04 09:25:25,475 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-04 09:25:25,476 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-04 09:25:25,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-04 09:25:25,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-04 09:25:25,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-04 09:25:25,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:25:25,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-04 09:25:25,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-04 09:25:25,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-04 09:25:25,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-04 09:25:25,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-04 09:25:25,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-04 09:25:25,479 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-08-04 09:25:25,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-04 09:25:25,479 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-04 09:25:25,479 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-04 09:25:25,480 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 09:25:25,655 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-04 09:25:25,671 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-04 09:25:25,673 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-04 09:25:25,674 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-04 09:25:25,675 INFO L274 PluginConnector]: CDTParser initialized [2023-08-04 09:25:25,676 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-max-array.wvr_bound2.c [2023-08-04 09:25:26,875 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-04 09:25:27,061 INFO L384 CDTParser]: Found 1 translation units. [2023-08-04 09:25:27,062 INFO L180 CDTParser]: Scanning /storage/repos/CAV22/benchmarks/increased_bounds/weaver_popl20-more-max-array.wvr_bound2.c [2023-08-04 09:25:27,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f571a7a/d53c7dc336cc46ce95c1e139cd23032e/FLAG667e0120f [2023-08-04 09:25:27,093 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f571a7a/d53c7dc336cc46ce95c1e139cd23032e [2023-08-04 09:25:27,095 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-04 09:25:27,096 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-04 09:25:27,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-04 09:25:27,097 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-04 09:25:27,103 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-04 09:25:27,103 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,104 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17045e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27, skipping insertion in model container [2023-08-04 09:25:27,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,129 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-04 09:25:27,326 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_popl20-more-max-array.wvr_bound2.c[2796,2809] [2023-08-04 09:25:27,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:25:27,343 INFO L201 MainTranslator]: Completed pre-run [2023-08-04 09:25:27,362 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_popl20-more-max-array.wvr_bound2.c[2796,2809] [2023-08-04 09:25:27,365 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-04 09:25:27,373 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:25:27,373 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-04 09:25:27,378 INFO L206 MainTranslator]: Completed translation [2023-08-04 09:25:27,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27 WrapperNode [2023-08-04 09:25:27,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-04 09:25:27,382 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-04 09:25:27,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-04 09:25:27,382 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-04 09:25:27,387 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,393 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,414 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 152 [2023-08-04 09:25:27,415 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-04 09:25:27,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-04 09:25:27,416 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-04 09:25:27,416 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-04 09:25:27,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,424 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,427 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,427 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,433 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,439 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,453 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-04 09:25:27,454 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-04 09:25:27,454 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-04 09:25:27,454 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-04 09:25:27,455 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (1/1) ... [2023-08-04 09:25:27,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-04 09:25:27,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:25:27,482 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 09:25:27,504 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 09:25:27,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-04 09:25:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-04 09:25:27,522 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-04 09:25:27,522 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-04 09:25:27,523 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-04 09:25:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-04 09:25:27,523 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-04 09:25:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-04 09:25:27,523 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-04 09:25:27,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-04 09:25:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-04 09:25:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-04 09:25:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-04 09:25:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-04 09:25:27,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-04 09:25:27,525 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-04 09:25:27,526 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-04 09:25:27,527 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 09:25:27,647 INFO L236 CfgBuilder]: Building ICFG [2023-08-04 09:25:27,648 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-04 09:25:27,892 INFO L277 CfgBuilder]: Performing block encoding [2023-08-04 09:25:27,959 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-04 09:25:27,960 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-08-04 09:25:27,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:25:27 BoogieIcfgContainer [2023-08-04 09:25:27,962 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-04 09:25:27,964 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-04 09:25:27,964 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-04 09:25:27,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-04 09:25:27,967 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.08 09:25:27" (1/3) ... [2023-08-04 09:25:27,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ef22a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:25:27, skipping insertion in model container [2023-08-04 09:25:27,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.08 09:25:27" (2/3) ... [2023-08-04 09:25:27,968 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46ef22a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.08 09:25:27, skipping insertion in model container [2023-08-04 09:25:27,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.08 09:25:27" (3/3) ... [2023-08-04 09:25:27,969 INFO L112 eAbstractionObserver]: Analyzing ICFG weaver_popl20-more-max-array.wvr_bound2.c [2023-08-04 09:25:27,976 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-08-04 09:25:27,982 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-04 09:25:27,983 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-08-04 09:25:27,983 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-04 09:25:28,049 INFO L144 ThreadInstanceAdder]: Constructed 9 joinOtherThreadTransitions. [2023-08-04 09:25:28,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:28,318 INFO L124 PetriNetUnfolderBase]: 101/660 cut-off events. [2023-08-04 09:25:28,318 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-04 09:25:28,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 660 events. 101/660 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3241 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 371. Up to 16 conditions per place. [2023-08-04 09:25:28,329 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:28,339 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:28,342 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:25:28,353 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:28,356 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:28,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:28,426 INFO L124 PetriNetUnfolderBase]: 101/660 cut-off events. [2023-08-04 09:25:28,427 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-04 09:25:28,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 660 events. 101/660 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3241 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 371. Up to 16 conditions per place. [2023-08-04 09:25:28,440 INFO L119 LiptonReduction]: Number of co-enabled transitions 5220 [2023-08-04 09:25:33,097 INFO L134 LiptonReduction]: Checked pairs total: 9109 [2023-08-04 09:25:33,098 INFO L136 LiptonReduction]: Total number of compositions: 170 [2023-08-04 09:25:33,109 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:25:33,114 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;@46b81fb6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:25:33,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:25:33,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:25:33,120 INFO L124 PetriNetUnfolderBase]: 4/35 cut-off events. [2023-08-04 09:25:33,120 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:25:33,120 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:33,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:25:33,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:25:33,126 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -724389028, now seen corresponding path program 1 times [2023-08-04 09:25:33,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:33,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390889851] [2023-08-04 09:25:33,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:33,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:33,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:33,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-04 09:25:33,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:25:33,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390889851] [2023-08-04 09:25:33,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390889851] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:25:33,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:25:33,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:25:33,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36897725] [2023-08-04 09:25:33,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:25:33,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:25:33,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:25:33,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:25:33,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:25:33,473 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 362 [2023-08-04 09:25:33,478 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 49 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states 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 09:25:33,478 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:25:33,478 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 362 [2023-08-04 09:25:33,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:25:33,850 INFO L124 PetriNetUnfolderBase]: 2189/3062 cut-off events. [2023-08-04 09:25:33,851 INFO L125 PetriNetUnfolderBase]: For 199/199 co-relation queries the response was YES. [2023-08-04 09:25:33,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6181 conditions, 3062 events. 2189/3062 cut-off events. For 199/199 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 13844 event pairs, 825 based on Foata normal form. 0/1751 useless extension candidates. Maximal degree in co-relation 4968. Up to 2908 conditions per place. [2023-08-04 09:25:33,867 INFO L140 encePairwiseOnDemand]: 358/362 looper letters, 39 selfloop transitions, 2 changer transitions 4/51 dead transitions. [2023-08-04 09:25:33,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 51 transitions, 228 flow [2023-08-04 09:25:33,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:25:33,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:25:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2023-08-04 09:25:33,882 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47697974217311234 [2023-08-04 09:25:33,883 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2023-08-04 09:25:33,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2023-08-04 09:25:33,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:25:33,889 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2023-08-04 09:25:33,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:25:33,900 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:33,901 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:33,903 INFO L175 Difference]: Start difference. First operand has 43 places, 49 transitions, 140 flow. Second operand 3 states and 518 transitions. [2023-08-04 09:25:33,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 51 transitions, 228 flow [2023-08-04 09:25:33,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 51 transitions, 228 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:25:33,911 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 134 flow [2023-08-04 09:25:33,912 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2023-08-04 09:25:33,919 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-04 09:25:33,919 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 134 flow [2023-08-04 09:25:33,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.66666666666666) internal successors, (482), 3 states have internal predecessors, (482), 0 states have call successors, (0), 0 states 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 09:25:33,920 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:33,920 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:25:33,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-04 09:25:33,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:25:33,923 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:33,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1684195600, now seen corresponding path program 1 times [2023-08-04 09:25:33,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:33,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837794263] [2023-08-04 09:25:33,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:33,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:33,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:34,061 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 09:25:34,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:25:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837794263] [2023-08-04 09:25:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837794263] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:25:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [465767051] [2023-08-04 09:25:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:34,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:25:34,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:25:34,065 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 09:25:34,081 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 09:25:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:34,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:25:34,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:25:34,157 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 09:25:34,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:25:34,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [465767051] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:25:34,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:25:34,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:25:34,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219606835] [2023-08-04 09:25:34,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:25:34,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:25:34,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:25:34,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:25:34,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:25:34,185 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 362 [2023-08-04 09:25:34,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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 09:25:34,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:25:34,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 362 [2023-08-04 09:25:34,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:25:34,435 INFO L124 PetriNetUnfolderBase]: 2097/2911 cut-off events. [2023-08-04 09:25:34,436 INFO L125 PetriNetUnfolderBase]: For 171/171 co-relation queries the response was YES. [2023-08-04 09:25:34,439 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5883 conditions, 2911 events. 2097/2911 cut-off events. For 171/171 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 12970 event pairs, 804 based on Foata normal form. 0/1662 useless extension candidates. Maximal degree in co-relation 4671. Up to 2757 conditions per place. [2023-08-04 09:25:34,452 INFO L140 encePairwiseOnDemand]: 359/362 looper letters, 41 selfloop transitions, 2 changer transitions 1/50 dead transitions. [2023-08-04 09:25:34,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 232 flow [2023-08-04 09:25:34,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:25:34,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:25:34,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2023-08-04 09:25:34,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47790055248618785 [2023-08-04 09:25:34,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2023-08-04 09:25:34,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2023-08-04 09:25:34,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:25:34,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2023-08-04 09:25:34,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:25:34,459 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:34,460 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:34,460 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 134 flow. Second operand 3 states and 519 transitions. [2023-08-04 09:25:34,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 232 flow [2023-08-04 09:25:34,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 216 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-04 09:25:34,464 INFO L231 Difference]: Finished difference. Result has 40 places, 45 transitions, 126 flow [2023-08-04 09:25:34,464 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=40, PETRI_TRANSITIONS=45} [2023-08-04 09:25:34,464 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -3 predicate places. [2023-08-04 09:25:34,465 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 45 transitions, 126 flow [2023-08-04 09:25:34,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 0 states have call successors, (0), 0 states 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 09:25:34,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:34,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:25:34,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-04 09:25:34,671 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 09:25:34,671 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:25:34,672 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:34,672 INFO L85 PathProgramCache]: Analyzing trace with hash -281950171, now seen corresponding path program 1 times [2023-08-04 09:25:34,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:34,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075695691] [2023-08-04 09:25:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:34,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:34,758 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 09:25:34,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:25:34,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075695691] [2023-08-04 09:25:34,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075695691] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:25:34,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064318210] [2023-08-04 09:25:34,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:34,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:25:34,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:25:34,760 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 09:25:34,763 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 09:25:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:34,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:25:34,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:25:34,857 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 09:25:34,857 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:25:34,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2064318210] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:25:34,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:25:34,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:25:34,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432937248] [2023-08-04 09:25:34,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:25:34,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:25:34,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:25:34,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:25:34,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:25:34,870 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 362 [2023-08-04 09:25:34,871 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 45 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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 09:25:34,871 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:25:34,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 362 [2023-08-04 09:25:34,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:25:35,135 INFO L124 PetriNetUnfolderBase]: 2088/2902 cut-off events. [2023-08-04 09:25:35,136 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-08-04 09:25:35,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 2902 events. 2088/2902 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 12861 event pairs, 789 based on Foata normal form. 0/1680 useless extension candidates. Maximal degree in co-relation 2270. Up to 2638 conditions per place. [2023-08-04 09:25:35,153 INFO L140 encePairwiseOnDemand]: 359/362 looper letters, 43 selfloop transitions, 2 changer transitions 1/52 dead transitions. [2023-08-04 09:25:35,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 52 transitions, 232 flow [2023-08-04 09:25:35,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:25:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:25:35,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2023-08-04 09:25:35,157 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47974217311233885 [2023-08-04 09:25:35,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2023-08-04 09:25:35,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2023-08-04 09:25:35,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:25:35,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2023-08-04 09:25:35,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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 09:25:35,161 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:35,162 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:35,162 INFO L175 Difference]: Start difference. First operand has 40 places, 45 transitions, 126 flow. Second operand 3 states and 521 transitions. [2023-08-04 09:25:35,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 52 transitions, 232 flow [2023-08-04 09:25:35,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 52 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:25:35,165 INFO L231 Difference]: Finished difference. Result has 41 places, 45 transitions, 130 flow [2023-08-04 09:25:35,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=41, PETRI_TRANSITIONS=45} [2023-08-04 09:25:35,166 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -2 predicate places. [2023-08-04 09:25:35,167 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 45 transitions, 130 flow [2023-08-04 09:25:35,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.66666666666666) internal successors, (488), 3 states have internal predecessors, (488), 0 states have call successors, (0), 0 states 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 09:25:35,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:35,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:25:35,175 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 09:25:35,372 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 09:25:35,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:25:35,373 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:35,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1233944356, now seen corresponding path program 1 times [2023-08-04 09:25:35,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:35,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760505361] [2023-08-04 09:25:35,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:35,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:35,448 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 09:25:35,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:25:35,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760505361] [2023-08-04 09:25:35,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760505361] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:25:35,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567719530] [2023-08-04 09:25:35,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:35,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:25:35,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:25:35,450 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 09:25:35,452 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 09:25:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:35,525 INFO L262 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:25:35,527 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:25:35,541 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 09:25:35,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:25:35,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567719530] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:25:35,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:25:35,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:25:35,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613627117] [2023-08-04 09:25:35,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:25:35,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:25:35,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:25:35,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:25:35,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:25:35,551 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 362 [2023-08-04 09:25:35,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 45 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 09:25:35,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:25:35,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 362 [2023-08-04 09:25:35,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:25:35,796 INFO L124 PetriNetUnfolderBase]: 1350/1921 cut-off events. [2023-08-04 09:25:35,796 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-08-04 09:25:35,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3976 conditions, 1921 events. 1350/1921 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 91. Compared 7921 event pairs, 492 based on Foata normal form. 0/1140 useless extension candidates. Maximal degree in co-relation 1654. Up to 1483 conditions per place. [2023-08-04 09:25:35,810 INFO L140 encePairwiseOnDemand]: 359/362 looper letters, 48 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2023-08-04 09:25:35,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 56 transitions, 258 flow [2023-08-04 09:25:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:25:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:25:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-04 09:25:35,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48342541436464087 [2023-08-04 09:25:35,816 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-04 09:25:35,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-04 09:25:35,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:25:35,817 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-04 09:25:35,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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 09:25:35,820 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:35,821 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:35,821 INFO L175 Difference]: Start difference. First operand has 41 places, 45 transitions, 130 flow. Second operand 3 states and 525 transitions. [2023-08-04 09:25:35,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 56 transitions, 258 flow [2023-08-04 09:25:35,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-04 09:25:35,825 INFO L231 Difference]: Finished difference. Result has 42 places, 46 transitions, 138 flow [2023-08-04 09:25:35,825 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=39, 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=138, PETRI_PLACES=42, PETRI_TRANSITIONS=46} [2023-08-04 09:25:35,827 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -1 predicate places. [2023-08-04 09:25:35,827 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 46 transitions, 138 flow [2023-08-04 09:25:35,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states 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 09:25:35,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:35,828 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 09:25:35,835 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 09:25:36,032 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 09:25:36,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:25:36,033 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:36,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1958443446, now seen corresponding path program 1 times [2023-08-04 09:25:36,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:36,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760338989] [2023-08-04 09:25:36,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:36,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:36,100 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 09:25:36,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:25:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760338989] [2023-08-04 09:25:36,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760338989] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:25:36,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1817933013] [2023-08-04 09:25:36,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:36,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:25:36,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:25:36,106 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 09:25:36,108 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 09:25:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:36,190 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:25:36,191 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:25:36,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:25:36,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:25:36,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1817933013] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:25:36,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:25:36,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:25:36,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743223748] [2023-08-04 09:25:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:25:36,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:25:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:25:36,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:25:36,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:25:36,214 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 362 [2023-08-04 09:25:36,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 46 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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 09:25:36,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:25:36,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 362 [2023-08-04 09:25:36,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:25:36,400 INFO L124 PetriNetUnfolderBase]: 1121/1615 cut-off events. [2023-08-04 09:25:36,400 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2023-08-04 09:25:36,403 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3459 conditions, 1615 events. 1121/1615 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6376 event pairs, 454 based on Foata normal form. 0/1027 useless extension candidates. Maximal degree in co-relation 1414. Up to 1279 conditions per place. [2023-08-04 09:25:36,408 INFO L140 encePairwiseOnDemand]: 359/362 looper letters, 49 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2023-08-04 09:25:36,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 57 transitions, 268 flow [2023-08-04 09:25:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:25:36,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:25:36,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 525 transitions. [2023-08-04 09:25:36,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48342541436464087 [2023-08-04 09:25:36,411 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 525 transitions. [2023-08-04 09:25:36,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 525 transitions. [2023-08-04 09:25:36,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:25:36,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 525 transitions. [2023-08-04 09:25:36,412 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 0 states have call successors, (0), 0 states 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 09:25:36,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:36,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:36,415 INFO L175 Difference]: Start difference. First operand has 42 places, 46 transitions, 138 flow. Second operand 3 states and 525 transitions. [2023-08-04 09:25:36,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 57 transitions, 268 flow [2023-08-04 09:25:36,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 266 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:25:36,417 INFO L231 Difference]: Finished difference. Result has 44 places, 47 transitions, 148 flow [2023-08-04 09:25:36,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=41, 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=148, PETRI_PLACES=44, PETRI_TRANSITIONS=47} [2023-08-04 09:25:36,418 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 1 predicate places. [2023-08-04 09:25:36,418 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 47 transitions, 148 flow [2023-08-04 09:25:36,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.0) internal successors, (495), 3 states have internal predecessors, (495), 0 states have call successors, (0), 0 states 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 09:25:36,419 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:36,419 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:25:36,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-04 09:25:36,625 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 09:25:36,625 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:25:36,625 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:36,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1999787953, now seen corresponding path program 1 times [2023-08-04 09:25:36,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:36,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559014666] [2023-08-04 09:25:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:36,693 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:25:36,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:25:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559014666] [2023-08-04 09:25:36,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559014666] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:25:36,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878510958] [2023-08-04 09:25:36,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:36,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:25:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:25:36,695 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 09:25:36,697 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 09:25:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:36,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:25:36,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:25:36,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 09:25:36,788 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:25:36,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1878510958] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:25:36,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:25:36,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:25:36,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386383642] [2023-08-04 09:25:36,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:25:36,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:25:36,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:25:36,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:25:36,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:25:36,799 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 362 [2023-08-04 09:25:36,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 47 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 09:25:36,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:25:36,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 362 [2023-08-04 09:25:36,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:25:36,965 INFO L124 PetriNetUnfolderBase]: 1108/1595 cut-off events. [2023-08-04 09:25:36,967 INFO L125 PetriNetUnfolderBase]: For 124/124 co-relation queries the response was YES. [2023-08-04 09:25:36,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3461 conditions, 1595 events. 1108/1595 cut-off events. For 124/124 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6262 event pairs, 527 based on Foata normal form. 0/1032 useless extension candidates. Maximal degree in co-relation 2560. Up to 1487 conditions per place. [2023-08-04 09:25:36,975 INFO L140 encePairwiseOnDemand]: 359/362 looper letters, 43 selfloop transitions, 2 changer transitions 3/54 dead transitions. [2023-08-04 09:25:36,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 258 flow [2023-08-04 09:25:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:25:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:25:36,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2023-08-04 09:25:36,977 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47974217311233885 [2023-08-04 09:25:36,977 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 521 transitions. [2023-08-04 09:25:36,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 521 transitions. [2023-08-04 09:25:36,978 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:25:36,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 521 transitions. [2023-08-04 09:25:36,979 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 0 states have call successors, (0), 0 states 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 09:25:36,981 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:36,981 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 362.0) internal successors, (1448), 4 states have internal predecessors, (1448), 0 states have call successors, (0), 0 states 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 09:25:36,981 INFO L175 Difference]: Start difference. First operand has 44 places, 47 transitions, 148 flow. Second operand 3 states and 521 transitions. [2023-08-04 09:25:36,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 258 flow [2023-08-04 09:25:36,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:25:36,985 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 146 flow [2023-08-04 09:25:36,985 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-04 09:25:36,985 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 3 predicate places. [2023-08-04 09:25:36,986 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 146 flow [2023-08-04 09:25:36,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states 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 09:25:36,986 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:36,986 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:25:36,993 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-04 09:25:37,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:25:37,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:25:37,192 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:37,192 INFO L85 PathProgramCache]: Analyzing trace with hash -336283743, now seen corresponding path program 1 times [2023-08-04 09:25:37,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:37,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325106414] [2023-08-04 09:25:37,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:37,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:37,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 09:25:37,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:25:37,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325106414] [2023-08-04 09:25:37,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325106414] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:25:37,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417713596] [2023-08-04 09:25:37,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:37,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:25:37,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:25:37,276 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 09:25:37,300 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 09:25:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:37,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:25:37,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:25:37,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 09:25:37,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:25:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 09:25:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417713596] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:25:37,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:25:37,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:25:37,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164891039] [2023-08-04 09:25:37,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:25:37,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:25:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:25:37,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:25:37,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:25:37,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 362 [2023-08-04 09:25:37,459 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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 09:25:37,459 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:25:37,459 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 362 [2023-08-04 09:25:37,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:25:37,479 INFO L124 PetriNetUnfolderBase]: 9/21 cut-off events. [2023-08-04 09:25:37,479 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-08-04 09:25:37,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56 conditions, 21 events. 9/21 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 24 event pairs, 1 based on Foata normal form. 3/19 useless extension candidates. Maximal degree in co-relation 44. Up to 13 conditions per place. [2023-08-04 09:25:37,480 INFO L140 encePairwiseOnDemand]: 359/362 looper letters, 0 selfloop transitions, 0 changer transitions 12/12 dead transitions. [2023-08-04 09:25:37,480 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 21 places, 12 transitions, 50 flow [2023-08-04 09:25:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:25:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:25:37,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 640 transitions. [2023-08-04 09:25:37,482 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4419889502762431 [2023-08-04 09:25:37,482 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 640 transitions. [2023-08-04 09:25:37,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 640 transitions. [2023-08-04 09:25:37,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:25:37,482 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 640 transitions. [2023-08-04 09:25:37,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 160.0) internal successors, (640), 4 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 09:25:37,485 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states 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 09:25:37,486 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 362.0) internal successors, (1810), 5 states have internal predecessors, (1810), 0 states have call successors, (0), 0 states 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 09:25:37,486 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 146 flow. Second operand 4 states and 640 transitions. [2023-08-04 09:25:37,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 21 places, 12 transitions, 50 flow [2023-08-04 09:25:37,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 20 places, 12 transitions, 48 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:25:37,487 INFO L231 Difference]: Finished difference. Result has 20 places, 0 transitions, 0 flow [2023-08-04 09:25:37,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=362, PETRI_DIFFERENCE_MINUEND_FLOW=20, PETRI_DIFFERENCE_MINUEND_PLACES=17, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=9, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=20, PETRI_TRANSITIONS=0} [2023-08-04 09:25:37,488 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, -23 predicate places. [2023-08-04 09:25:37,488 INFO L495 AbstractCegarLoop]: Abstraction has has 20 places, 0 transitions, 0 flow [2023-08-04 09:25:37,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states 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 09:25:37,491 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 09:25:37,497 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 09:25:37,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:25:37,697 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:25:37,698 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2023-08-04 09:25:37,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:37,747 INFO L124 PetriNetUnfolderBase]: 101/660 cut-off events. [2023-08-04 09:25:37,748 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-04 09:25:37,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 660 events. 101/660 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3241 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 371. Up to 16 conditions per place. [2023-08-04 09:25:37,750 INFO L82 GeneralOperation]: Start removeDead. Operand has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:37,752 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:37,752 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:25:37,752 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:37,753 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:37,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 172 places, 192 transitions, 426 flow [2023-08-04 09:25:37,794 INFO L124 PetriNetUnfolderBase]: 101/660 cut-off events. [2023-08-04 09:25:37,795 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2023-08-04 09:25:37,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 660 events. 101/660 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3241 event pairs, 0 based on Foata normal form. 0/549 useless extension candidates. Maximal degree in co-relation 371. Up to 16 conditions per place. [2023-08-04 09:25:37,804 INFO L119 LiptonReduction]: Number of co-enabled transitions 5220 [2023-08-04 09:25:42,335 INFO L134 LiptonReduction]: Checked pairs total: 8703 [2023-08-04 09:25:42,336 INFO L136 LiptonReduction]: Total number of compositions: 167 [2023-08-04 09:25:42,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == InUseError ======== [2023-08-04 09:25:42,337 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;@46b81fb6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:25:42,337 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-08-04 09:25:42,340 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:25:42,340 INFO L124 PetriNetUnfolderBase]: 4/33 cut-off events. [2023-08-04 09:25:42,340 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-04 09:25:42,341 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:42,341 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2023-08-04 09:25:42,341 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 09:25:42,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:42,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1692148416, now seen corresponding path program 1 times [2023-08-04 09:25:42,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:42,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680419310] [2023-08-04 09:25:42,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:42,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:42,427 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 09:25:42,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:25:42,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680419310] [2023-08-04 09:25:42,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680419310] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:25:42,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:25:42,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 09:25:42,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365598794] [2023-08-04 09:25:42,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:25:42,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:25:42,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:25:42,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:25:42,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:25:42,456 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 359 [2023-08-04 09:25:42,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 49 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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 09:25:42,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:25:42,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 359 [2023-08-04 09:25:42,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:25:42,684 INFO L124 PetriNetUnfolderBase]: 2307/3250 cut-off events. [2023-08-04 09:25:42,684 INFO L125 PetriNetUnfolderBase]: For 188/188 co-relation queries the response was YES. [2023-08-04 09:25:42,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6567 conditions, 3250 events. 2307/3250 cut-off events. For 188/188 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 15319 event pairs, 1053 based on Foata normal form. 0/1862 useless extension candidates. Maximal degree in co-relation 5016. Up to 3086 conditions per place. [2023-08-04 09:25:42,697 INFO L140 encePairwiseOnDemand]: 355/359 looper letters, 19 selfloop transitions, 2 changer transitions 22/49 dead transitions. [2023-08-04 09:25:42,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 49 transitions, 220 flow [2023-08-04 09:25:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:25:42,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:25:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2023-08-04 09:25:42,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4763231197771588 [2023-08-04 09:25:42,700 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 513 transitions. [2023-08-04 09:25:42,700 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 513 transitions. [2023-08-04 09:25:42,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:25:42,701 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 513 transitions. [2023-08-04 09:25:42,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.0) internal successors, (513), 3 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:25:42,705 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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 09:25:42,705 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 359.0) internal successors, (1436), 4 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states 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 09:25:42,705 INFO L175 Difference]: Start difference. First operand has 43 places, 49 transitions, 140 flow. Second operand 3 states and 513 transitions. [2023-08-04 09:25:42,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 49 transitions, 220 flow [2023-08-04 09:25:42,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:25:42,708 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 79 flow [2023-08-04 09:25:42,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=359, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2023-08-04 09:25:42,710 INFO L281 CegarLoopForPetriNet]: 43 programPoint places, 2 predicate places. [2023-08-04 09:25:42,710 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 79 flow [2023-08-04 09:25:42,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states 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 09:25:42,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:42,710 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-08-04 09:25:42,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-04 09:25:42,710 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2023-08-04 09:25:42,711 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:42,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1371829634, now seen corresponding path program 1 times [2023-08-04 09:25:42,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:42,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19953562] [2023-08-04 09:25:42,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:42,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:42,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:25:42,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-04 09:25:42,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-04 09:25:42,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-04 09:25:42,778 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-04 09:25:42,779 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2023-08-04 09:25:42,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2023-08-04 09:25:42,779 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2023-08-04 09:25:42,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-04 09:25:42,779 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-04 09:25:42,780 INFO L307 ceAbstractionStarter]: Result for error location InUseError was UNSAFE,UNKNOWN,UNKNOWN (2/2) [2023-08-04 09:25:42,780 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-04 09:25:42,780 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-04 09:25:42,811 INFO L144 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2023-08-04 09:25:42,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 234 transitions, 558 flow [2023-08-04 09:25:43,237 INFO L124 PetriNetUnfolderBase]: 891/4149 cut-off events. [2023-08-04 09:25:43,237 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2023-08-04 09:25:43,265 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4823 conditions, 4149 events. 891/4149 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 33195 event pairs, 11 based on Foata normal form. 0/3502 useless extension candidates. Maximal degree in co-relation 2466. Up to 192 conditions per place. [2023-08-04 09:25:43,265 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 234 transitions, 558 flow [2023-08-04 09:25:43,289 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 234 transitions, 558 flow [2023-08-04 09:25:43,289 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-04 09:25:43,289 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 234 transitions, 558 flow [2023-08-04 09:25:43,289 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 234 transitions, 558 flow [2023-08-04 09:25:43,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 234 transitions, 558 flow [2023-08-04 09:25:43,664 INFO L124 PetriNetUnfolderBase]: 891/4149 cut-off events. [2023-08-04 09:25:43,664 INFO L125 PetriNetUnfolderBase]: For 602/602 co-relation queries the response was YES. [2023-08-04 09:25:43,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4823 conditions, 4149 events. 891/4149 cut-off events. For 602/602 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 33195 event pairs, 11 based on Foata normal form. 0/3502 useless extension candidates. Maximal degree in co-relation 2466. Up to 192 conditions per place. [2023-08-04 09:25:43,758 INFO L119 LiptonReduction]: Number of co-enabled transitions 13500 [2023-08-04 09:25:48,588 INFO L134 LiptonReduction]: Checked pairs total: 26854 [2023-08-04 09:25:48,588 INFO L136 LiptonReduction]: Total number of compositions: 186 [2023-08-04 09:25:48,589 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-04 09:25:48,589 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;@46b81fb6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-04 09:25:48,590 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-08-04 09:25:48,592 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-04 09:25:48,592 INFO L124 PetriNetUnfolderBase]: 4/32 cut-off events. [2023-08-04 09:25:48,592 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-04 09:25:48,592 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:25:48,592 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:25:48,592 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:25:48,592 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:25:48,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1943845516, now seen corresponding path program 1 times [2023-08-04 09:25:48,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:25:48,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957123940] [2023-08-04 09:25:48,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:25:48,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:25:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:25:48,622 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 09:25:48,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:25:48,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957123940] [2023-08-04 09:25:48,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957123940] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:25:48,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:25:48,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-04 09:25:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021578959] [2023-08-04 09:25:48,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:25:48,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:25:48,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:25:48,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:25:48,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:25:48,634 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-04 09:25:48,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 73 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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 09:25:48,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:25:48,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-04 09:25:48,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:26:09,128 INFO L124 PetriNetUnfolderBase]: 282559/337065 cut-off events. [2023-08-04 09:26:09,128 INFO L125 PetriNetUnfolderBase]: For 35330/35330 co-relation queries the response was YES. [2023-08-04 09:26:09,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685343 conditions, 337065 events. 282559/337065 cut-off events. For 35330/35330 co-relation queries the response was YES. Maximal size of possible extension queue 6317. Compared 1588418 event pairs, 121223 based on Foata normal form. 0/188807 useless extension candidates. Maximal degree in co-relation 224681. Up to 327393 conditions per place. [2023-08-04 09:26:11,205 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 59 selfloop transitions, 2 changer transitions 3/76 dead transitions. [2023-08-04 09:26:11,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 76 transitions, 364 flow [2023-08-04 09:26:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:26:11,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:26:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2023-08-04 09:26:11,208 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48333333333333334 [2023-08-04 09:26:11,208 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 609 transitions. [2023-08-04 09:26:11,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 609 transitions. [2023-08-04 09:26:11,208 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:26:11,208 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 609 transitions. [2023-08-04 09:26:11,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 203.0) internal successors, (609), 3 states have internal predecessors, (609), 0 states have call successors, (0), 0 states 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 09:26:11,211 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:26:11,212 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:26:11,212 INFO L175 Difference]: Start difference. First operand has 61 places, 73 transitions, 236 flow. Second operand 3 states and 609 transitions. [2023-08-04 09:26:11,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 76 transitions, 364 flow [2023-08-04 09:26:11,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 76 transitions, 364 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-04 09:26:11,235 INFO L231 Difference]: Finished difference. Result has 63 places, 70 transitions, 228 flow [2023-08-04 09:26:11,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=63, PETRI_TRANSITIONS=70} [2023-08-04 09:26:11,235 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2023-08-04 09:26:11,236 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 70 transitions, 228 flow [2023-08-04 09:26:11,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 0 states 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 09:26:11,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:26:11,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:26:11,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-04 09:26:11,236 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:26:11,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:26:11,237 INFO L85 PathProgramCache]: Analyzing trace with hash -704359732, now seen corresponding path program 1 times [2023-08-04 09:26:11,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:26:11,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398687726] [2023-08-04 09:26:11,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:26:11,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:26:11,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:26:11,267 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 09:26:11,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:26:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398687726] [2023-08-04 09:26:11,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398687726] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:26:11,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960768982] [2023-08-04 09:26:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:26:11,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:26:11,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:26:11,273 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 09:26:11,276 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 09:26:11,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:26:11,354 INFO L262 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:26:11,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:26:11,359 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 09:26:11,359 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:26:11,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960768982] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:26:11,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:26:11,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:26:11,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142813114] [2023-08-04 09:26:11,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:26:11,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:26:11,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:26:11,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:26:11,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:26:11,369 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-04 09:26:11,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 70 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 09:26:11,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:26:11,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-04 09:26:11,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:26:31,086 INFO L124 PetriNetUnfolderBase]: 278801/332182 cut-off events. [2023-08-04 09:26:31,087 INFO L125 PetriNetUnfolderBase]: For 32988/32988 co-relation queries the response was YES. [2023-08-04 09:26:31,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675359 conditions, 332182 events. 278801/332182 cut-off events. For 32988/32988 co-relation queries the response was YES. Maximal size of possible extension queue 6462. Compared 1577864 event pairs, 119881 based on Foata normal form. 0/185954 useless extension candidates. Maximal degree in co-relation 675323. Up to 322814 conditions per place. [2023-08-04 09:26:32,960 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 64 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2023-08-04 09:26:32,960 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 78 transitions, 376 flow [2023-08-04 09:26:32,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:26:32,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:26:32,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 612 transitions. [2023-08-04 09:26:32,962 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4857142857142857 [2023-08-04 09:26:32,962 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 612 transitions. [2023-08-04 09:26:32,962 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 612 transitions. [2023-08-04 09:26:32,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:26:32,964 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 612 transitions. [2023-08-04 09:26:32,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 204.0) internal successors, (612), 3 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:26:32,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:26:32,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:26:32,970 INFO L175 Difference]: Start difference. First operand has 63 places, 70 transitions, 228 flow. Second operand 3 states and 612 transitions. [2023-08-04 09:26:32,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 78 transitions, 376 flow [2023-08-04 09:26:33,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 78 transitions, 362 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-04 09:26:33,080 INFO L231 Difference]: Finished difference. Result has 59 places, 71 transitions, 226 flow [2023-08-04 09:26:33,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=59, PETRI_TRANSITIONS=71} [2023-08-04 09:26:33,082 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, -2 predicate places. [2023-08-04 09:26:33,082 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 71 transitions, 226 flow [2023-08-04 09:26:33,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.66666666666666) internal successors, (557), 3 states have internal predecessors, (557), 0 states have call successors, (0), 0 states 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 09:26:33,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:26:33,083 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:26:33,090 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-08-04 09:26:33,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:26:33,288 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:26:33,289 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:26:33,289 INFO L85 PathProgramCache]: Analyzing trace with hash 57295127, now seen corresponding path program 1 times [2023-08-04 09:26:33,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:26:33,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311791141] [2023-08-04 09:26:33,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:26:33,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:26:33,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:26:33,327 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 09:26:33,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:26:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311791141] [2023-08-04 09:26:33,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311791141] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:26:33,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280530331] [2023-08-04 09:26:33,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:26:33,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:26:33,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:26:33,329 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 09:26:33,356 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 09:26:33,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:26:33,423 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:26:33,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:26:33,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 09:26:33,431 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:26:33,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280530331] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:26:33,431 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:26:33,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:26:33,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950867468] [2023-08-04 09:26:33,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:26:33,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:26:33,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:26:33,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:26:33,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:26:33,440 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-04 09:26:33,441 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 71 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:26:33,441 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:26:33,441 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-04 09:26:33,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:26:52,759 INFO L124 PetriNetUnfolderBase]: 278203/333666 cut-off events. [2023-08-04 09:26:52,760 INFO L125 PetriNetUnfolderBase]: For 16789/16789 co-relation queries the response was YES. [2023-08-04 09:26:53,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675995 conditions, 333666 events. 278203/333666 cut-off events. For 16789/16789 co-relation queries the response was YES. Maximal size of possible extension queue 7023. Compared 1660307 event pairs, 118847 based on Foata normal form. 0/187953 useless extension candidates. Maximal degree in co-relation 233318. Up to 318914 conditions per place. [2023-08-04 09:26:54,655 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 69 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2023-08-04 09:26:54,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 83 transitions, 392 flow [2023-08-04 09:26:54,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:26:54,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:26:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 616 transitions. [2023-08-04 09:26:54,658 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4888888888888889 [2023-08-04 09:26:54,658 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 616 transitions. [2023-08-04 09:26:54,658 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 616 transitions. [2023-08-04 09:26:54,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:26:54,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 616 transitions. [2023-08-04 09:26:54,660 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states 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 09:26:54,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:26:54,662 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:26:54,663 INFO L175 Difference]: Start difference. First operand has 59 places, 71 transitions, 226 flow. Second operand 3 states and 616 transitions. [2023-08-04 09:26:54,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 83 transitions, 392 flow [2023-08-04 09:26:54,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 390 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:26:54,673 INFO L231 Difference]: Finished difference. Result has 61 places, 72 transitions, 236 flow [2023-08-04 09:26:54,674 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=61, PETRI_TRANSITIONS=72} [2023-08-04 09:26:54,674 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 0 predicate places. [2023-08-04 09:26:54,674 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 72 transitions, 236 flow [2023-08-04 09:26:54,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 186.66666666666666) internal successors, (560), 3 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:26:54,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:26:54,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:26:54,681 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 09:26:54,883 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,SelfDestructingSolverStorable11 [2023-08-04 09:26:54,883 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:26:54,883 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:26:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash 49498685, now seen corresponding path program 1 times [2023-08-04 09:26:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:26:54,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109801742] [2023-08-04 09:26:54,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:26:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:26:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:26:54,926 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 09:26:54,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:26:54,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109801742] [2023-08-04 09:26:54,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109801742] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:26:54,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274074260] [2023-08-04 09:26:54,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:26:54,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:26:54,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:26:54,928 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 09:26:54,943 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 09:26:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:26:55,012 INFO L262 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:26:55,013 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:26:55,025 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 09:26:55,025 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:26:55,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274074260] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:26:55,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:26:55,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:26:55,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396672292] [2023-08-04 09:26:55,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:26:55,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:26:55,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:26:55,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:26:55,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:26:55,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-04 09:26:55,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 72 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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 09:26:55,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:26:55,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-04 09:26:55,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:27:13,407 INFO L124 PetriNetUnfolderBase]: 246598/297048 cut-off events. [2023-08-04 09:27:13,408 INFO L125 PetriNetUnfolderBase]: For 12894/12894 co-relation queries the response was YES. [2023-08-04 09:27:14,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606627 conditions, 297048 events. 246598/297048 cut-off events. For 12894/12894 co-relation queries the response was YES. Maximal size of possible extension queue 6223. Compared 1494200 event pairs, 95714 based on Foata normal form. 0/169878 useless extension candidates. Maximal degree in co-relation 225285. Up to 240767 conditions per place. [2023-08-04 09:27:15,834 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 78 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2023-08-04 09:27:15,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 92 transitions, 451 flow [2023-08-04 09:27:15,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:27:15,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:27:15,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-08-04 09:27:15,839 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2023-08-04 09:27:15,840 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-08-04 09:27:15,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-08-04 09:27:15,840 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:27:15,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-08-04 09:27:15,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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 09:27:15,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:27:15,849 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:27:15,849 INFO L175 Difference]: Start difference. First operand has 61 places, 72 transitions, 236 flow. Second operand 3 states and 624 transitions. [2023-08-04 09:27:15,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 92 transitions, 451 flow [2023-08-04 09:27:15,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 92 transitions, 449 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:27:15,912 INFO L231 Difference]: Finished difference. Result has 63 places, 73 transitions, 246 flow [2023-08-04 09:27:15,928 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=63, PETRI_TRANSITIONS=73} [2023-08-04 09:27:15,930 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 2 predicate places. [2023-08-04 09:27:15,931 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 73 transitions, 246 flow [2023-08-04 09:27:15,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 187.66666666666666) internal successors, (563), 3 states have internal predecessors, (563), 0 states have call successors, (0), 0 states 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 09:27:15,931 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:27:15,931 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:27:15,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-04 09:27:16,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-08-04 09:27:16,132 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:27:16,132 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:27:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash 936314166, now seen corresponding path program 1 times [2023-08-04 09:27:16,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:27:16,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480529918] [2023-08-04 09:27:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:27:16,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:27:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:27:16,231 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 09:27:16,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:27:16,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480529918] [2023-08-04 09:27:16,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480529918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:27:16,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084914311] [2023-08-04 09:27:16,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:27:16,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:27:16,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:27:16,237 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 09:27:16,240 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 09:27:16,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:27:16,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:27:16,357 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:27:16,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:27:16,364 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:27:16,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084914311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:27:16,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:27:16,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-08-04 09:27:16,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184612570] [2023-08-04 09:27:16,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:27:16,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:27:16,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:27:16,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:27:16,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:27:16,382 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-04 09:27:16,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 73 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:27:16,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:27:16,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-04 09:27:16,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:27:33,269 INFO L124 PetriNetUnfolderBase]: 229467/278319 cut-off events. [2023-08-04 09:27:33,269 INFO L125 PetriNetUnfolderBase]: For 25303/25303 co-relation queries the response was YES. [2023-08-04 09:27:33,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 581615 conditions, 278319 events. 229467/278319 cut-off events. For 25303/25303 co-relation queries the response was YES. Maximal size of possible extension queue 5089. Compared 1411884 event pairs, 86967 based on Foata normal form. 0/164956 useless extension candidates. Maximal degree in co-relation 229378. Up to 211355 conditions per place. [2023-08-04 09:27:35,011 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 79 selfloop transitions, 2 changer transitions 0/93 dead transitions. [2023-08-04 09:27:35,011 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 93 transitions, 463 flow [2023-08-04 09:27:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:27:35,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:27:35,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-08-04 09:27:35,013 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2023-08-04 09:27:35,013 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-08-04 09:27:35,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-08-04 09:27:35,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:27:35,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-08-04 09:27:35,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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 09:27:35,016 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:27:35,016 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:27:35,016 INFO L175 Difference]: Start difference. First operand has 63 places, 73 transitions, 246 flow. Second operand 3 states and 624 transitions. [2023-08-04 09:27:35,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 93 transitions, 463 flow [2023-08-04 09:27:35,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 93 transitions, 461 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:27:35,442 INFO L231 Difference]: Finished difference. Result has 65 places, 74 transitions, 256 flow [2023-08-04 09:27:35,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=65, PETRI_TRANSITIONS=74} [2023-08-04 09:27:35,443 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 4 predicate places. [2023-08-04 09:27:35,443 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 74 transitions, 256 flow [2023-08-04 09:27:35,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 189.0) internal successors, (567), 3 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:27:35,443 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:27:35,443 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:27:35,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-08-04 09:27:35,645 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,SelfDestructingSolverStorable13 [2023-08-04 09:27:35,645 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:27:35,646 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:27:35,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1760021158, now seen corresponding path program 1 times [2023-08-04 09:27:35,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:27:35,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106036340] [2023-08-04 09:27:35,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:27:35,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:27:35,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:27:35,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-08-04 09:27:35,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:27:35,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106036340] [2023-08-04 09:27:35,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106036340] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:27:35,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097646035] [2023-08-04 09:27:35,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:27:35,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:27:35,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:27:35,691 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 09:27:35,720 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 09:27:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:27:35,800 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-04 09:27:35,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:27:35,811 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 09:27:35,812 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-04 09:27:35,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2097646035] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:27:35,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-04 09:27:35,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2023-08-04 09:27:35,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365977264] [2023-08-04 09:27:35,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:27:35,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:27:35,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:27:35,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:27:35,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:27:35,823 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 420 [2023-08-04 09:27:35,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 74 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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 09:27:35,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:27:35,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 420 [2023-08-04 09:27:35,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:27:52,995 INFO L124 PetriNetUnfolderBase]: 228401/277734 cut-off events. [2023-08-04 09:27:52,995 INFO L125 PetriNetUnfolderBase]: For 27703/27703 co-relation queries the response was YES. [2023-08-04 09:27:53,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 587989 conditions, 277734 events. 228401/277734 cut-off events. For 27703/27703 co-relation queries the response was YES. Maximal size of possible extension queue 4989. Compared 1413978 event pairs, 100117 based on Foata normal form. 0/167999 useless extension candidates. Maximal degree in co-relation 315843. Up to 241882 conditions per place. [2023-08-04 09:27:54,572 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 80 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-08-04 09:27:54,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 475 flow [2023-08-04 09:27:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:27:54,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:27:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-08-04 09:27:54,574 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49523809523809526 [2023-08-04 09:27:54,574 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-08-04 09:27:54,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-08-04 09:27:54,575 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:27:54,575 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-08-04 09:27:54,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 0 states have call successors, (0), 0 states 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 09:27:54,578 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:27:54,579 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:27:54,579 INFO L175 Difference]: Start difference. First operand has 65 places, 74 transitions, 256 flow. Second operand 3 states and 624 transitions. [2023-08-04 09:27:54,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 475 flow [2023-08-04 09:27:58,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 94 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:27:58,018 INFO L231 Difference]: Finished difference. Result has 67 places, 75 transitions, 266 flow [2023-08-04 09:27:58,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=67, PETRI_TRANSITIONS=75} [2023-08-04 09:27:58,019 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 6 predicate places. [2023-08-04 09:27:58,019 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 75 transitions, 266 flow [2023-08-04 09:27:58,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 0 states have call successors, (0), 0 states 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 09:27:58,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:27:58,020 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:27:58,024 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 09:27:58,220 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,SelfDestructingSolverStorable14 [2023-08-04 09:27:58,221 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:27:58,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:27:58,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1377484686, now seen corresponding path program 1 times [2023-08-04 09:27:58,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:27:58,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643310738] [2023-08-04 09:27:58,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:27:58,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:27:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:27:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 09:27:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:27:58,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643310738] [2023-08-04 09:27:58,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643310738] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:27:58,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765244554] [2023-08-04 09:27:58,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:27:58,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:27:58,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:27:58,285 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 09:27:58,289 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 09:27:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:27:58,387 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:27:58,391 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:27:58,402 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 09:27:58,402 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:27:58,416 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-08-04 09:27:58,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765244554] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:27:58,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:27:58,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:27:58,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510896145] [2023-08-04 09:27:58,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:27:58,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:27:58,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:27:58,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:27:58,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:27:58,432 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-04 09:27:58,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 75 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 187.6) internal successors, (938), 5 states have internal predecessors, (938), 0 states have call successors, (0), 0 states 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 09:27:58,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:27:58,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-04 09:27:58,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:28:14,685 INFO L124 PetriNetUnfolderBase]: 213305/259296 cut-off events. [2023-08-04 09:28:14,686 INFO L125 PetriNetUnfolderBase]: For 24218/24218 co-relation queries the response was YES. [2023-08-04 09:28:15,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551376 conditions, 259296 events. 213305/259296 cut-off events. For 24218/24218 co-relation queries the response was YES. Maximal size of possible extension queue 4968. Compared 1321068 event pairs, 77387 based on Foata normal form. 3/157638 useless extension candidates. Maximal degree in co-relation 466459. Up to 250738 conditions per place. [2023-08-04 09:28:16,184 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 67 selfloop transitions, 3 changer transitions 1/83 dead transitions. [2023-08-04 09:28:16,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 83 transitions, 424 flow [2023-08-04 09:28:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:28:16,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:28:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 791 transitions. [2023-08-04 09:28:16,186 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4708333333333333 [2023-08-04 09:28:16,186 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 791 transitions. [2023-08-04 09:28:16,186 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 791 transitions. [2023-08-04 09:28:16,187 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:28:16,187 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 791 transitions. [2023-08-04 09:28:16,188 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 197.75) internal successors, (791), 4 states have internal predecessors, (791), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:28:16,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:28:16,192 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:28:16,192 INFO L175 Difference]: Start difference. First operand has 67 places, 75 transitions, 266 flow. Second operand 4 states and 791 transitions. [2023-08-04 09:28:16,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 83 transitions, 424 flow [2023-08-04 09:28:20,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 83 transitions, 422 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-04 09:28:20,960 INFO L231 Difference]: Finished difference. Result has 71 places, 75 transitions, 278 flow [2023-08-04 09:28:20,960 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=71, PETRI_TRANSITIONS=75} [2023-08-04 09:28:20,961 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 10 predicate places. [2023-08-04 09:28:20,961 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 75 transitions, 278 flow [2023-08-04 09:28:20,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 187.6) internal successors, (938), 5 states have internal predecessors, (938), 0 states have call successors, (0), 0 states 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 09:28:20,962 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:28:20,962 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:28:20,968 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 09:28:21,166 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,SelfDestructingSolverStorable15 [2023-08-04 09:28:21,167 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:28:21,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:28:21,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1870632209, now seen corresponding path program 1 times [2023-08-04 09:28:21,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:28:21,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482297918] [2023-08-04 09:28:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:28:21,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:28:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:28:21,221 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 09:28:21,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:28:21,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482297918] [2023-08-04 09:28:21,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482297918] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:28:21,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610551255] [2023-08-04 09:28:21,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:28:21,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:28:21,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:28:21,223 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 09:28:21,229 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 09:28:21,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:28:21,325 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:28:21,326 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:28:21,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 09:28:21,338 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:28:21,352 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-04 09:28:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610551255] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:28:21,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:28:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:28:21,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36821724] [2023-08-04 09:28:21,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:28:21,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:28:21,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:28:21,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:28:21,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:28:21,366 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-04 09:28:21,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 75 transitions, 278 flow. Second operand has 5 states, 5 states have (on average 187.8) internal successors, (939), 5 states have internal predecessors, (939), 0 states have call successors, (0), 0 states 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 09:28:21,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:28:21,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-04 09:28:21,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:28:38,038 INFO L124 PetriNetUnfolderBase]: 200726/244116 cut-off events. [2023-08-04 09:28:38,038 INFO L125 PetriNetUnfolderBase]: For 19806/19806 co-relation queries the response was YES. [2023-08-04 09:28:38,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518759 conditions, 244116 events. 200726/244116 cut-off events. For 19806/19806 co-relation queries the response was YES. Maximal size of possible extension queue 4829. Compared 1250572 event pairs, 73555 based on Foata normal form. 27/148623 useless extension candidates. Maximal degree in co-relation 434535. Up to 234954 conditions per place. [2023-08-04 09:28:39,490 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 75 selfloop transitions, 3 changer transitions 1/91 dead transitions. [2023-08-04 09:28:39,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 91 transitions, 468 flow [2023-08-04 09:28:39,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:28:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:28:39,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 799 transitions. [2023-08-04 09:28:39,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47559523809523807 [2023-08-04 09:28:39,492 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 799 transitions. [2023-08-04 09:28:39,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 799 transitions. [2023-08-04 09:28:39,493 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:28:39,493 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 799 transitions. [2023-08-04 09:28:39,494 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 199.75) internal successors, (799), 4 states have internal predecessors, (799), 0 states have call successors, (0), 0 states 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 09:28:39,496 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:28:39,497 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:28:39,497 INFO L175 Difference]: Start difference. First operand has 71 places, 75 transitions, 278 flow. Second operand 4 states and 799 transitions. [2023-08-04 09:28:39,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 91 transitions, 468 flow [2023-08-04 09:28:44,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 91 transitions, 458 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:28:44,041 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 282 flow [2023-08-04 09:28:44,041 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=282, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2023-08-04 09:28:44,042 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 12 predicate places. [2023-08-04 09:28:44,042 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 282 flow [2023-08-04 09:28:44,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 187.8) internal successors, (939), 5 states have internal predecessors, (939), 0 states have call successors, (0), 0 states 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 09:28:44,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:28:44,055 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:28:44,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-08-04 09:28:44,259 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,SelfDestructingSolverStorable16 [2023-08-04 09:28:44,260 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:28:44,260 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:28:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1617693311, now seen corresponding path program 1 times [2023-08-04 09:28:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:28:44,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487195708] [2023-08-04 09:28:44,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:28:44,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:28:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:28:44,352 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:28:44,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:28:44,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487195708] [2023-08-04 09:28:44,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487195708] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:28:44,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888229206] [2023-08-04 09:28:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:28:44,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:28:44,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:28:44,357 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 09:28:44,365 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 09:28:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:28:44,465 INFO L262 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:28:44,466 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:28:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:28:44,477 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:28:44,488 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-04 09:28:44,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1888229206] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:28:44,489 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:28:44,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:28:44,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680407986] [2023-08-04 09:28:44,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:28:44,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:28:44,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:28:44,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:28:44,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:28:44,501 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-04 09:28:44,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 282 flow. Second operand has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 09:28:44,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:28:44,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-04 09:28:44,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:00,097 INFO L124 PetriNetUnfolderBase]: 194489/236502 cut-off events. [2023-08-04 09:29:00,097 INFO L125 PetriNetUnfolderBase]: For 17766/17766 co-relation queries the response was YES. [2023-08-04 09:29:00,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500225 conditions, 236502 events. 194489/236502 cut-off events. For 17766/17766 co-relation queries the response was YES. Maximal size of possible extension queue 5074. Compared 1226547 event pairs, 68111 based on Foata normal form. 243/144141 useless extension candidates. Maximal degree in co-relation 416483. Up to 212649 conditions per place. [2023-08-04 09:29:01,449 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 83 selfloop transitions, 3 changer transitions 1/99 dead transitions. [2023-08-04 09:29:01,449 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 99 transitions, 504 flow [2023-08-04 09:29:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:29:01,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:29:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 807 transitions. [2023-08-04 09:29:01,452 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48035714285714287 [2023-08-04 09:29:01,452 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 807 transitions. [2023-08-04 09:29:01,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 807 transitions. [2023-08-04 09:29:01,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:01,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 807 transitions. [2023-08-04 09:29:01,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 201.75) internal successors, (807), 4 states have internal predecessors, (807), 0 states have call successors, (0), 0 states 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 09:29:01,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:29:01,456 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:29:01,456 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 282 flow. Second operand 4 states and 807 transitions. [2023-08-04 09:29:01,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 99 transitions, 504 flow [2023-08-04 09:29:06,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 99 transitions, 494 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:29:06,005 INFO L231 Difference]: Finished difference. Result has 75 places, 75 transitions, 286 flow [2023-08-04 09:29:06,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=75, PETRI_TRANSITIONS=75} [2023-08-04 09:29:06,005 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 14 predicate places. [2023-08-04 09:29:06,005 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 75 transitions, 286 flow [2023-08-04 09:29:06,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.0) internal successors, (940), 5 states have internal predecessors, (940), 0 states have call successors, (0), 0 states 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 09:29:06,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:06,006 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:06,011 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 09:29:06,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:06,206 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:06,207 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:06,207 INFO L85 PathProgramCache]: Analyzing trace with hash -1373640878, now seen corresponding path program 1 times [2023-08-04 09:29:06,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:06,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450074788] [2023-08-04 09:29:06,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:06,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:06,311 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:29:06,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450074788] [2023-08-04 09:29:06,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450074788] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:06,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298850064] [2023-08-04 09:29:06,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:06,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:06,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:06,312 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:29:06,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-08-04 09:29:06,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:06,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:29:06,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:29:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:29:06,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:29:06,454 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-08-04 09:29:06,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298850064] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:29:06,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:29:06,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:29:06,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671604917] [2023-08-04 09:29:06,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:29:06,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:29:06,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:06,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:29:06,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:29:06,467 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-04 09:29:06,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 75 transitions, 286 flow. Second operand has 5 states, 5 states have (on average 188.2) internal successors, (941), 5 states have internal predecessors, (941), 0 states have call successors, (0), 0 states 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 09:29:06,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:06,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-04 09:29:06,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:16,085 INFO L124 PetriNetUnfolderBase]: 121202/148230 cut-off events. [2023-08-04 09:29:16,085 INFO L125 PetriNetUnfolderBase]: For 17502/17502 co-relation queries the response was YES. [2023-08-04 09:29:16,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313224 conditions, 148230 events. 121202/148230 cut-off events. For 17502/17502 co-relation queries the response was YES. Maximal size of possible extension queue 2634. Compared 720273 event pairs, 29065 based on Foata normal form. 1458/91500 useless extension candidates. Maximal degree in co-relation 292334. Up to 71816 conditions per place. [2023-08-04 09:29:16,914 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 91 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2023-08-04 09:29:16,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 107 transitions, 553 flow [2023-08-04 09:29:16,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:29:16,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:29:16,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 815 transitions. [2023-08-04 09:29:16,916 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-04 09:29:16,916 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 815 transitions. [2023-08-04 09:29:16,916 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 815 transitions. [2023-08-04 09:29:16,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:16,916 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 815 transitions. [2023-08-04 09:29:16,917 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 203.75) internal successors, (815), 4 states have internal predecessors, (815), 0 states have call successors, (0), 0 states 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 09:29:16,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:29:16,919 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:29:16,919 INFO L175 Difference]: Start difference. First operand has 75 places, 75 transitions, 286 flow. Second operand 4 states and 815 transitions. [2023-08-04 09:29:16,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 107 transitions, 553 flow [2023-08-04 09:29:18,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 107 transitions, 542 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-04 09:29:18,794 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 296 flow [2023-08-04 09:29:18,794 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2023-08-04 09:29:18,795 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 16 predicate places. [2023-08-04 09:29:18,795 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 296 flow [2023-08-04 09:29:18,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.2) internal successors, (941), 5 states have internal predecessors, (941), 0 states have call successors, (0), 0 states 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 09:29:18,795 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:18,795 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:18,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-08-04 09:29:18,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:18,996 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:18,996 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:18,996 INFO L85 PathProgramCache]: Analyzing trace with hash -97056173, now seen corresponding path program 1 times [2023-08-04 09:29:18,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:18,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555272460] [2023-08-04 09:29:18,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-08-04 09:29:19,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555272460] [2023-08-04 09:29:19,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555272460] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:19,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934029175] [2023-08-04 09:29:19,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:19,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:19,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:19,063 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:29:19,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-08-04 09:29:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:19,189 INFO L262 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:29:19,190 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:29:19,203 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-08-04 09:29:19,204 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:29:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-08-04 09:29:19,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934029175] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:29:19,224 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:29:19,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-08-04 09:29:19,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616289422] [2023-08-04 09:29:19,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:29:19,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:29:19,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:19,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:29:19,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:29:19,236 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-04 09:29:19,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 188.6) internal successors, (943), 5 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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 09:29:19,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:19,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-04 09:29:19,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:28,287 INFO L124 PetriNetUnfolderBase]: 115307/140698 cut-off events. [2023-08-04 09:29:28,287 INFO L125 PetriNetUnfolderBase]: For 34004/34004 co-relation queries the response was YES. [2023-08-04 09:29:28,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 308597 conditions, 140698 events. 115307/140698 cut-off events. For 34004/34004 co-relation queries the response was YES. Maximal size of possible extension queue 2634. Compared 674602 event pairs, 44506 based on Foata normal form. 694/85904 useless extension candidates. Maximal degree in co-relation 305499. Up to 101420 conditions per place. [2023-08-04 09:29:29,268 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 92 selfloop transitions, 4 changer transitions 0/108 dead transitions. [2023-08-04 09:29:29,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 108 transitions, 564 flow [2023-08-04 09:29:29,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:29:29,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:29:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 815 transitions. [2023-08-04 09:29:29,271 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-04 09:29:29,271 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 815 transitions. [2023-08-04 09:29:29,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 815 transitions. [2023-08-04 09:29:29,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:29,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 815 transitions. [2023-08-04 09:29:29,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 203.75) internal successors, (815), 4 states have internal predecessors, (815), 0 states have call successors, (0), 0 states 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 09:29:29,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:29:29,275 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:29:29,275 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 296 flow. Second operand 4 states and 815 transitions. [2023-08-04 09:29:29,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 108 transitions, 564 flow [2023-08-04 09:29:31,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 108 transitions, 560 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:29:31,004 INFO L231 Difference]: Finished difference. Result has 81 places, 77 transitions, 312 flow [2023-08-04 09:29:31,005 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=81, PETRI_TRANSITIONS=77} [2023-08-04 09:29:31,005 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 20 predicate places. [2023-08-04 09:29:31,005 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 77 transitions, 312 flow [2023-08-04 09:29:31,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 188.6) internal successors, (943), 5 states have internal predecessors, (943), 0 states have call successors, (0), 0 states 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 09:29:31,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:31,005 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:31,010 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2023-08-04 09:29:31,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:31,206 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:31,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:31,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1438050337, now seen corresponding path program 1 times [2023-08-04 09:29:31,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:31,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762508821] [2023-08-04 09:29:31,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:31,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:31,278 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-04 09:29:31,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:31,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762508821] [2023-08-04 09:29:31,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762508821] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:31,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803457342] [2023-08-04 09:29:31,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:31,279 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:31,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:31,280 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:29:31,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-08-04 09:29:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:31,407 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-04 09:29:31,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:29:31,419 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-04 09:29:31,419 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:29:31,431 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-04 09:29:31,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803457342] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:29:31,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:29:31,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2023-08-04 09:29:31,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893802498] [2023-08-04 09:29:31,432 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:29:31,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:29:31,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:31,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:29:31,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:29:31,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 420 [2023-08-04 09:29:31,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 77 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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 09:29:31,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:31,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 420 [2023-08-04 09:29:31,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:41,030 INFO L124 PetriNetUnfolderBase]: 115283/140657 cut-off events. [2023-08-04 09:29:41,031 INFO L125 PetriNetUnfolderBase]: For 33870/33870 co-relation queries the response was YES. [2023-08-04 09:29:41,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 313746 conditions, 140657 events. 115283/140657 cut-off events. For 33870/33870 co-relation queries the response was YES. Maximal size of possible extension queue 2634. Compared 674463 event pairs, 57259 based on Foata normal form. 19/85200 useless extension candidates. Maximal degree in co-relation 310592. Up to 134406 conditions per place. [2023-08-04 09:29:41,789 INFO L140 encePairwiseOnDemand]: 416/420 looper letters, 91 selfloop transitions, 3 changer transitions 3/109 dead transitions. [2023-08-04 09:29:41,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 109 transitions, 582 flow [2023-08-04 09:29:41,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-04 09:29:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-04 09:29:41,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 815 transitions. [2023-08-04 09:29:41,791 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4851190476190476 [2023-08-04 09:29:41,791 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 815 transitions. [2023-08-04 09:29:41,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 815 transitions. [2023-08-04 09:29:41,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:41,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 815 transitions. [2023-08-04 09:29:41,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 203.75) internal successors, (815), 4 states have internal predecessors, (815), 0 states have call successors, (0), 0 states 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 09:29:41,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:29:41,794 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 420.0) internal successors, (2100), 5 states have internal predecessors, (2100), 0 states have call successors, (0), 0 states 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 09:29:41,794 INFO L175 Difference]: Start difference. First operand has 81 places, 77 transitions, 312 flow. Second operand 4 states and 815 transitions. [2023-08-04 09:29:41,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 109 transitions, 582 flow [2023-08-04 09:29:45,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 109 transitions, 578 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:29:45,414 INFO L231 Difference]: Finished difference. Result has 85 places, 75 transitions, 310 flow [2023-08-04 09:29:45,414 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=85, PETRI_TRANSITIONS=75} [2023-08-04 09:29:45,414 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 24 predicate places. [2023-08-04 09:29:45,414 INFO L495 AbstractCegarLoop]: Abstraction has has 85 places, 75 transitions, 310 flow [2023-08-04 09:29:45,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 189.0) internal successors, (945), 5 states have internal predecessors, (945), 0 states have call successors, (0), 0 states 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 09:29:45,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:45,415 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:45,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-08-04 09:29:45,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:45,615 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:45,616 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:45,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1101764227, now seen corresponding path program 1 times [2023-08-04 09:29:45,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:45,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522669161] [2023-08-04 09:29:45,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:45,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:45,862 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-08-04 09:29:45,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:45,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522669161] [2023-08-04 09:29:45,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522669161] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-04 09:29:45,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-04 09:29:45,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-04 09:29:45,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759417773] [2023-08-04 09:29:45,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:29:45,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-04 09:29:45,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:45,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-04 09:29:45,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-04 09:29:45,911 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 420 [2023-08-04 09:29:45,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 75 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:29:45,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:45,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 420 [2023-08-04 09:29:45,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:29:53,593 INFO L124 PetriNetUnfolderBase]: 92554/111835 cut-off events. [2023-08-04 09:29:53,593 INFO L125 PetriNetUnfolderBase]: For 25645/25645 co-relation queries the response was YES. [2023-08-04 09:29:53,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244314 conditions, 111835 events. 92554/111835 cut-off events. For 25645/25645 co-relation queries the response was YES. Maximal size of possible extension queue 2311. Compared 504149 event pairs, 45875 based on Foata normal form. 1/66584 useless extension candidates. Maximal degree in co-relation 244047. Up to 107740 conditions per place. [2023-08-04 09:29:54,241 INFO L140 encePairwiseOnDemand]: 417/420 looper letters, 62 selfloop transitions, 2 changer transitions 0/76 dead transitions. [2023-08-04 09:29:54,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 76 transitions, 440 flow [2023-08-04 09:29:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-04 09:29:54,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-04 09:29:54,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 596 transitions. [2023-08-04 09:29:54,243 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.473015873015873 [2023-08-04 09:29:54,243 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 596 transitions. [2023-08-04 09:29:54,243 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 596 transitions. [2023-08-04 09:29:54,244 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:29:54,244 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 596 transitions. [2023-08-04 09:29:54,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states 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 09:29:54,246 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:29:54,246 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 420.0) internal successors, (1680), 4 states have internal predecessors, (1680), 0 states have call successors, (0), 0 states 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 09:29:54,246 INFO L175 Difference]: Start difference. First operand has 85 places, 75 transitions, 310 flow. Second operand 3 states and 596 transitions. [2023-08-04 09:29:54,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 76 transitions, 440 flow [2023-08-04 09:29:56,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 76 transitions, 430 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-04 09:29:56,151 INFO L231 Difference]: Finished difference. Result has 84 places, 76 transitions, 312 flow [2023-08-04 09:29:56,151 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=312, PETRI_PLACES=84, PETRI_TRANSITIONS=76} [2023-08-04 09:29:56,152 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 23 predicate places. [2023-08-04 09:29:56,152 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 76 transitions, 312 flow [2023-08-04 09:29:56,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 191.66666666666666) internal successors, (575), 3 states have internal predecessors, (575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:29:56,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:29:56,152 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:29:56,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-08-04 09:29:56,152 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:29:56,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:29:56,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1115610082, now seen corresponding path program 1 times [2023-08-04 09:29:56,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:29:56,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849225186] [2023-08-04 09:29:56,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:56,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:29:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:56,272 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-04 09:29:56,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:29:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849225186] [2023-08-04 09:29:56,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849225186] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:56,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480154337] [2023-08-04 09:29:56,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:29:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:29:56,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:29:56,277 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:29:56,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-08-04 09:29:56,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:29:56,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 09:29:56,425 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:29:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-04 09:29:56,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:29:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-08-04 09:29:56,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480154337] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 09:29:56,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 09:29:56,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-08-04 09:29:56,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570079639] [2023-08-04 09:29:56,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:29:56,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:29:56,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:29:56,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:29:56,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 09:29:56,562 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 420 [2023-08-04 09:29:56,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 76 transitions, 312 flow. Second operand has 5 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 0 states have call successors, (0), 0 states 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 09:29:56,563 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:29:56,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 420 [2023-08-04 09:29:56,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:06,293 INFO L124 PetriNetUnfolderBase]: 112829/136103 cut-off events. [2023-08-04 09:30:06,294 INFO L125 PetriNetUnfolderBase]: For 30814/30814 co-relation queries the response was YES. [2023-08-04 09:30:06,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297233 conditions, 136103 events. 112829/136103 cut-off events. For 30814/30814 co-relation queries the response was YES. Maximal size of possible extension queue 2761. Compared 637322 event pairs, 45876 based on Foata normal form. 0/84774 useless extension candidates. Maximal degree in co-relation 297207. Up to 103991 conditions per place. [2023-08-04 09:30:07,199 INFO L140 encePairwiseOnDemand]: 415/420 looper letters, 114 selfloop transitions, 4 changer transitions 0/129 dead transitions. [2023-08-04 09:30:07,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 129 transitions, 782 flow [2023-08-04 09:30:07,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:30:07,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:30:07,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 978 transitions. [2023-08-04 09:30:07,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4657142857142857 [2023-08-04 09:30:07,202 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 978 transitions. [2023-08-04 09:30:07,202 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 978 transitions. [2023-08-04 09:30:07,202 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:07,202 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 978 transitions. [2023-08-04 09:30:07,204 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.6) internal successors, (978), 5 states have internal predecessors, (978), 0 states have call successors, (0), 0 states 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 09:30:07,206 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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 09:30:07,206 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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 09:30:07,206 INFO L175 Difference]: Start difference. First operand has 84 places, 76 transitions, 312 flow. Second operand 5 states and 978 transitions. [2023-08-04 09:30:07,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 129 transitions, 782 flow [2023-08-04 09:30:08,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 129 transitions, 778 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-04 09:30:08,727 INFO L231 Difference]: Finished difference. Result has 88 places, 77 transitions, 324 flow [2023-08-04 09:30:08,727 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=324, PETRI_PLACES=88, PETRI_TRANSITIONS=77} [2023-08-04 09:30:08,727 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 27 predicate places. [2023-08-04 09:30:08,728 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 77 transitions, 324 flow [2023-08-04 09:30:08,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 0 states have call successors, (0), 0 states 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 09:30:08,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:08,728 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:08,733 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:08,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:08,929 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:08,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:08,929 INFO L85 PathProgramCache]: Analyzing trace with hash -260451457, now seen corresponding path program 1 times [2023-08-04 09:30:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:08,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415750560] [2023-08-04 09:30:08,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:08,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-08-04 09:30:09,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415750560] [2023-08-04 09:30:09,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415750560] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:09,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004543463] [2023-08-04 09:30:09,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:09,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:09,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:09,088 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:09,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-08-04 09:30:09,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:09,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-04 09:30:09,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-08-04 09:30:09,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:09,301 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2023-08-04 09:30:09,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004543463] provided 1 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:09,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-08-04 09:30:09,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-08-04 09:30:09,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30307972] [2023-08-04 09:30:09,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-04 09:30:09,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:30:09,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:09,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:30:09,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-04 09:30:09,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 420 [2023-08-04 09:30:09,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 77 transitions, 324 flow. Second operand has 5 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 0 states have call successors, (0), 0 states 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 09:30:09,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:09,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 420 [2023-08-04 09:30:09,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:18,718 INFO L124 PetriNetUnfolderBase]: 107931/131203 cut-off events. [2023-08-04 09:30:18,718 INFO L125 PetriNetUnfolderBase]: For 41145/46051 co-relation queries the response was YES. [2023-08-04 09:30:19,143 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307319 conditions, 131203 events. 107931/131203 cut-off events. For 41145/46051 co-relation queries the response was YES. Maximal size of possible extension queue 2539. Compared 628399 event pairs, 45881 based on Foata normal form. 4906/89680 useless extension candidates. Maximal degree in co-relation 307284. Up to 100132 conditions per place. [2023-08-04 09:30:19,555 INFO L140 encePairwiseOnDemand]: 415/420 looper letters, 113 selfloop transitions, 4 changer transitions 0/128 dead transitions. [2023-08-04 09:30:19,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 128 transitions, 792 flow [2023-08-04 09:30:19,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-04 09:30:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-04 09:30:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 976 transitions. [2023-08-04 09:30:19,559 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46476190476190476 [2023-08-04 09:30:19,559 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 976 transitions. [2023-08-04 09:30:19,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 976 transitions. [2023-08-04 09:30:19,559 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:19,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 976 transitions. [2023-08-04 09:30:19,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 195.2) internal successors, (976), 5 states have internal predecessors, (976), 0 states have call successors, (0), 0 states 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 09:30:19,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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 09:30:19,563 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 420.0) internal successors, (2520), 6 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states 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 09:30:19,563 INFO L175 Difference]: Start difference. First operand has 88 places, 77 transitions, 324 flow. Second operand 5 states and 976 transitions. [2023-08-04 09:30:19,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 128 transitions, 792 flow [2023-08-04 09:30:20,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 128 transitions, 781 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-04 09:30:20,878 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 332 flow [2023-08-04 09:30:20,878 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=332, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2023-08-04 09:30:20,879 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 29 predicate places. [2023-08-04 09:30:20,879 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 332 flow [2023-08-04 09:30:20,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 182.2) internal successors, (911), 5 states have internal predecessors, (911), 0 states have call successors, (0), 0 states 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 09:30:20,879 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:20,879 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:20,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-08-04 09:30:21,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:21,085 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:21,085 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:21,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1128509352, now seen corresponding path program 1 times [2023-08-04 09:30:21,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:21,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672153287] [2023-08-04 09:30:21,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:21,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:21,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-08-04 09:30:21,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672153287] [2023-08-04 09:30:21,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672153287] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:21,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389578792] [2023-08-04 09:30:21,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:21,257 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:21,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:21,261 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:21,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-08-04 09:30:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:21,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-04 09:30:21,407 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:21,510 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-08-04 09:30:21,510 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:21,586 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-08-04 09:30:21,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389578792] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:30:21,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:30:21,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2023-08-04 09:30:21,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813801921] [2023-08-04 09:30:21,587 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:30:21,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-04 09:30:21,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:21,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-04 09:30:21,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-08-04 09:30:21,937 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 420 [2023-08-04 09:30:21,938 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 332 flow. Second operand has 14 states, 14 states have (on average 172.78571428571428) internal successors, (2419), 14 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states 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 09:30:21,938 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:21,938 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 420 [2023-08-04 09:30:21,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:30:38,968 INFO L124 PetriNetUnfolderBase]: 181820/222146 cut-off events. [2023-08-04 09:30:38,968 INFO L125 PetriNetUnfolderBase]: For 87239/105434 co-relation queries the response was YES. [2023-08-04 09:30:39,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548099 conditions, 222146 events. 181820/222146 cut-off events. For 87239/105434 co-relation queries the response was YES. Maximal size of possible extension queue 3944. Compared 1145117 event pairs, 14736 based on Foata normal form. 18195/170896 useless extension candidates. Maximal degree in co-relation 548063. Up to 74015 conditions per place. [2023-08-04 09:30:40,489 INFO L140 encePairwiseOnDemand]: 411/420 looper letters, 398 selfloop transitions, 18 changer transitions 0/426 dead transitions. [2023-08-04 09:30:40,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 426 transitions, 2664 flow [2023-08-04 09:30:40,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-04 09:30:40,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-04 09:30:40,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2553 transitions. [2023-08-04 09:30:40,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4675824175824176 [2023-08-04 09:30:40,494 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2553 transitions. [2023-08-04 09:30:40,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2553 transitions. [2023-08-04 09:30:40,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:30:40,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2553 transitions. [2023-08-04 09:30:40,499 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 196.3846153846154) internal successors, (2553), 13 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states 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 09:30:40,504 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 420.0) internal successors, (5880), 14 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states 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 09:30:40,504 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 420.0) internal successors, (5880), 14 states have internal predecessors, (5880), 0 states have call successors, (0), 0 states 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 09:30:40,504 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 332 flow. Second operand 13 states and 2553 transitions. [2023-08-04 09:30:40,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 426 transitions, 2664 flow [2023-08-04 09:30:44,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 426 transitions, 2632 flow, removed 9 selfloop flow, removed 3 redundant places. [2023-08-04 09:30:44,892 INFO L231 Difference]: Finished difference. Result has 105 places, 94 transitions, 438 flow [2023-08-04 09:30:44,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=438, PETRI_PLACES=105, PETRI_TRANSITIONS=94} [2023-08-04 09:30:44,893 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 44 predicate places. [2023-08-04 09:30:44,893 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 94 transitions, 438 flow [2023-08-04 09:30:44,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 172.78571428571428) internal successors, (2419), 14 states have internal predecessors, (2419), 0 states have call successors, (0), 0 states 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 09:30:44,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:30:44,893 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:30:44,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-08-04 09:30:45,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-08-04 09:30:45,100 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:30:45,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:30:45,100 INFO L85 PathProgramCache]: Analyzing trace with hash -2018454430, now seen corresponding path program 1 times [2023-08-04 09:30:45,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:30:45,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926877227] [2023-08-04 09:30:45,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:45,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:30:45,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:45,181 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-08-04 09:30:45,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:30:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926877227] [2023-08-04 09:30:45,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926877227] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:30:45,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1139070581] [2023-08-04 09:30:45,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:30:45,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:30:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:30:45,183 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:30:45,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-08-04 09:30:45,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:30:45,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-04 09:30:45,330 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:30:45,348 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-08-04 09:30:45,348 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:30:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2023-08-04 09:30:45,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1139070581] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:30:45,372 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:30:45,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-08-04 09:30:45,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265536839] [2023-08-04 09:30:45,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:30:45,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-04 09:30:45,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:30:45,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-04 09:30:45,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-04 09:30:45,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 420 [2023-08-04 09:30:45,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 94 transitions, 438 flow. Second operand has 5 states, 5 states have (on average 183.2) internal successors, (916), 5 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:30:45,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:30:45,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 420 [2023-08-04 09:30:45,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:31:07,705 INFO L124 PetriNetUnfolderBase]: 212833/263354 cut-off events. [2023-08-04 09:31:07,706 INFO L125 PetriNetUnfolderBase]: For 290205/316521 co-relation queries the response was YES. [2023-08-04 09:31:08,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769392 conditions, 263354 events. 212833/263354 cut-off events. For 290205/316521 co-relation queries the response was YES. Maximal size of possible extension queue 4855. Compared 1423326 event pairs, 30110 based on Foata normal form. 26316/224199 useless extension candidates. Maximal degree in co-relation 769349. Up to 173710 conditions per place. [2023-08-04 09:31:09,998 INFO L140 encePairwiseOnDemand]: 415/420 looper letters, 203 selfloop transitions, 13 changer transitions 0/227 dead transitions. [2023-08-04 09:31:09,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 227 transitions, 1482 flow [2023-08-04 09:31:09,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-04 09:31:09,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-04 09:31:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1206 transitions. [2023-08-04 09:31:10,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4785714285714286 [2023-08-04 09:31:10,000 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1206 transitions. [2023-08-04 09:31:10,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1206 transitions. [2023-08-04 09:31:10,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:31:10,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1206 transitions. [2023-08-04 09:31:10,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 201.0) internal successors, (1206), 6 states have internal predecessors, (1206), 0 states have call successors, (0), 0 states 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 09:31:10,004 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states 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 09:31:10,004 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 420.0) internal successors, (2940), 7 states have internal predecessors, (2940), 0 states have call successors, (0), 0 states 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 09:31:10,004 INFO L175 Difference]: Start difference. First operand has 105 places, 94 transitions, 438 flow. Second operand 6 states and 1206 transitions. [2023-08-04 09:31:10,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 227 transitions, 1482 flow [2023-08-04 09:31:20,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 227 transitions, 1447 flow, removed 16 selfloop flow, removed 2 redundant places. [2023-08-04 09:31:20,827 INFO L231 Difference]: Finished difference. Result has 110 places, 101 transitions, 494 flow [2023-08-04 09:31:20,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=420, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=494, PETRI_PLACES=110, PETRI_TRANSITIONS=101} [2023-08-04 09:31:20,828 INFO L281 CegarLoopForPetriNet]: 61 programPoint places, 49 predicate places. [2023-08-04 09:31:20,828 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 101 transitions, 494 flow [2023-08-04 09:31:20,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 183.2) internal successors, (916), 5 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-04 09:31:20,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-04 09:31:20,828 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:31:20,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2023-08-04 09:31:21,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-08-04 09:31:21,029 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-08-04 09:31:21,029 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-04 09:31:21,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2143926950, now seen corresponding path program 1 times [2023-08-04 09:31:21,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-04 09:31:21,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940747136] [2023-08-04 09:31:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:31:21,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-04 09:31:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:31:21,953 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-08-04 09:31:21,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-04 09:31:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940747136] [2023-08-04 09:31:21,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940747136] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-04 09:31:21,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280164285] [2023-08-04 09:31:21,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-04 09:31:21,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-04 09:31:21,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-04 09:31:21,957 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-04 09:31:21,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2023-08-04 09:31:22,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-04 09:31:22,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 54 conjunts are in the unsatisfiable core [2023-08-04 09:31:22,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-04 09:31:22,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-08-04 09:31:22,312 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-04 09:31:22,436 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-04 09:31:22,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:31:22,839 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-04 09:31:22,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:31:22,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-04 09:31:23,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:31:23,177 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-04 09:31:23,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-04 09:31:23,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-08-04 09:31:23,607 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 09:31:23,609 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:31:23,610 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 52 [2023-08-04 09:31:23,823 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2023-08-04 09:31:23,823 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-04 09:31:24,780 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (let ((.cse1 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset)) (.cse3 (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse2))))) (and (or (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse2))) (or (<= .cse0 c_~max2~0) (= .cse1 .cse0)))) (or (= .cse1 c_~max2~0) .cse3)) (<= .cse1 c_~max1~0)) (or (< c_~max1~0 .cse1) (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse2))) (or (= c_~max1~0 .cse4) (<= .cse4 c_~max2~0)))) (or .cse3 (= c_~max1~0 c_~max2~0))))))) is different from false [2023-08-04 09:31:25,301 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (+ c_~A~0.offset (* 4 c_thread1Thread1of2ForFork2_~i~0))) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse4 (select .cse2 c_~A~0.base))) (let ((.cse0 (select .cse4 .cse5)) (.cse1 (select .cse4 c_~A~0.offset))) (or (<= .cse0 c_~max1~0) (<= .cse1 .cse0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (= .cse1 c_~max2~0)))))) (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse8 (select .cse7 c_~A~0.base))) (let ((.cse6 (select .cse8 .cse5))) (or (<= .cse6 c_~max1~0) (= .cse6 c_~max2~0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (< .cse6 (select .cse8 c_~A~0.offset))))))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse9 (select .cse10 c_~A~0.base))) (or (< c_~max1~0 (select .cse9 c_~A~0.offset)) (< c_~max1~0 (select .cse9 .cse5)) (< c_~max2~0 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))))))) (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse11 (select .cse13 c_~A~0.base))) (let ((.cse12 (select .cse11 c_~A~0.offset))) (or (< c_~max1~0 (select .cse11 .cse5)) (<= .cse12 c_~max1~0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (= .cse12 c_~max2~0)))))) (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse14 (select .cse16 c_~A~0.base))) (or (< c_~max1~0 (select .cse14 c_~A~0.offset)) (< c_~max1~0 (select .cse14 .cse5)) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse15 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (or (<= .cse15 c_~max2~0) (= .cse15 c_~max1~0)))))))) (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse21 (select .cse20 c_~A~0.base))) (let ((.cse17 (select .cse21 .cse5)) (.cse18 (select .cse21 c_~A~0.offset))) (or (<= .cse17 c_~max1~0) (<= .cse18 .cse17) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse19 (select (select (store (store .cse20 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (or (<= .cse19 c_~max2~0) (= .cse19 .cse18))))))))) (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse25 (select .cse24 c_~A~0.base))) (let ((.cse22 (select .cse25 .cse5))) (or (<= .cse22 c_~max1~0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse23 (select (select (store (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (or (= .cse23 .cse22) (<= .cse23 c_~max2~0)))) (< .cse22 (select .cse25 c_~A~0.offset))))))) (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse26 (select .cse29 c_~A~0.base))) (let ((.cse27 (select .cse26 c_~A~0.offset))) (or (< c_~max1~0 (select .cse26 .cse5)) (<= .cse27 c_~max1~0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse28 (select (select (store (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (or (<= .cse28 c_~max2~0) (= .cse28 .cse27))))))))))) is different from false [2023-08-04 09:31:25,583 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (<= .cse0 c_~max1~0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (or (<= .cse1 c_~max2~0) (= .cse1 .cse0)))))))) (or (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1080 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (or (< c_~max1~0 (select (select .cse4 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))))) (= c_~max1~0 c_~max2~0)) (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (or (< c_~max1~0 (select (select .cse5 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse6 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (or (<= .cse6 c_~max2~0) (= .cse6 c_~max1~0))))))) (forall ((v_ArrVal_1080 (Array Int Int))) (let ((.cse8 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_1080))) (let ((.cse7 (select (select .cse8 c_~A~0.base) c_~A~0.offset))) (or (<= .cse7 c_~max1~0) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse3))) (= .cse7 c_~max2~0))))))) is different from false [2023-08-04 09:31:31,951 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 09:31:32,001 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:31:32,001 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 53 [2023-08-04 09:31:32,014 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:31:32,015 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 324 [2023-08-04 09:31:32,033 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 124 [2023-08-04 09:31:32,048 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:31:32,048 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 81 [2023-08-04 09:31:32,059 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 94 [2023-08-04 09:31:32,420 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:31:32,420 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 63 [2023-08-04 09:31:32,425 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 09:31:32,426 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 09:31:32,435 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 09:31:32,435 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 64 [2023-08-04 09:31:32,456 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 09:31:32,456 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 26 [2023-08-04 09:31:32,477 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-08-04 09:31:32,477 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 43 [2023-08-04 09:31:32,483 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 09:31:32,484 INFO L173 IndexEqualityManager]: detected equality via solver [2023-08-04 09:31:32,493 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 09:31:32,493 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 43 [2023-08-04 09:31:32,509 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-04 09:31:32,509 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-08-04 09:31:32,531 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-08-04 09:31:32,531 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 1 [2023-08-04 09:31:32,608 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 17 trivial. 7 not checked. [2023-08-04 09:31:32,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280164285] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-04 09:31:32,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-04 09:31:32,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 13] total 37 [2023-08-04 09:31:32,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500686613] [2023-08-04 09:31:32,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-04 09:31:32,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-08-04 09:31:32,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-04 09:31:32,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-08-04 09:31:32,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1053, Unknown=22, NotChecked=204, Total=1406 [2023-08-04 09:31:32,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 420 [2023-08-04 09:31:32,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 101 transitions, 494 flow. Second operand has 38 states, 38 states have (on average 106.39473684210526) internal successors, (4043), 38 states have internal predecessors, (4043), 0 states have call successors, (0), 0 states 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 09:31:32,671 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-04 09:31:32,671 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 420 [2023-08-04 09:31:32,671 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-04 09:32:06,719 WARN L233 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 64 DAG size of output: 47 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 09:32:09,926 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 [1] [2023-08-04 09:33:22,657 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification. DAG size of input: 66 DAG size of output: 49 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-04 09:33:33,582 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse13 (* 4 c_~M~0))) (let ((.cse0 (+ c_~A~0.offset .cse13))) (let ((.cse6 (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0)))) (.cse1 (= c_~max1~0 c_~max2~0)) (.cse10 (select |c_#memory_int| c_~A~0.base)) (.cse3 (* (div |c_ULTIMATE.start_main_#t~mem25#1| 4294967296) 4294967296))) (let ((.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0) 2)) (.cse4 (+ .cse3 2147483647)) (.cse5 (select .cse10 (+ c_~A~0.offset (* c_thread1Thread2of2ForFork2_~i~0 4)))) (.cse11 (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse15 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (= c_~max1~0 .cse15) (<= .cse15 c_~max2~0))))) (.cse14 (or .cse6 .cse1))) (and (or (forall ((v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) .cse1) (forall ((v_ArrVal_1084 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (<= .cse2 c_~max2~0) (= c_~max1~0 .cse2)))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= |c_ULTIMATE.start_main_~asdf~4#1| 0) (<= c_~M~0 0) (or (not (= |c_ULTIMATE.start_main_#t~mem25#1| (+ .cse3 c_thread3Thread1of2ForFork1_thidvar0))) (< .cse4 |c_ULTIMATE.start_main_#t~mem25#1|)) (or (<= .cse5 c_~max1~0) (and (or .cse6 (= .cse5 c_~max2~0)) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse7 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (= .cse7 .cse5) (<= .cse7 c_~max2~0)))))) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= .cse8 c_thread3Thread1of2ForFork1_thidvar0) (let ((.cse9 (select .cse10 0))) (or (and (= c_~max1~0 0) (<= .cse9 0)) (and (< 0 .cse9) (= .cse9 c_~max1~0)))) (<= 0 c_~M~0) (= c_~A~0.offset 0) .cse11 (let ((.cse12 (select .cse10 .cse13))) (or (and (= c_~max2~0 0) (<= .cse12 0)) (and (< 0 .cse12) (= c_~max2~0 .cse12)))) (<= c_thread3Thread1of2ForFork1_thidvar0 .cse8) .cse14 (or (<= |c_ULTIMATE.start_main_#t~mem25#1| .cse4) (not (= |c_ULTIMATE.start_main_#t~mem25#1| (+ .cse3 4294967296 c_thread3Thread1of2ForFork1_thidvar0)))) (or (< c_~max1~0 .cse5) (and .cse11 .cse14))))))) is different from false [2023-08-04 09:33:33,701 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse11 (* 4 c_~M~0))) (let ((.cse0 (+ c_~A~0.offset .cse11))) (let ((.cse4 (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0)))) (.cse1 (= c_~max1~0 c_~max2~0)) (.cse8 (select |c_#memory_int| c_~A~0.base))) (let ((.cse6 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0) 2)) (.cse3 (select .cse8 (+ c_~A~0.offset (* c_thread1Thread2of2ForFork2_~i~0 4)))) (.cse9 (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (= c_~max1~0 .cse14) (<= .cse14 c_~max2~0))))) (.cse12 (or .cse4 .cse1)) (.cse13 (select .cse8 (+ c_~A~0.offset (* c_thread3Thread1of2ForFork1_~i~2 4))))) (and (or (forall ((v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) .cse1) (forall ((v_ArrVal_1084 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (<= .cse2 c_~max2~0) (= c_~max1~0 .cse2)))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= |c_ULTIMATE.start_main_~asdf~4#1| 0) (<= c_~M~0 0) (or (<= .cse3 c_~max1~0) (and (or .cse4 (= .cse3 c_~max2~0)) (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (= .cse5 .cse3) (<= .cse5 c_~max2~0)))))) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= .cse6 c_thread3Thread1of2ForFork1_thidvar0) (let ((.cse7 (select .cse8 0))) (or (and (= c_~max1~0 0) (<= .cse7 0)) (and (< 0 .cse7) (= .cse7 c_~max1~0)))) (<= 0 c_~M~0) (= c_~A~0.offset 0) .cse9 (let ((.cse10 (select .cse8 .cse11))) (or (and (= c_~max2~0 0) (<= .cse10 0)) (and (< 0 .cse10) (= c_~max2~0 .cse10)))) (<= c_thread3Thread1of2ForFork1_thidvar0 .cse6) .cse12 (or (< c_~max1~0 .cse3) (and .cse9 .cse12)) (or (<= .cse13 c_~max2~0) (= c_~max1~0 .cse13)) (or .cse1 (< c_~max2~0 .cse13))))))) is different from false [2023-08-04 09:33:57,594 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse17 (* 4 c_~M~0))) (let ((.cse0 (+ c_~A~0.offset .cse17)) (.cse7 (select |c_#memory_int| c_~A~0.base))) (let ((.cse1 (= c_~max1~0 c_~max2~0)) (.cse10 (select .cse7 c_~A~0.offset)) (.cse13 (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0)))) (.cse3 (* (div |c_ULTIMATE.start_main_#t~mem25#1| 4294967296) 4294967296))) (let ((.cse5 (= c_~max2~0 0)) (.cse8 (+ (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base|) 0) 2)) (.cse4 (+ .cse3 2147483647)) (.cse9 (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse20 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (<= .cse20 c_~max2~0) (= .cse10 .cse20)))) (or (= .cse10 c_~max2~0) .cse13))) (.cse15 (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse19 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (= c_~max1~0 .cse19) (<= .cse19 c_~max2~0))))) (.cse18 (or .cse13 .cse1)) (.cse11 (select .cse7 (+ c_~A~0.offset (* 4 c_thread1Thread1of2ForFork2_~i~0))))) (and (or (forall ((v_ArrVal_1084 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) .cse1) (forall ((v_ArrVal_1084 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (<= .cse2 c_~max2~0) (= c_~max1~0 .cse2)))) (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)) (= |c_ULTIMATE.start_main_~asdf~4#1| 0) (<= c_~M~0 0) (or (not (= |c_ULTIMATE.start_main_#t~mem25#1| (+ .cse3 c_thread3Thread1of2ForFork1_thidvar0))) (< .cse4 |c_ULTIMATE.start_main_#t~mem25#1|)) (let ((.cse6 (select .cse7 (* c_thread3Thread1of2ForFork1_~i~2 4)))) (or (and .cse5 (<= .cse6 0)) (and (< 0 .cse6) (= .cse6 c_~max2~0)))) (= |c_ULTIMATE.start_main_~#t2~0#1.offset| 0) (<= .cse8 c_thread3Thread1of2ForFork1_thidvar0) (or (and (or .cse9 (<= .cse10 .cse11)) (or (< .cse11 .cse10) (and (forall ((v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1084 (Array Int Int))) (let ((.cse12 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_1082) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1084) c_~A~0.base) .cse0))) (or (<= .cse12 c_~max2~0) (= .cse11 .cse12)))) (or .cse13 (= .cse11 c_~max2~0))))) (<= .cse11 c_~max1~0)) (let ((.cse14 (select .cse7 0))) (or (and (= c_~max1~0 0) (<= .cse14 0)) (and (< 0 .cse14) (= .cse14 c_~max1~0)))) (<= 0 c_~M~0) (<= 0 c_thread3Thread1of2ForFork1_~i~2) (= c_~A~0.offset 0) .cse15 (let ((.cse16 (select .cse7 .cse17))) (or (and .cse5 (<= .cse16 0)) (and (< 0 .cse16) (= c_~max2~0 .cse16)))) (<= c_thread3Thread1of2ForFork1_thidvar0 .cse8) .cse18 (<= c_thread3Thread1of2ForFork1_~i~2 0) (or (<= |c_ULTIMATE.start_main_#t~mem25#1| .cse4) (not (= |c_ULTIMATE.start_main_#t~mem25#1| (+ .cse3 4294967296 c_thread3Thread1of2ForFork1_thidvar0)))) (or (and (or .cse9 (<= .cse10 c_~max1~0)) (or (< c_~max1~0 .cse10) (and .cse15 .cse18))) (< c_~max1~0 .cse11))))))) is different from false [2023-08-04 09:35:07,799 INFO L124 PetriNetUnfolderBase]: 789948/983800 cut-off events. [2023-08-04 09:35:07,799 INFO L125 PetriNetUnfolderBase]: For 1288415/1294426 co-relation queries the response was YES. [2023-08-04 09:35:14,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3063919 conditions, 983800 events. 789948/983800 cut-off events. For 1288415/1294426 co-relation queries the response was YES. Maximal size of possible extension queue 13697. Compared 5937020 event pairs, 57725 based on Foata normal form. 7824/798722 useless extension candidates. Maximal degree in co-relation 3060726. Up to 474440 conditions per place. [2023-08-04 09:35:19,455 INFO L140 encePairwiseOnDemand]: 369/420 looper letters, 2192 selfloop transitions, 2612 changer transitions 2/4813 dead transitions. [2023-08-04 09:35:19,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 341 places, 4813 transitions, 30710 flow [2023-08-04 09:35:19,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2023-08-04 09:35:19,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2023-08-04 09:35:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 27309 transitions. [2023-08-04 09:35:19,530 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.28026477832512314 [2023-08-04 09:35:19,533 INFO L72 ComplementDD]: Start complementDD. Operand 232 states and 27309 transitions. [2023-08-04 09:35:19,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 232 states and 27309 transitions. [2023-08-04 09:35:19,554 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-04 09:35:19,555 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 232 states and 27309 transitions. [2023-08-04 09:35:19,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 233 states, 232 states have (on average 117.71120689655173) internal successors, (27309), 232 states have internal predecessors, (27309), 0 states have call successors, (0), 0 states 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 09:35:19,703 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 233 states, 233 states have (on average 420.0) internal successors, (97860), 233 states have internal predecessors, (97860), 0 states have call successors, (0), 0 states 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 09:35:19,736 INFO L81 ComplementDD]: Finished complementDD. Result has 233 states, 233 states have (on average 420.0) internal successors, (97860), 233 states have internal predecessors, (97860), 0 states have call successors, (0), 0 states 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 09:35:19,736 INFO L175 Difference]: Start difference. First operand has 110 places, 101 transitions, 494 flow. Second operand 232 states and 27309 transitions. [2023-08-04 09:35:19,736 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 341 places, 4813 transitions, 30710 flow Received shutdown request... [2023-08-04 09:36:07,632 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 09:36:07,632 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-08-04 09:36:08,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2023-08-04 09:36:08,834 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2023-08-04 09:36:08,877 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 137 [2023-08-04 09:36:10,513 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-08-04 09:36:10,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-08-04 09:36:10,514 WARN L619 AbstractCegarLoop]: Verification canceled: while executing RemoveRedundantFlow. [2023-08-04 09:36:10,514 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-04 09:36:10,515 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2023-08-04 09:36:10,516 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2023-08-04 09:36:10,516 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-04 09:36:10,530 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.08 09:36:10 BasicIcfg [2023-08-04 09:36:10,530 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-04 09:36:10,532 INFO L158 Benchmark]: Toolchain (without parser) took 643434.76ms. Allocated memory was 635.4MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 579.5MB in the beginning and 7.0GB in the end (delta: -6.5GB). Peak memory consumption was 9.1GB. Max. memory is 16.0GB. [2023-08-04 09:36:10,532 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 371.2MB. Free memory is still 315.3MB. There was no memory consumed. Max. memory is 16.0GB. [2023-08-04 09:36:10,532 INFO L158 Benchmark]: CACSL2BoogieTranslator took 283.59ms. Allocated memory is still 635.4MB. Free memory was 579.5MB in the beginning and 567.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-08-04 09:36:10,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.52ms. Allocated memory is still 635.4MB. Free memory was 567.4MB in the beginning and 565.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 09:36:10,538 INFO L158 Benchmark]: Boogie Preprocessor took 37.60ms. Allocated memory is still 635.4MB. Free memory was 565.7MB in the beginning and 563.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-08-04 09:36:10,539 INFO L158 Benchmark]: RCFGBuilder took 508.18ms. Allocated memory is still 635.4MB. Free memory was 563.6MB in the beginning and 540.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. [2023-08-04 09:36:10,540 INFO L158 Benchmark]: TraceAbstraction took 642566.61ms. Allocated memory was 635.4MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 540.1MB in the beginning and 7.0GB in the end (delta: -6.5GB). Peak memory consumption was 9.1GB. Max. memory is 16.0GB. [2023-08-04 09:36:10,541 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.11ms. Allocated memory is still 371.2MB. Free memory is still 315.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 283.59ms. Allocated memory is still 635.4MB. Free memory was 579.5MB in the beginning and 567.4MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 33.52ms. Allocated memory is still 635.4MB. Free memory was 567.4MB in the beginning and 565.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 37.60ms. Allocated memory is still 635.4MB. Free memory was 565.7MB in the beginning and 563.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 508.18ms. Allocated memory is still 635.4MB. Free memory was 563.6MB in the beginning and 540.4MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.0GB. * TraceAbstraction took 642566.61ms. Allocated memory was 635.4MB in the beginning and 16.0GB in the end (delta: 15.4GB). Free memory was 540.1MB in the beginning and 7.0GB in the end (delta: -6.5GB). Peak memory consumption was 9.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.7s, 172 PlacesBefore, 43 PlacesAfterwards, 192 TransitionsBefore, 49 TransitionsAfterwards, 5220 CoEnabledTransitionPairs, 8 FixpointIterations, 62 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 19 ConcurrentYvCompositions, 14 ChoiceCompositions, 170 TotalNumberOfCompositions, 9109 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8613, independent: 8556, independent conditional: 0, independent unconditional: 8556, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2728, independent: 2712, independent conditional: 0, independent unconditional: 2712, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8613, independent: 5844, independent conditional: 0, independent unconditional: 5844, dependent: 41, dependent conditional: 0, dependent unconditional: 41, unknown: 2728, unknown conditional: 0, unknown unconditional: 2728] , Statistics on independence cache: Total cache size (in pairs): 177, Positive cache size: 174, Positive conditional cache size: 0, Positive unconditional cache size: 174, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.6s, 172 PlacesBefore, 43 PlacesAfterwards, 192 TransitionsBefore, 49 TransitionsAfterwards, 5220 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 10 TrivialYvCompositions, 19 ConcurrentYvCompositions, 14 ChoiceCompositions, 167 TotalNumberOfCompositions, 8703 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8267, independent: 8214, independent conditional: 0, independent unconditional: 8214, dependent: 53, dependent conditional: 0, dependent unconditional: 53, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2749, independent: 2732, independent conditional: 0, independent unconditional: 2732, dependent: 17, dependent conditional: 0, dependent unconditional: 17, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8267, independent: 5482, independent conditional: 0, independent unconditional: 5482, dependent: 36, dependent conditional: 0, dependent unconditional: 36, unknown: 2749, unknown conditional: 0, unknown unconditional: 2749] , Statistics on independence cache: Total cache size (in pairs): 180, Positive cache size: 177, Positive conditional cache size: 0, Positive unconditional cache size: 177, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 205 PlacesBefore, 61 PlacesAfterwards, 234 TransitionsBefore, 73 TransitionsAfterwards, 13500 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 25 ConcurrentYvCompositions, 17 ChoiceCompositions, 186 TotalNumberOfCompositions, 26854 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 25431, independent: 25358, independent conditional: 0, independent unconditional: 25358, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 7107, independent: 7089, independent conditional: 0, independent unconditional: 7089, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 25431, independent: 18269, independent conditional: 0, independent unconditional: 18269, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 7107, unknown conditional: 0, unknown unconditional: 7107] , Statistics on independence cache: Total cache size (in pairs): 597, Positive cache size: 594, Positive conditional cache size: 0, Positive unconditional cache size: 594, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing RemoveRedundantFlow. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 193 locations, 4 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: 9.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 148 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 86 mSDsluCounter, 11 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 561 IncrementalHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 11 mSDtfsCounter, 561 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 184 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=5, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 266 NumberOfCodeBlocks, 266 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 383 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1077 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 40/48 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 10 procedures, 220 locations, 4 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: 627.7s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 603.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 4029 mSolverCounterUnknown, 4554 SdHoareTripleChecker+Valid, 54.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4226 mSDsluCounter, 4110 SdHoareTripleChecker+Invalid, 48.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12339 IncrementalHoareTripleChecker+Unchecked, 3826 mSDsCounter, 254 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43760 IncrementalHoareTripleChecker+Invalid, 60382 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 254 mSolverCounterUnsat, 284 mSDtfsCounter, 43760 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 4029 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1730 GetRequests, 1344 SyntacticMatches, 51 SemanticMatches, 335 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 25949 ImplicationChecksByTransitivity, 71.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=494occurred in iteration=17, InterpolantAutomatonStates: 74, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 13.1s InterpolantComputationTime, 1586 NumberOfCodeBlocks, 1586 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2190 ConstructedInterpolants, 34 QuantifiedInterpolants, 11763 SizeOfPredicates, 43 NumberOfNonLiveVariables, 4015 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 45 InterpolantComputations, 9 PerfectInterpolantSequences, 822/927 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 7 procedures, 193 locations, 4 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: 5.1s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 41 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 109 IncrementalHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 1 mSDtfsCounter, 109 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=0, InterpolantAutomatonStates: 3, 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.1s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 12 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 2/2 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 !ENTRY org.eclipse.osgi 4 0 2023-08-04 09:36:10.577 !MESSAGE Application error !STACK 1 org.eclipse.core.internal.resources.ResourceException(/)[568]: java.io.FileNotFoundException: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f571a7a/.metadata/.plugins/org.eclipse.core.resources/.root/1.tree (No such file or directory) at java.base/java.io.FileOutputStream.open0(Native Method) at java.base/java.io.FileOutputStream.open(FileOutputStream.java:298) at java.base/java.io.FileOutputStream.(FileOutputStream.java:237) at java.base/java.io.FileOutputStream.(FileOutputStream.java:187) at org.eclipse.core.internal.localstore.SafeFileOutputStream.(SafeFileOutputStream.java:55) at org.eclipse.core.internal.resources.SaveManager.saveTree(SaveManager.java:1381) at org.eclipse.core.internal.resources.SaveManager.save(SaveManager.java:1168) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2333) at org.eclipse.core.internal.resources.Workspace.save(Workspace.java:2322) at de.uni_freiburg.informatik.ultimate.core.coreplugin.UltimateCore.start(UltimateCore.java:190) at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134) at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401) at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method) at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62) at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43) at java.base/java.lang.reflect.Method.invoke(Method.java:566) at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:657) at org.eclipse.equinox.launcher.Main.basicRun(Main.java:594) at org.eclipse.equinox.launcher.Main.run(Main.java:1465) at org.eclipse.equinox.launcher.Main.main(Main.java:1438) An error has occurred. See the log file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/96f571a7a/.metadata/.log.