/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 15:03:54,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 15:03:54,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 15:03:54,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 15:03:54,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 15:03:54,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 15:03:54,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 15:03:54,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 15:03:54,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 15:03:54,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 15:03:54,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 15:03:54,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 15:03:54,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 15:03:54,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 15:03:54,507 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 15:03:54,508 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 15:03:54,509 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 15:03:54,509 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 15:03:54,511 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 15:03:54,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 15:03:54,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 15:03:54,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 15:03:54,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 15:03:54,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 15:03:54,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 15:03:54,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 15:03:54,527 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 15:03:54,528 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 15:03:54,529 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 15:03:54,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 15:03:54,529 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 15:03:54,531 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 15:03:54,532 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 15:03:54,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 15:03:54,533 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 15:03:54,534 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 15:03:54,534 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 15:03:54,534 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 15:03:54,534 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 15:03:54,535 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 15:03:54,535 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 15:03:54,536 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 15:03:54,566 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 15:03:54,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 15:03:54,568 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 15:03:54,568 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 15:03:54,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 15:03:54,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 15:03:54,570 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 15:03:54,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 15:03:54,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 15:03:54,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 15:03:54,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 15:03:54,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 15:03:54,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 15:03:54,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 15:03:54,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 15:03:54,571 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 15:03:54,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 15:03:54,571 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 15:03:54,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 15:03:54,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 15:03:54,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 15:03:54,572 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 15:03:54,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 15:03:54,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 15:03:54,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 15:03:54,572 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 15:03:54,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 15:03:54,573 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 15:03:54,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 15:03:54,573 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 15:03:54,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 [2022-12-12 15:03:54,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 15:03:54,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 15:03:54,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 15:03:54,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 15:03:54,836 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 15:03:54,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-12-12 15:03:55,697 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 15:03:55,885 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 15:03:55,885 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2022-12-12 15:03:55,889 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9830542/f4399b0a4e6a4d58a39b805fa53c7c8c/FLAG2ca25a654 [2022-12-12 15:03:55,899 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae9830542/f4399b0a4e6a4d58a39b805fa53c7c8c [2022-12-12 15:03:55,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 15:03:55,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 15:03:55,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 15:03:55,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 15:03:55,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 15:03:55,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 03:03:55" (1/1) ... [2022-12-12 15:03:55,905 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b7a94d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:55, skipping insertion in model container [2022-12-12 15:03:55,906 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 03:03:55" (1/1) ... [2022-12-12 15:03:55,910 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 15:03:55,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 15:03:56,039 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-12-12 15:03:56,046 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 15:03:56,053 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 15:03:56,084 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2022-12-12 15:03:56,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 15:03:56,095 INFO L208 MainTranslator]: Completed translation [2022-12-12 15:03:56,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56 WrapperNode [2022-12-12 15:03:56,096 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 15:03:56,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 15:03:56,098 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 15:03:56,098 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 15:03:56,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,114 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,133 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-12 15:03:56,133 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 15:03:56,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 15:03:56,134 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 15:03:56,134 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 15:03:56,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,159 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,162 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 15:03:56,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 15:03:56,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 15:03:56,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 15:03:56,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (1/1) ... [2022-12-12 15:03:56,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 15:03:56,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:03:56,201 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) [2022-12-12 15:03:56,235 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 [2022-12-12 15:03:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 15:03:56,257 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 15:03:56,257 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 15:03:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 15:03:56,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 15:03:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 15:03:56,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 15:03:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-12 15:03:56,258 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-12 15:03:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 15:03:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 15:03:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 15:03:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 15:03:56,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 15:03:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 15:03:56,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 15:03:56,259 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 15:03:56,319 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 15:03:56,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 15:03:56,477 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 15:03:56,482 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 15:03:56,483 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-12 15:03:56,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 03:03:56 BoogieIcfgContainer [2022-12-12 15:03:56,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 15:03:56,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 15:03:56,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 15:03:56,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 15:03:56,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 03:03:55" (1/3) ... [2022-12-12 15:03:56,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7003bb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 03:03:56, skipping insertion in model container [2022-12-12 15:03:56,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 03:03:56" (2/3) ... [2022-12-12 15:03:56,488 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7003bb72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 03:03:56, skipping insertion in model container [2022-12-12 15:03:56,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 03:03:56" (3/3) ... [2022-12-12 15:03:56,489 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2022-12-12 15:03:56,506 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 15:03:56,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 15:03:56,506 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 15:03:56,564 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-12 15:03:56,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 122 transitions, 276 flow [2022-12-12 15:03:56,642 INFO L130 PetriNetUnfolder]: 10/118 cut-off events. [2022-12-12 15:03:56,642 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 15:03:56,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 118 events. 10/118 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 59 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-12 15:03:56,647 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 122 transitions, 276 flow [2022-12-12 15:03:56,650 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 109 places, 106 transitions, 236 flow [2022-12-12 15:03:56,651 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 15:03:56,663 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 109 places, 106 transitions, 236 flow [2022-12-12 15:03:56,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 106 transitions, 236 flow [2022-12-12 15:03:56,686 INFO L130 PetriNetUnfolder]: 10/106 cut-off events. [2022-12-12 15:03:56,686 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 15:03:56,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 106 events. 10/106 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/96 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2022-12-12 15:03:56,689 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 109 places, 106 transitions, 236 flow [2022-12-12 15:03:56,689 INFO L226 LiptonReduction]: Number of co-enabled transitions 1512 [2022-12-12 15:04:00,028 INFO L241 LiptonReduction]: Total number of compositions: 81 [2022-12-12 15:04:00,039 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 15:04:00,043 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1894a913, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 15:04:00,044 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 15:04:00,049 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-12 15:04:00,049 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 15:04:00,050 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:04:00,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:04:00,050 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:04:00,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:04:00,054 INFO L85 PathProgramCache]: Analyzing trace with hash -2713954, now seen corresponding path program 1 times [2022-12-12 15:04:00,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:04:00,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373065284] [2022-12-12 15:04:00,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:00,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:04:00,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:00,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:00,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:04:00,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373065284] [2022-12-12 15:04:00,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373065284] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 15:04:00,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 15:04:00,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 15:04:00,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775980766] [2022-12-12 15:04:00,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:04:00,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 15:04:00,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:04:00,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 15:04:00,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 15:04:00,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:04:00,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:00,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:04:00,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:04:00,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:04:00,727 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-12 15:04:00,728 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2022-12-12 15:04:00,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1782 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-12 15:04:00,736 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-12 15:04:00,736 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-12 15:04:00,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 15:04:00,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 15:04:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-12 15:04:00,746 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-12 15:04:00,747 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 74 flow. Second operand 3 states and 48 transitions. [2022-12-12 15:04:00,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 47 transitions, 233 flow [2022-12-12 15:04:00,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 203 flow, removed 0 selfloop flow, removed 8 redundant places. [2022-12-12 15:04:00,757 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 91 flow [2022-12-12 15:04:00,758 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2022-12-12 15:04:00,763 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -5 predicate places. [2022-12-12 15:04:00,763 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 91 flow [2022-12-12 15:04:00,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:00,764 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:04:00,764 INFO L214 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] [2022-12-12 15:04:00,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 15:04:00,765 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:04:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:04:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1247836044, now seen corresponding path program 1 times [2022-12-12 15:04:00,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:04:00,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578658505] [2022-12-12 15:04:00,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:00,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:04:00,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:00,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:04:00,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578658505] [2022-12-12 15:04:00,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578658505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 15:04:00,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 15:04:00,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 15:04:00,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479607277] [2022-12-12 15:04:00,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:04:00,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 15:04:00,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:04:00,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 15:04:00,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 15:04:00,976 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:04:00,977 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:00,977 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:04:00,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:04:00,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:04:01,155 INFO L130 PetriNetUnfolder]: 467/647 cut-off events. [2022-12-12 15:04:01,155 INFO L131 PetriNetUnfolder]: For 212/212 co-relation queries the response was YES. [2022-12-12 15:04:01,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1665 conditions, 647 events. 467/647 cut-off events. For 212/212 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1768 event pairs, 43 based on Foata normal form. 30/677 useless extension candidates. Maximal degree in co-relation 439. Up to 441 conditions per place. [2022-12-12 15:04:01,159 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 46 selfloop transitions, 9 changer transitions 5/60 dead transitions. [2022-12-12 15:04:01,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 60 transitions, 289 flow [2022-12-12 15:04:01,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 15:04:01,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 15:04:01,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-12 15:04:01,160 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-12 15:04:01,161 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 91 flow. Second operand 4 states and 62 transitions. [2022-12-12 15:04:01,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 60 transitions, 289 flow [2022-12-12 15:04:01,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 15:04:01,162 INFO L231 Difference]: Finished difference. Result has 32 places, 33 transitions, 127 flow [2022-12-12 15:04:01,162 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=32, PETRI_TRANSITIONS=33} [2022-12-12 15:04:01,163 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-12 15:04:01,163 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 33 transitions, 127 flow [2022-12-12 15:04:01,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:01,163 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:04:01,163 INFO L214 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] [2022-12-12 15:04:01,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 15:04:01,164 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:04:01,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:04:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash 514294809, now seen corresponding path program 1 times [2022-12-12 15:04:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:04:01,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289795386] [2022-12-12 15:04:01,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:01,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:04:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:01,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:04:01,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289795386] [2022-12-12 15:04:01,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289795386] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:04:01,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1788457306] [2022-12-12 15:04:01,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:01,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:04:01,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:04:01,344 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) [2022-12-12 15:04:01,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 15:04:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:01,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 15:04:01,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:04:01,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:01,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:04:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:01,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1788457306] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:04:01,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:04:01,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-12 15:04:01,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366108189] [2022-12-12 15:04:01,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:04:01,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 15:04:01,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:04:01,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 15:04:01,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 15:04:01,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:04:01,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 33 transitions, 127 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:01,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:04:01,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:04:01,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:04:01,873 INFO L130 PetriNetUnfolder]: 845/1165 cut-off events. [2022-12-12 15:04:01,873 INFO L131 PetriNetUnfolder]: For 561/561 co-relation queries the response was YES. [2022-12-12 15:04:01,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3259 conditions, 1165 events. 845/1165 cut-off events. For 561/561 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3643 event pairs, 155 based on Foata normal form. 30/1195 useless extension candidates. Maximal degree in co-relation 853. Up to 458 conditions per place. [2022-12-12 15:04:01,879 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 83 selfloop transitions, 12 changer transitions 3/98 dead transitions. [2022-12-12 15:04:01,879 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 98 transitions, 508 flow [2022-12-12 15:04:01,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 15:04:01,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 15:04:01,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-12 15:04:01,883 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-12 15:04:01,883 INFO L175 Difference]: Start difference. First operand has 32 places, 33 transitions, 127 flow. Second operand 6 states and 96 transitions. [2022-12-12 15:04:01,883 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 98 transitions, 508 flow [2022-12-12 15:04:01,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 98 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-12 15:04:01,887 INFO L231 Difference]: Finished difference. Result has 38 places, 38 transitions, 179 flow [2022-12-12 15:04:01,887 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=179, PETRI_PLACES=38, PETRI_TRANSITIONS=38} [2022-12-12 15:04:01,888 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 4 predicate places. [2022-12-12 15:04:01,888 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 38 transitions, 179 flow [2022-12-12 15:04:01,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:01,888 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:04:01,888 INFO L214 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] [2022-12-12 15:04:01,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-12 15:04:02,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:04:02,094 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:04:02,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:04:02,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1135419108, now seen corresponding path program 2 times [2022-12-12 15:04:02,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:04:02,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103338321] [2022-12-12 15:04:02,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:02,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:04:02,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:02,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:02,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:04:02,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103338321] [2022-12-12 15:04:02,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103338321] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:04:02,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317781688] [2022-12-12 15:04:02,285 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 15:04:02,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:04:02,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:04:02,298 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) [2022-12-12 15:04:02,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 15:04:02,419 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 15:04:02,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:04:02,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 15:04:02,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:04:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:02,608 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:04:02,691 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:02,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317781688] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:04:02,691 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:04:02,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-12 15:04:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574406811] [2022-12-12 15:04:02,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:04:02,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 15:04:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:04:02,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 15:04:02,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 15:04:02,698 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:04:02,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 38 transitions, 179 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:02,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:04:02,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:04:02,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:04:02,916 INFO L130 PetriNetUnfolder]: 997/1379 cut-off events. [2022-12-12 15:04:02,917 INFO L131 PetriNetUnfolder]: For 1408/1408 co-relation queries the response was YES. [2022-12-12 15:04:02,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4525 conditions, 1379 events. 997/1379 cut-off events. For 1408/1408 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4539 event pairs, 143 based on Foata normal form. 28/1407 useless extension candidates. Maximal degree in co-relation 2423. Up to 605 conditions per place. [2022-12-12 15:04:02,924 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 86 selfloop transitions, 12 changer transitions 3/101 dead transitions. [2022-12-12 15:04:02,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 101 transitions, 580 flow [2022-12-12 15:04:02,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 15:04:02,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 15:04:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 96 transitions. [2022-12-12 15:04:02,925 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-12 15:04:02,925 INFO L175 Difference]: Start difference. First operand has 38 places, 38 transitions, 179 flow. Second operand 6 states and 96 transitions. [2022-12-12 15:04:02,925 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 101 transitions, 580 flow [2022-12-12 15:04:02,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 101 transitions, 571 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-12 15:04:02,931 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 228 flow [2022-12-12 15:04:02,931 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=228, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2022-12-12 15:04:02,931 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-12 15:04:02,931 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 228 flow [2022-12-12 15:04:02,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:02,932 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:04:02,932 INFO L214 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] [2022-12-12 15:04:02,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 15:04:03,136 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,SelfDestructingSolverStorable3 [2022-12-12 15:04:03,137 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:04:03,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:04:03,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1474747795, now seen corresponding path program 1 times [2022-12-12 15:04:03,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:04:03,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897929463] [2022-12-12 15:04:03,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:03,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:04:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:03,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:03,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:04:03,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897929463] [2022-12-12 15:04:03,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897929463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 15:04:03,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 15:04:03,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 15:04:03,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618671214] [2022-12-12 15:04:03,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:04:03,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 15:04:03,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:04:03,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 15:04:03,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 15:04:03,247 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:04:03,247 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:03,247 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:04:03,247 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:04:03,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:04:03,397 INFO L130 PetriNetUnfolder]: 961/1343 cut-off events. [2022-12-12 15:04:03,397 INFO L131 PetriNetUnfolder]: For 2832/2832 co-relation queries the response was YES. [2022-12-12 15:04:03,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4878 conditions, 1343 events. 961/1343 cut-off events. For 2832/2832 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4547 event pairs, 177 based on Foata normal form. 36/1379 useless extension candidates. Maximal degree in co-relation 3100. Up to 1137 conditions per place. [2022-12-12 15:04:03,403 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 56 selfloop transitions, 11 changer transitions 7/74 dead transitions. [2022-12-12 15:04:03,403 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 74 transitions, 504 flow [2022-12-12 15:04:03,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 15:04:03,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 15:04:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 62 transitions. [2022-12-12 15:04:03,404 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-12 15:04:03,404 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 228 flow. Second operand 4 states and 62 transitions. [2022-12-12 15:04:03,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 74 transitions, 504 flow [2022-12-12 15:04:03,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 74 transitions, 471 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-12 15:04:03,413 INFO L231 Difference]: Finished difference. Result has 45 places, 45 transitions, 252 flow [2022-12-12 15:04:03,413 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=197, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=252, PETRI_PLACES=45, PETRI_TRANSITIONS=45} [2022-12-12 15:04:03,413 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2022-12-12 15:04:03,414 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 45 transitions, 252 flow [2022-12-12 15:04:03,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:03,414 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:04:03,414 INFO L214 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] [2022-12-12 15:04:03,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 15:04:03,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:04:03,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:04:03,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1667699092, now seen corresponding path program 1 times [2022-12-12 15:04:03,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:04:03,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128579286] [2022-12-12 15:04:03,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:03,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:04:03,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:03,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:03,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:04:03,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128579286] [2022-12-12 15:04:03,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128579286] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:04:03,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095877660] [2022-12-12 15:04:03,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:03,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:04:03,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:04:03,498 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) [2022-12-12 15:04:03,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 15:04:03,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:03,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 15:04:03,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:04:03,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:03,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:04:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:03,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095877660] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:04:03,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:04:03,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-12 15:04:03,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041495859] [2022-12-12 15:04:03,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:04:03,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 15:04:03,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:04:03,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 15:04:03,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 15:04:03,739 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:04:03,739 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 45 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:03,739 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:04:03,739 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:04:03,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:04:04,113 INFO L130 PetriNetUnfolder]: 1885/2599 cut-off events. [2022-12-12 15:04:04,113 INFO L131 PetriNetUnfolder]: For 4549/4549 co-relation queries the response was YES. [2022-12-12 15:04:04,118 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9545 conditions, 2599 events. 1885/2599 cut-off events. For 4549/4549 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 9826 event pairs, 301 based on Foata normal form. 116/2715 useless extension candidates. Maximal degree in co-relation 6385. Up to 1249 conditions per place. [2022-12-12 15:04:04,128 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 119 selfloop transitions, 14 changer transitions 3/136 dead transitions. [2022-12-12 15:04:04,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 136 transitions, 947 flow [2022-12-12 15:04:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 15:04:04,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 15:04:04,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 100 transitions. [2022-12-12 15:04:04,131 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2022-12-12 15:04:04,131 INFO L175 Difference]: Start difference. First operand has 45 places, 45 transitions, 252 flow. Second operand 6 states and 100 transitions. [2022-12-12 15:04:04,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 136 transitions, 947 flow [2022-12-12 15:04:04,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 136 transitions, 938 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-12 15:04:04,140 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 314 flow [2022-12-12 15:04:04,140 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2022-12-12 15:04:04,142 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-12-12 15:04:04,142 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 314 flow [2022-12-12 15:04:04,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:04,142 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:04:04,142 INFO L214 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] [2022-12-12 15:04:04,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-12 15:04:04,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:04:04,347 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:04:04,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:04:04,347 INFO L85 PathProgramCache]: Analyzing trace with hash -13358859, now seen corresponding path program 2 times [2022-12-12 15:04:04,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:04:04,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689009255] [2022-12-12 15:04:04,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:04,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:04:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:04,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:04,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:04:04,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689009255] [2022-12-12 15:04:04,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689009255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 15:04:04,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 15:04:04,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 15:04:04,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011708554] [2022-12-12 15:04:04,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 15:04:04,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 15:04:04,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:04:04,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 15:04:04,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 15:04:04,465 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:04:04,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 314 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:04,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:04:04,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:04:04,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:04:04,707 INFO L130 PetriNetUnfolder]: 2149/2947 cut-off events. [2022-12-12 15:04:04,707 INFO L131 PetriNetUnfolder]: For 7718/7718 co-relation queries the response was YES. [2022-12-12 15:04:04,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12339 conditions, 2947 events. 2149/2947 cut-off events. For 7718/7718 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 11258 event pairs, 555 based on Foata normal form. 84/3031 useless extension candidates. Maximal degree in co-relation 7793. Up to 2463 conditions per place. [2022-12-12 15:04:04,724 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 75 selfloop transitions, 10 changer transitions 3/88 dead transitions. [2022-12-12 15:04:04,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 88 transitions, 679 flow [2022-12-12 15:04:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 15:04:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 15:04:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2022-12-12 15:04:04,725 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-12 15:04:04,725 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 314 flow. Second operand 4 states and 60 transitions. [2022-12-12 15:04:04,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 88 transitions, 679 flow [2022-12-12 15:04:04,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 88 transitions, 668 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-12 15:04:04,745 INFO L231 Difference]: Finished difference. Result has 55 places, 51 transitions, 336 flow [2022-12-12 15:04:04,746 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=55, PETRI_TRANSITIONS=51} [2022-12-12 15:04:04,746 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-12-12 15:04:04,746 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 51 transitions, 336 flow [2022-12-12 15:04:04,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:04:04,746 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:04:04,746 INFO L214 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] [2022-12-12 15:04:04,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 15:04:04,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:04:04,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:04:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1246207825, now seen corresponding path program 1 times [2022-12-12 15:04:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:04:04,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202845793] [2022-12-12 15:04:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:04,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:04:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:07,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:04:07,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202845793] [2022-12-12 15:04:07,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202845793] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:04:07,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [445288732] [2022-12-12 15:04:07,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:04:07,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:04:07,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:04:07,103 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) [2022-12-12 15:04:07,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 15:04:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:04:07,912 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 15:04:07,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:04:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:04:51,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:05:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:05:05,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [445288732] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:05:05,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:05:05,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 5] total 15 [2022-12-12 15:05:05,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092323408] [2022-12-12 15:05:05,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:05:05,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-12 15:05:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:05:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-12 15:05:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=188, Unknown=21, NotChecked=0, Total=272 [2022-12-12 15:05:05,975 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:05:05,975 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 51 transitions, 336 flow. Second operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:05:05,975 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:05:05,975 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:05:05,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:05:07,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:09,288 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:17,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:21,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:25,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:27,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:28,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:30,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:32,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:34,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:41,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:43,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:45,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:47,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:49,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:05:58,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:00,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:02,313 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:04,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:06,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:08,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:10,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:12,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:14,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:22,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:23,593 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:25,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:28,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:31,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:34,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:36,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:38,423 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:42,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:44,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:46,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:48,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:50,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:52,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:54,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:56,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:06:59,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:01,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:04,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:06,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:08,978 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:11,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:13,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:14,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:16,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:18,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:20,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:22,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:25,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:27,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:30,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:32,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:33,619 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:35,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:39,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:42,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:44,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:47,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:50,817 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 [] [2022-12-12 15:07:55,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:57,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:07:58,561 INFO L130 PetriNetUnfolder]: 3234/4431 cut-off events. [2022-12-12 15:07:58,561 INFO L131 PetriNetUnfolder]: For 13469/13469 co-relation queries the response was YES. [2022-12-12 15:07:58,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19430 conditions, 4431 events. 3234/4431 cut-off events. For 13469/13469 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 18346 event pairs, 317 based on Foata normal form. 45/4476 useless extension candidates. Maximal degree in co-relation 12955. Up to 3031 conditions per place. [2022-12-12 15:07:58,593 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 163 selfloop transitions, 74 changer transitions 5/242 dead transitions. [2022-12-12 15:07:58,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 242 transitions, 1787 flow [2022-12-12 15:07:58,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-12 15:07:58,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-12 15:07:58,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 212 transitions. [2022-12-12 15:07:58,595 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6057142857142858 [2022-12-12 15:07:58,595 INFO L175 Difference]: Start difference. First operand has 55 places, 51 transitions, 336 flow. Second operand 14 states and 212 transitions. [2022-12-12 15:07:58,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 242 transitions, 1787 flow [2022-12-12 15:07:58,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 242 transitions, 1761 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-12 15:07:58,612 INFO L231 Difference]: Finished difference. Result has 76 places, 118 transitions, 1088 flow [2022-12-12 15:07:58,612 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1088, PETRI_PLACES=76, PETRI_TRANSITIONS=118} [2022-12-12 15:07:58,614 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2022-12-12 15:07:58,614 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 118 transitions, 1088 flow [2022-12-12 15:07:58,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:07:58,615 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:07:58,615 INFO L214 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] [2022-12-12 15:07:58,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 15:07:58,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:07:58,820 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:07:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:07:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash 458587945, now seen corresponding path program 1 times [2022-12-12 15:07:58,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:07:58,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853606188] [2022-12-12 15:07:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:07:58,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:07:58,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:07:59,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:07:59,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:07:59,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853606188] [2022-12-12 15:07:59,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853606188] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:07:59,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315446867] [2022-12-12 15:07:59,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:07:59,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:07:59,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:07:59,295 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) [2022-12-12 15:07:59,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 15:08:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:08:21,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 15:08:21,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:08:39,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:08:39,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:08:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:08:48,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315446867] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:08:48,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:08:48,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-12 15:08:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371851779] [2022-12-12 15:08:48,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:08:48,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 15:08:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:08:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 15:08:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=146, Unknown=9, NotChecked=0, Total=210 [2022-12-12 15:08:48,586 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:08:48,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 118 transitions, 1088 flow. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:08:48,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:08:48,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:08:48,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:08:51,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:02,270 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:04,275 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:06,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:08,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:11,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:13,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:23,687 WARN L233 SmtUtils]: Spent 8.11s on a formula simplification. DAG size of input: 69 DAG size of output: 41 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:09:25,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:27,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:29,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:31,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:33,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:35,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:38,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:41,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:43,117 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:50,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:09:52,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:10:07,946 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 59 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:10:41,727 WARN L233 SmtUtils]: Spent 27.92s on a formula simplification. DAG size of input: 84 DAG size of output: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:10:43,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:10:46,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:10:48,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:10:50,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:11:11,031 WARN L233 SmtUtils]: Spent 5.08s on a formula simplification. DAG size of input: 69 DAG size of output: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:11:20,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:11:23,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:11:25,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:11:27,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:11:29,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:11:31,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:11:33,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:11:42,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:11:58,311 WARN L233 SmtUtils]: Spent 9.30s on a formula simplification. DAG size of input: 88 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 15:12:00,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:02,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:04,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:09,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:12,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:13,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:15,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:17,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:19,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:24,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:30,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:34,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:36,821 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:38,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:40,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:42,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:45,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:47,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:49,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:12:51,942 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 [] [2022-12-12 15:12:52,235 INFO L130 PetriNetUnfolder]: 4958/6924 cut-off events. [2022-12-12 15:12:52,235 INFO L131 PetriNetUnfolder]: For 40558/40558 co-relation queries the response was YES. [2022-12-12 15:12:52,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39070 conditions, 6924 events. 4958/6924 cut-off events. For 40558/40558 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 31685 event pairs, 704 based on Foata normal form. 35/6959 useless extension candidates. Maximal degree in co-relation 37555. Up to 4689 conditions per place. [2022-12-12 15:12:52,277 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 325 selfloop transitions, 124 changer transitions 22/471 dead transitions. [2022-12-12 15:12:52,277 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 471 transitions, 4507 flow [2022-12-12 15:12:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-12-12 15:12:52,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2022-12-12 15:12:52,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 364 transitions. [2022-12-12 15:12:52,281 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.56 [2022-12-12 15:12:52,281 INFO L175 Difference]: Start difference. First operand has 76 places, 118 transitions, 1088 flow. Second operand 26 states and 364 transitions. [2022-12-12 15:12:52,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 471 transitions, 4507 flow [2022-12-12 15:12:52,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 471 transitions, 4338 flow, removed 80 selfloop flow, removed 1 redundant places. [2022-12-12 15:12:52,400 INFO L231 Difference]: Finished difference. Result has 114 places, 242 transitions, 2490 flow [2022-12-12 15:12:52,400 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2490, PETRI_PLACES=114, PETRI_TRANSITIONS=242} [2022-12-12 15:12:52,400 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 80 predicate places. [2022-12-12 15:12:52,401 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 242 transitions, 2490 flow [2022-12-12 15:12:52,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:12:52,401 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:12:52,401 INFO L214 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] [2022-12-12 15:12:52,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-12 15:12:52,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:12:52,608 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:12:52,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:12:52,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1437554915, now seen corresponding path program 2 times [2022-12-12 15:12:52,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:12:52,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868243091] [2022-12-12 15:12:52,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:12:52,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:12:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:12:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:12:53,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:12:53,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868243091] [2022-12-12 15:12:53,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868243091] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:12:53,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351636174] [2022-12-12 15:12:53,009 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 15:12:53,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:12:53,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:12:53,011 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) [2022-12-12 15:12:53,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 15:12:54,217 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 15:12:54,217 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:12:54,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 15:12:54,220 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:13:04,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:13:04,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:13:07,204 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:13:07,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351636174] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:13:07,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:13:07,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-12 15:13:07,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567187477] [2022-12-12 15:13:07,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:13:07,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 15:13:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:13:07,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 15:13:07,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=155, Unknown=2, NotChecked=0, Total=240 [2022-12-12 15:13:07,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:13:07,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 242 transitions, 2490 flow. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:13:07,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:13:07,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:13:07,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:13:09,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:13,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:16,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:17,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:18,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:20,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:22,920 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:25,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:27,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:29,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:31,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:33,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:35,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:37,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:39,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:41,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:44,062 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:46,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:48,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:50,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:52,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:54,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:57,034 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:13:59,775 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 [] [2022-12-12 15:14:02,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:14:04,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:14:06,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:14:09,021 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:14:11,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:14:13,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:14:15,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:14:16,027 INFO L130 PetriNetUnfolder]: 6559/9128 cut-off events. [2022-12-12 15:14:16,027 INFO L131 PetriNetUnfolder]: For 108489/108489 co-relation queries the response was YES. [2022-12-12 15:14:16,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62648 conditions, 9128 events. 6559/9128 cut-off events. For 108489/108489 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 43759 event pairs, 472 based on Foata normal form. 17/9145 useless extension candidates. Maximal degree in co-relation 61914. Up to 6837 conditions per place. [2022-12-12 15:14:16,102 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 311 selfloop transitions, 111 changer transitions 7/429 dead transitions. [2022-12-12 15:14:16,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 429 transitions, 5134 flow [2022-12-12 15:14:16,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-12 15:14:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-12 15:14:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 174 transitions. [2022-12-12 15:14:16,104 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6327272727272727 [2022-12-12 15:14:16,104 INFO L175 Difference]: Start difference. First operand has 114 places, 242 transitions, 2490 flow. Second operand 11 states and 174 transitions. [2022-12-12 15:14:16,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 429 transitions, 5134 flow [2022-12-12 15:14:16,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 429 transitions, 4732 flow, removed 201 selfloop flow, removed 0 redundant places. [2022-12-12 15:14:16,393 INFO L231 Difference]: Finished difference. Result has 131 places, 315 transitions, 3279 flow [2022-12-12 15:14:16,394 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=242, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=3279, PETRI_PLACES=131, PETRI_TRANSITIONS=315} [2022-12-12 15:14:16,394 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 97 predicate places. [2022-12-12 15:14:16,395 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 315 transitions, 3279 flow [2022-12-12 15:14:16,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:14:16,395 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:14:16,395 INFO L214 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] [2022-12-12 15:14:16,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-12 15:14:16,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:14:16,600 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:14:16,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:14:16,600 INFO L85 PathProgramCache]: Analyzing trace with hash 756914095, now seen corresponding path program 2 times [2022-12-12 15:14:16,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:14:16,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299925313] [2022-12-12 15:14:16,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:14:16,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:14:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:14:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:14:16,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:14:16,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299925313] [2022-12-12 15:14:16,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299925313] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:14:16,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485960233] [2022-12-12 15:14:16,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 15:14:16,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:14:16,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:14:16,896 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) [2022-12-12 15:14:16,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 15:14:34,434 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 15:14:34,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 15:14:34,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 15:14:34,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 15:14:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:14:54,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 15:14:59,264 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:14:59,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485960233] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 15:14:59,265 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 15:14:59,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-12 15:14:59,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135655208] [2022-12-12 15:14:59,265 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 15:14:59,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 15:14:59,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:14:59,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 15:14:59,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=168, Unknown=6, NotChecked=0, Total=240 [2022-12-12 15:14:59,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:14:59,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 315 transitions, 3279 flow. Second operand has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:14:59,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:14:59,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:14:59,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:15:01,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:05,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:09,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:12,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:14,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:25,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:28,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:30,297 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:32,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:34,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:37,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:39,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:41,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:43,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:45,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:48,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:51,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:53,781 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:56,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:15:58,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:01,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:03,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:06,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:08,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:10,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:13,095 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:15,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:17,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:19,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:22,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:24,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 15:16:24,739 INFO L130 PetriNetUnfolder]: 8673/12124 cut-off events. [2022-12-12 15:16:24,739 INFO L131 PetriNetUnfolder]: For 196585/196585 co-relation queries the response was YES. [2022-12-12 15:16:24,800 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89967 conditions, 12124 events. 8673/12124 cut-off events. For 196585/196585 co-relation queries the response was YES. Maximal size of possible extension queue 475. Compared 61968 event pairs, 785 based on Foata normal form. 6/12130 useless extension candidates. Maximal degree in co-relation 89155. Up to 9433 conditions per place. [2022-12-12 15:16:24,919 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 479 selfloop transitions, 118 changer transitions 7/604 dead transitions. [2022-12-12 15:16:24,920 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 604 transitions, 7543 flow [2022-12-12 15:16:24,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-12 15:16:24,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-12 15:16:24,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 277 transitions. [2022-12-12 15:16:24,921 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6517647058823529 [2022-12-12 15:16:24,921 INFO L175 Difference]: Start difference. First operand has 131 places, 315 transitions, 3279 flow. Second operand 17 states and 277 transitions. [2022-12-12 15:16:24,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 604 transitions, 7543 flow [2022-12-12 15:16:25,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 604 transitions, 7317 flow, removed 104 selfloop flow, removed 2 redundant places. [2022-12-12 15:16:25,736 INFO L231 Difference]: Finished difference. Result has 157 places, 409 transitions, 4617 flow [2022-12-12 15:16:25,736 INFO L277 CegarLoopForPetriNet]: {PETRI_ALPHABET=25, PETRI_DIFFERENCE_MINUEND_FLOW=3070, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=4617, PETRI_PLACES=157, PETRI_TRANSITIONS=409} [2022-12-12 15:16:25,737 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 123 predicate places. [2022-12-12 15:16:25,737 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 409 transitions, 4617 flow [2022-12-12 15:16:25,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.066666666666666) internal successors, (61), 15 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:16:25,737 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 15:16:25,737 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 15:16:25,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 15:16:25,943 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 [2022-12-12 15:16:25,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 15:16:25,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 15:16:25,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1241609821, now seen corresponding path program 3 times [2022-12-12 15:16:25,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 15:16:25,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307248651] [2022-12-12 15:16:25,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 15:16:25,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 15:16:25,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 15:16:26,139 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 15:16:26,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 15:16:26,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307248651] [2022-12-12 15:16:26,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307248651] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 15:16:26,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896673057] [2022-12-12 15:16:26,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 15:16:26,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 15:16:26,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 15:16:26,164 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) [2022-12-12 15:16:26,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process Received shutdown request... [2022-12-12 15:18:35,522 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 [2022-12-12 15:18:35,568 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 15:18:36,531 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 [2022-12-12 15:18:36,769 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forcibly destroying the process [2022-12-12 15:18:36,776 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-12 15:18:36,776 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-12 15:18:36,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2022-12-12 15:18:36,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516338901] [2022-12-12 15:18:36,777 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-12 15:18:36,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 15:18:36,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 15:18:36,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 15:18:36,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 15:18:36,778 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 15:18:36,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 409 transitions, 4617 flow. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 15:18:36,778 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 15:18:36,778 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 15:18:36,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 15:18:36,779 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 15:18:36,780 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 [2022-12-12 15:18:36,780 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-12 15:18:36,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-12 15:18:36,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 15:18:36,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 15:18:36,781 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-12 15:18:36,782 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1] [2022-12-12 15:18:36,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 137 [2022-12-12 15:18:36,796 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 15:18:36,796 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 15:18:36,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 03:18:36 BasicIcfg [2022-12-12 15:18:36,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 15:18:36,798 INFO L158 Benchmark]: Toolchain (without parser) took 880896.58ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 142.9MB in the beginning and 73.0MB in the end (delta: 69.8MB). Peak memory consumption was 189.8MB. Max. memory is 8.0GB. [2022-12-12 15:18:36,798 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 15:18:36,798 INFO L158 Benchmark]: CACSL2BoogieTranslator took 194.17ms. Allocated memory is still 165.7MB. Free memory was 142.9MB in the beginning and 131.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-12 15:18:36,799 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.61ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 129.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 15:18:36,799 INFO L158 Benchmark]: Boogie Preprocessor took 30.06ms. Allocated memory is still 165.7MB. Free memory was 129.8MB in the beginning and 128.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 15:18:36,799 INFO L158 Benchmark]: RCFGBuilder took 319.49ms. Allocated memory is still 165.7MB. Free memory was 128.2MB in the beginning and 113.9MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-12 15:18:36,799 INFO L158 Benchmark]: TraceAbstraction took 880312.11ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 112.5MB in the beginning and 73.0MB in the end (delta: 39.4MB). Peak memory consumption was 159.4MB. Max. memory is 8.0GB. [2022-12-12 15:18:36,800 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 127.9MB. Free memory is still 104.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 194.17ms. Allocated memory is still 165.7MB. Free memory was 142.9MB in the beginning and 131.3MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 35.61ms. Allocated memory is still 165.7MB. Free memory was 131.3MB in the beginning and 129.8MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.06ms. Allocated memory is still 165.7MB. Free memory was 129.8MB in the beginning and 128.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 319.49ms. Allocated memory is still 165.7MB. Free memory was 128.2MB in the beginning and 113.9MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 880312.11ms. Allocated memory was 165.7MB in the beginning and 287.3MB in the end (delta: 121.6MB). Free memory was 112.5MB in the beginning and 73.0MB in the end (delta: 39.4MB). Peak memory consumption was 159.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.3s, 109 PlacesBefore, 34 PlacesAfterwards, 106 TransitionsBefore, 25 TransitionsAfterwards, 1512 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 33 ConcurrentYvCompositions, 6 ChoiceCompositions, 81 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 763, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 763, independent: 763, independent conditional: 0, independent unconditional: 763, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 763, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 763, unknown conditional: 0, unknown unconditional: 763] , Statistics on independence cache: Total cache size (in pairs): 1257, Positive cache size: 1257, Positive conditional cache size: 0, Positive unconditional cache size: 1257, Negative cache size: 0, Negative conditional cache size: 0, Negative unconditional cache size: 0, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 0, Maximal queried relation: -1 - TimeoutResultAtElement [Line: 96]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 88]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 89]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 87]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 141 locations, 5 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: 880.2s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 573.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.5s, HoareTripleCheckerStatistics: 149 mSolverCounterUnknown, 1243 SdHoareTripleChecker+Valid, 407.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1243 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 404.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 146 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3720 IncrementalHoareTripleChecker+Invalid, 4016 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 146 mSolverCounterUnsat, 0 mSDtfsCounter, 3720 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 259 SyntacticMatches, 10 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 273.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4617occurred in iteration=11, InterpolantAutomatonStates: 101, 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, 41.8s SatisfiabilityAnalysisTime, 128.3s InterpolantComputationTime, 427 NumberOfCodeBlocks, 427 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 559 ConstructedInterpolants, 0 QuantifiedInterpolants, 21851 SizeOfPredicates, 35 NumberOfNonLiveVariables, 1412 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 26 InterpolantComputations, 4 PerfectInterpolantSequences, 5/40 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