/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-exp3x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-05 20:50:07,358 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-05 20:50:07,360 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-05 20:50:07,385 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-05 20:50:07,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-05 20:50:07,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-05 20:50:07,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-05 20:50:07,393 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-05 20:50:07,397 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-05 20:50:07,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-05 20:50:07,398 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-05 20:50:07,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-05 20:50:07,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-05 20:50:07,400 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-05 20:50:07,401 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-05 20:50:07,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-05 20:50:07,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-05 20:50:07,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-05 20:50:07,405 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-05 20:50:07,406 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-05 20:50:07,410 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-05 20:50:07,414 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-05 20:50:07,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-05 20:50:07,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-05 20:50:07,430 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-05 20:50:07,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-05 20:50:07,431 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-05 20:50:07,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-05 20:50:07,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-05 20:50:07,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-05 20:50:07,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-05 20:50:07,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-05 20:50:07,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-05 20:50:07,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-05 20:50:07,435 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-05 20:50:07,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-05 20:50:07,436 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-05 20:50:07,436 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-05 20:50:07,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-05 20:50:07,437 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-05 20:50:07,438 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-05 20:50:07,440 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-05 20:50:07,470 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-05 20:50:07,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-05 20:50:07,472 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-05 20:50:07,472 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-05 20:50:07,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-05 20:50:07,473 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-05 20:50:07,473 INFO L138 SettingsManager]: * Use SBE=true [2022-12-05 20:50:07,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-05 20:50:07,474 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-05 20:50:07,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-05 20:50:07,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-05 20:50:07,475 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-05 20:50:07,475 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-05 20:50:07,475 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-05 20:50:07,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-05 20:50:07,475 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-05 20:50:07,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-05 20:50:07,475 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-05 20:50:07,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-05 20:50:07,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-05 20:50:07,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-05 20:50:07,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-05 20:50:07,476 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-05 20:50:07,476 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:50:07,476 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-05 20:50:07,476 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-05 20:50:07,477 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-05 20:50:07,477 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-05 20:50:07,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-05 20:50:07,477 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-05 20:50:07,477 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-05 20:50:07,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-05 20:50:07,774 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-05 20:50:07,776 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-05 20:50:07,777 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-05 20:50:07,778 INFO L275 PluginConnector]: CDTParser initialized [2022-12-05 20:50:07,779 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2022-12-05 20:50:08,845 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-05 20:50:09,059 INFO L351 CDTParser]: Found 1 translation units. [2022-12-05 20:50:09,060 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3.wvr.c [2022-12-05 20:50:09,065 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c14d785e7/1d753dcee1ff4227938145527edd1a25/FLAGc54dc8c60 [2022-12-05 20:50:09,078 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c14d785e7/1d753dcee1ff4227938145527edd1a25 [2022-12-05 20:50:09,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-05 20:50:09,081 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-05 20:50:09,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-05 20:50:09,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-05 20:50:09,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-05 20:50:09,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4717213f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09, skipping insertion in model container [2022-12-05 20:50:09,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-05 20:50:09,109 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-05 20:50:09,252 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-exp3x3.wvr.c[2625,2638] [2022-12-05 20:50:09,255 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:50:09,262 INFO L203 MainTranslator]: Completed pre-run [2022-12-05 20:50:09,297 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-exp3x3.wvr.c[2625,2638] [2022-12-05 20:50:09,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-05 20:50:09,315 INFO L208 MainTranslator]: Completed translation [2022-12-05 20:50:09,316 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09 WrapperNode [2022-12-05 20:50:09,317 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-05 20:50:09,318 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-05 20:50:09,319 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-05 20:50:09,319 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-05 20:50:09,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,333 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,353 INFO L138 Inliner]: procedures = 22, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-12-05 20:50:09,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-05 20:50:09,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-05 20:50:09,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-05 20:50:09,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-05 20:50:09,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,371 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,375 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,377 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-05 20:50:09,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-05 20:50:09,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-05 20:50:09,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-05 20:50:09,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (1/1) ... [2022-12-05 20:50:09,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-05 20:50:09,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:50:09,417 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-05 20:50:09,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-05 20:50:09,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-05 20:50:09,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-05 20:50:09,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-05 20:50:09,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-05 20:50:09,454 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-05 20:50:09,454 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-05 20:50:09,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-05 20:50:09,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-05 20:50:09,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-05 20:50:09,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-05 20:50:09,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-05 20:50:09,455 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-05 20:50:09,455 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-05 20:50:09,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-05 20:50:09,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-05 20:50:09,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-05 20:50:09,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-05 20:50:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-05 20:50:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-05 20:50:09,457 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-05 20:50:09,446 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-05 20:50:09,578 INFO L236 CfgBuilder]: Building ICFG [2022-12-05 20:50:09,580 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-05 20:50:09,866 INFO L277 CfgBuilder]: Performing block encoding [2022-12-05 20:50:09,876 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-05 20:50:09,877 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-05 20:50:09,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:50:09 BoogieIcfgContainer [2022-12-05 20:50:09,879 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-05 20:50:09,881 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-05 20:50:09,881 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-05 20:50:09,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-05 20:50:09,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.12 08:50:09" (1/3) ... [2022-12-05 20:50:09,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393a68a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:50:09, skipping insertion in model container [2022-12-05 20:50:09,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.12 08:50:09" (2/3) ... [2022-12-05 20:50:09,887 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393a68a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.12 08:50:09, skipping insertion in model container [2022-12-05 20:50:09,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.12 08:50:09" (3/3) ... [2022-12-05 20:50:09,888 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3.wvr.c [2022-12-05 20:50:09,905 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-05 20:50:09,905 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-05 20:50:09,905 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-05 20:50:09,993 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-05 20:50:10,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 162 transitions, 372 flow [2022-12-05 20:50:10,160 INFO L130 PetriNetUnfolder]: 14/156 cut-off events. [2022-12-05 20:50:10,161 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 20:50:10,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 181 conditions, 156 events. 14/156 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/141 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-05 20:50:10,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 162 transitions, 372 flow [2022-12-05 20:50:10,178 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 140 transitions, 316 flow [2022-12-05 20:50:10,179 INFO L195 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-05 20:50:10,208 INFO L167 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-05 20:50:10,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 140 transitions, 316 flow [2022-12-05 20:50:10,273 INFO L130 PetriNetUnfolder]: 14/140 cut-off events. [2022-12-05 20:50:10,274 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 20:50:10,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 140 events. 14/140 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 115. Up to 2 conditions per place. [2022-12-05 20:50:10,282 INFO L184 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-05 20:50:10,282 INFO L188 LiptonReduction]: Number of co-enabled transitions 2916 [2022-12-05 20:50:16,162 INFO L203 LiptonReduction]: Total number of compositions: 103 [2022-12-05 20:50:16,177 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-05 20:50:16,183 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;@17b329b1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-05 20:50:16,183 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-05 20:50:16,189 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-05 20:50:16,189 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-05 20:50:16,189 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:16,190 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:16,190 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 4 more)] === [2022-12-05 20:50:16,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:16,194 INFO L85 PathProgramCache]: Analyzing trace with hash -54134606, now seen corresponding path program 1 times [2022-12-05 20:50:16,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:16,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406366898] [2022-12-05 20:50:16,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:16,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:16,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:17,046 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-05 20:50:17,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:17,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406366898] [2022-12-05 20:50:17,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406366898] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:17,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:17,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-05 20:50:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076586888] [2022-12-05 20:50:17,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:17,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-05 20:50:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:17,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-05 20:50:17,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-05 20:50:17,075 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:17,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 110 flow. Second operand has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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-05 20:50:17,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:17,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:17,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:17,488 INFO L130 PetriNetUnfolder]: 3473/4229 cut-off events. [2022-12-05 20:50:17,489 INFO L131 PetriNetUnfolder]: For 218/218 co-relation queries the response was YES. [2022-12-05 20:50:17,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8842 conditions, 4229 events. 3473/4229 cut-off events. For 218/218 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 11636 event pairs, 837 based on Foata normal form. 1/2430 useless extension candidates. Maximal degree in co-relation 6136. Up to 3015 conditions per place. [2022-12-05 20:50:17,515 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 63 selfloop transitions, 7 changer transitions 1/71 dead transitions. [2022-12-05 20:50:17,515 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 353 flow [2022-12-05 20:50:17,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-05 20:50:17,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-05 20:50:17,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-05 20:50:17,525 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-05 20:50:17,526 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 110 flow. Second operand 3 states and 72 transitions. [2022-12-05 20:50:17,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 71 transitions, 353 flow [2022-12-05 20:50:17,534 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 307 flow, removed 0 selfloop flow, removed 12 redundant places. [2022-12-05 20:50:17,536 INFO L231 Difference]: Finished difference. Result has 41 places, 43 transitions, 133 flow [2022-12-05 20:50:17,537 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=41, PETRI_TRANSITIONS=43} [2022-12-05 20:50:17,540 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -9 predicate places. [2022-12-05 20:50:17,540 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 43 transitions, 133 flow [2022-12-05 20:50:17,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 0 states have call successors, (0), 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-05 20:50:17,541 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:17,541 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:17,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-05 20:50:17,541 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 4 more)] === [2022-12-05 20:50:17,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:17,542 INFO L85 PathProgramCache]: Analyzing trace with hash -685639153, now seen corresponding path program 1 times [2022-12-05 20:50:17,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:17,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971024415] [2022-12-05 20:50:17,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:17,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:17,790 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-05 20:50:17,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:17,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971024415] [2022-12-05 20:50:17,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971024415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:17,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:17,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:50:17,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729161472] [2022-12-05 20:50:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:17,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:50:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:17,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:50:17,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:50:17,801 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:17,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 43 transitions, 133 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:17,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:17,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:17,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:18,436 INFO L130 PetriNetUnfolder]: 5067/6189 cut-off events. [2022-12-05 20:50:18,436 INFO L131 PetriNetUnfolder]: For 2240/2240 co-relation queries the response was YES. [2022-12-05 20:50:18,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15972 conditions, 6189 events. 5067/6189 cut-off events. For 2240/2240 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 19168 event pairs, 259 based on Foata normal form. 122/6311 useless extension candidates. Maximal degree in co-relation 4985. Up to 3157 conditions per place. [2022-12-05 20:50:18,471 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 116 selfloop transitions, 10 changer transitions 0/126 dead transitions. [2022-12-05 20:50:18,471 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 126 transitions, 621 flow [2022-12-05 20:50:18,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:18,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-05 20:50:18,475 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2022-12-05 20:50:18,475 INFO L175 Difference]: Start difference. First operand has 41 places, 43 transitions, 133 flow. Second operand 5 states and 116 transitions. [2022-12-05 20:50:18,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 126 transitions, 621 flow [2022-12-05 20:50:18,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 126 transitions, 609 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:50:18,480 INFO L231 Difference]: Finished difference. Result has 46 places, 50 transitions, 191 flow [2022-12-05 20:50:18,480 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=46, PETRI_TRANSITIONS=50} [2022-12-05 20:50:18,481 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, -4 predicate places. [2022-12-05 20:50:18,481 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 50 transitions, 191 flow [2022-12-05 20:50:18,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:18,481 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:18,482 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:18,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-05 20:50:18,482 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 4 more)] === [2022-12-05 20:50:18,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:18,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1491440014, now seen corresponding path program 1 times [2022-12-05 20:50:18,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:18,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140268567] [2022-12-05 20:50:18,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:18,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:18,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:18,748 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-05 20:50:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:18,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140268567] [2022-12-05 20:50:18,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140268567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:18,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:18,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:50:18,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892108795] [2022-12-05 20:50:18,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:18,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:50:18,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:18,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:50:18,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:50:18,755 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:18,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 50 transitions, 191 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:18,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:18,755 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:18,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:19,267 INFO L130 PetriNetUnfolder]: 4881/6003 cut-off events. [2022-12-05 20:50:19,267 INFO L131 PetriNetUnfolder]: For 4584/4584 co-relation queries the response was YES. [2022-12-05 20:50:19,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16717 conditions, 6003 events. 4881/6003 cut-off events. For 4584/4584 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 18795 event pairs, 259 based on Foata normal form. 186/6189 useless extension candidates. Maximal degree in co-relation 7058. Up to 3157 conditions per place. [2022-12-05 20:50:19,307 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 116 selfloop transitions, 8 changer transitions 0/124 dead transitions. [2022-12-05 20:50:19,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 124 transitions, 642 flow [2022-12-05 20:50:19,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:19,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:19,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 115 transitions. [2022-12-05 20:50:19,312 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6216216216216216 [2022-12-05 20:50:19,312 INFO L175 Difference]: Start difference. First operand has 46 places, 50 transitions, 191 flow. Second operand 5 states and 115 transitions. [2022-12-05 20:50:19,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 124 transitions, 642 flow [2022-12-05 20:50:19,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 124 transitions, 642 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:50:19,322 INFO L231 Difference]: Finished difference. Result has 51 places, 49 transitions, 205 flow [2022-12-05 20:50:19,322 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=205, PETRI_PLACES=51, PETRI_TRANSITIONS=49} [2022-12-05 20:50:19,323 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 1 predicate places. [2022-12-05 20:50:19,323 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 49 transitions, 205 flow [2022-12-05 20:50:19,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:19,323 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:19,324 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:19,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-05 20:50:19,324 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 4 more)] === [2022-12-05 20:50:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:19,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1579273175, now seen corresponding path program 2 times [2022-12-05 20:50:19,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:19,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102234779] [2022-12-05 20:50:19,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:19,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:19,508 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-05 20:50:19,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:19,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102234779] [2022-12-05 20:50:19,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102234779] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:50:19,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646711909] [2022-12-05 20:50:19,509 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 20:50:19,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:19,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:50:19,515 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-05 20:50:19,543 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-05 20:50:19,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 20:50:19,669 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:50:19,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 20:50:19,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:50:20,031 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-05 20:50:20,032 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:50:20,109 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-05 20:50:20,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646711909] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:50:20,109 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:50:20,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-05 20:50:20,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484702666] [2022-12-05 20:50:20,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:50:20,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:50:20,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:20,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:50:20,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:50:20,111 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:20,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 49 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-05 20:50:20,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:20,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:20,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:20,762 INFO L130 PetriNetUnfolder]: 5649/6927 cut-off events. [2022-12-05 20:50:20,762 INFO L131 PetriNetUnfolder]: For 8469/8469 co-relation queries the response was YES. [2022-12-05 20:50:20,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20564 conditions, 6927 events. 5649/6927 cut-off events. For 8469/8469 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 21270 event pairs, 1803 based on Foata normal form. 156/7083 useless extension candidates. Maximal degree in co-relation 9382. Up to 3643 conditions per place. [2022-12-05 20:50:20,799 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 114 selfloop transitions, 8 changer transitions 0/122 dead transitions. [2022-12-05 20:50:20,799 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 122 transitions, 662 flow [2022-12-05 20:50:20,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:20,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:20,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 116 transitions. [2022-12-05 20:50:20,801 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6270270270270271 [2022-12-05 20:50:20,801 INFO L175 Difference]: Start difference. First operand has 51 places, 49 transitions, 205 flow. Second operand 5 states and 116 transitions. [2022-12-05 20:50:20,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 122 transitions, 662 flow [2022-12-05 20:50:20,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 122 transitions, 655 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-05 20:50:20,806 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 248 flow [2022-12-05 20:50:20,806 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=248, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-05 20:50:20,807 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 6 predicate places. [2022-12-05 20:50:20,807 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 248 flow [2022-12-05 20:50:20,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 5 states have internal predecessors, (54), 0 states have call successors, (0), 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-05 20:50:20,807 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:20,807 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:20,819 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-05 20:50:21,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:21,013 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 4 more)] === [2022-12-05 20:50:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:21,014 INFO L85 PathProgramCache]: Analyzing trace with hash 873411309, now seen corresponding path program 1 times [2022-12-05 20:50:21,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:21,014 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472174333] [2022-12-05 20:50:21,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:21,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:21,168 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-05 20:50:21,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:21,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472174333] [2022-12-05 20:50:21,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472174333] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:50:21,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103050018] [2022-12-05 20:50:21,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:21,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:21,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:50:21,171 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-05 20:50:21,176 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-05 20:50:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:21,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 20:50:21,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:50:21,370 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-05 20:50:21,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:50:21,411 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-05 20:50:21,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103050018] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:50:21,412 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:50:21,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-05 20:50:21,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401542758] [2022-12-05 20:50:21,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:50:21,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:50:21,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:21,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:50:21,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:50:21,413 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:21,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 248 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-05 20:50:21,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:21,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:21,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:22,623 INFO L130 PetriNetUnfolder]: 13057/16015 cut-off events. [2022-12-05 20:50:22,623 INFO L131 PetriNetUnfolder]: For 28062/28062 co-relation queries the response was YES. [2022-12-05 20:50:22,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51297 conditions, 16015 events. 13057/16015 cut-off events. For 28062/28062 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 57652 event pairs, 2873 based on Foata normal form. 408/16423 useless extension candidates. Maximal degree in co-relation 34546. Up to 6947 conditions per place. [2022-12-05 20:50:22,709 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 150 selfloop transitions, 8 changer transitions 0/158 dead transitions. [2022-12-05 20:50:22,710 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 158 transitions, 1082 flow [2022-12-05 20:50:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:22,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 118 transitions. [2022-12-05 20:50:22,711 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6378378378378379 [2022-12-05 20:50:22,711 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 248 flow. Second operand 5 states and 118 transitions. [2022-12-05 20:50:22,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 158 transitions, 1082 flow [2022-12-05 20:50:22,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 158 transitions, 1055 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 20:50:22,787 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 294 flow [2022-12-05 20:50:22,787 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=294, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2022-12-05 20:50:22,789 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2022-12-05 20:50:22,789 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 294 flow [2022-12-05 20:50:22,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-05 20:50:22,790 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:22,790 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:22,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-05 20:50:22,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:22,996 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 4 more)] === [2022-12-05 20:50:22,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:22,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1274253357, now seen corresponding path program 2 times [2022-12-05 20:50:22,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:22,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316797522] [2022-12-05 20:50:22,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:22,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:23,209 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-05 20:50:23,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:23,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316797522] [2022-12-05 20:50:23,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316797522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:23,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:23,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:50:23,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333557780] [2022-12-05 20:50:23,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:23,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:50:23,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:50:23,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:50:23,212 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:23,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:23,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:23,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:23,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:24,256 INFO L130 PetriNetUnfolder]: 11213/13735 cut-off events. [2022-12-05 20:50:24,256 INFO L131 PetriNetUnfolder]: For 26978/26978 co-relation queries the response was YES. [2022-12-05 20:50:24,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50231 conditions, 13735 events. 11213/13735 cut-off events. For 26978/26978 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 49331 event pairs, 471 based on Foata normal form. 268/14003 useless extension candidates. Maximal degree in co-relation 34555. Up to 5849 conditions per place. [2022-12-05 20:50:24,330 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 150 selfloop transitions, 11 changer transitions 0/161 dead transitions. [2022-12-05 20:50:24,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 161 transitions, 1148 flow [2022-12-05 20:50:24,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-05 20:50:24,331 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2022-12-05 20:50:24,332 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 294 flow. Second operand 5 states and 112 transitions. [2022-12-05 20:50:24,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 161 transitions, 1148 flow [2022-12-05 20:50:24,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 161 transitions, 1148 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:50:24,399 INFO L231 Difference]: Finished difference. Result has 67 places, 62 transitions, 355 flow [2022-12-05 20:50:24,399 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=355, PETRI_PLACES=67, PETRI_TRANSITIONS=62} [2022-12-05 20:50:24,402 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2022-12-05 20:50:24,402 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 62 transitions, 355 flow [2022-12-05 20:50:24,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:24,402 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:24,402 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:24,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-05 20:50:24,402 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 4 more)] === [2022-12-05 20:50:24,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash -427571439, now seen corresponding path program 1 times [2022-12-05 20:50:24,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:24,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777665834] [2022-12-05 20:50:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:24,675 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-05 20:50:24,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:24,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777665834] [2022-12-05 20:50:24,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777665834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:24,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:24,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:50:24,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342476392] [2022-12-05 20:50:24,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:24,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:50:24,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:24,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:50:24,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:50:24,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:24,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 62 transitions, 355 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:24,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:24,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:24,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:25,683 INFO L130 PetriNetUnfolder]: 10921/13443 cut-off events. [2022-12-05 20:50:25,684 INFO L131 PetriNetUnfolder]: For 31534/31534 co-relation queries the response was YES. [2022-12-05 20:50:25,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52574 conditions, 13443 events. 10921/13443 cut-off events. For 31534/31534 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 49085 event pairs, 471 based on Foata normal form. 292/13735 useless extension candidates. Maximal degree in co-relation 36230. Up to 5557 conditions per place. [2022-12-05 20:50:25,775 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 151 selfloop transitions, 8 changer transitions 0/159 dead transitions. [2022-12-05 20:50:25,775 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 159 transitions, 1161 flow [2022-12-05 20:50:25,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:25,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:25,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2022-12-05 20:50:25,777 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6 [2022-12-05 20:50:25,777 INFO L175 Difference]: Start difference. First operand has 67 places, 62 transitions, 355 flow. Second operand 5 states and 111 transitions. [2022-12-05 20:50:25,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 159 transitions, 1161 flow [2022-12-05 20:50:25,859 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 159 transitions, 1150 flow, removed 3 selfloop flow, removed 1 redundant places. [2022-12-05 20:50:25,861 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 358 flow [2022-12-05 20:50:25,861 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=358, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2022-12-05 20:50:25,861 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 21 predicate places. [2022-12-05 20:50:25,861 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 358 flow [2022-12-05 20:50:25,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:25,861 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:25,862 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:25,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-05 20:50:25,862 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 4 more)] === [2022-12-05 20:50:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:25,862 INFO L85 PathProgramCache]: Analyzing trace with hash -614309630, now seen corresponding path program 1 times [2022-12-05 20:50:25,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:25,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837759601] [2022-12-05 20:50:25,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:25,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:25,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:26,074 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-05 20:50:26,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:26,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837759601] [2022-12-05 20:50:26,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837759601] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:50:26,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148295155] [2022-12-05 20:50:26,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:26,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:26,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:50:26,077 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-05 20:50:26,079 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-05 20:50:26,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:26,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 20:50:26,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:50:26,368 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-05 20:50:26,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:50:26,472 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-05 20:50:26,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148295155] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:50:26,473 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:50:26,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-05 20:50:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789823007] [2022-12-05 20:50:26,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:50:26,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:50:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:26,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:50:26,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:50:26,474 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:26,474 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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-05 20:50:26,474 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:26,474 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:26,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:28,399 INFO L130 PetriNetUnfolder]: 24421/30017 cut-off events. [2022-12-05 20:50:28,399 INFO L131 PetriNetUnfolder]: For 90165/90165 co-relation queries the response was YES. [2022-12-05 20:50:28,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120109 conditions, 30017 events. 24421/30017 cut-off events. For 90165/90165 co-relation queries the response was YES. Maximal size of possible extension queue 819. Compared 118167 event pairs, 4823 based on Foata normal form. 744/30761 useless extension candidates. Maximal degree in co-relation 77250. Up to 13194 conditions per place. [2022-12-05 20:50:28,542 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 178 selfloop transitions, 8 changer transitions 0/186 dead transitions. [2022-12-05 20:50:28,542 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 186 transitions, 1492 flow [2022-12-05 20:50:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2022-12-05 20:50:28,543 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2022-12-05 20:50:28,543 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 358 flow. Second operand 5 states and 110 transitions. [2022-12-05 20:50:28,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 186 transitions, 1492 flow [2022-12-05 20:50:28,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 186 transitions, 1457 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 20:50:28,572 INFO L231 Difference]: Finished difference. Result has 77 places, 66 transitions, 402 flow [2022-12-05 20:50:28,573 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=402, PETRI_PLACES=77, PETRI_TRANSITIONS=66} [2022-12-05 20:50:28,573 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2022-12-05 20:50:28,573 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 66 transitions, 402 flow [2022-12-05 20:50:28,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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-05 20:50:28,573 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:28,574 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:28,578 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-05 20:50:28,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:28,774 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 4 more)] === [2022-12-05 20:50:28,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1599300327, now seen corresponding path program 1 times [2022-12-05 20:50:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:28,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251530396] [2022-12-05 20:50:28,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:28,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:28,953 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-05 20:50:28,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:28,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251530396] [2022-12-05 20:50:28,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251530396] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:28,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:28,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:50:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372519321] [2022-12-05 20:50:28,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:28,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:50:28,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:28,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:50:28,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:50:28,956 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:28,956 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 66 transitions, 402 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:28,956 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:28,956 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:28,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:31,070 INFO L130 PetriNetUnfolder]: 24045/29641 cut-off events. [2022-12-05 20:50:31,070 INFO L131 PetriNetUnfolder]: For 88745/88745 co-relation queries the response was YES. [2022-12-05 20:50:31,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130397 conditions, 29641 events. 24045/29641 cut-off events. For 88745/88745 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 119375 event pairs, 1383 based on Foata normal form. 376/30017 useless extension candidates. Maximal degree in co-relation 89224. Up to 12818 conditions per place. [2022-12-05 20:50:31,212 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 184 selfloop transitions, 10 changer transitions 0/194 dead transitions. [2022-12-05 20:50:31,213 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 194 transitions, 1591 flow [2022-12-05 20:50:31,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:31,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-05 20:50:31,214 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2022-12-05 20:50:31,214 INFO L175 Difference]: Start difference. First operand has 77 places, 66 transitions, 402 flow. Second operand 5 states and 108 transitions. [2022-12-05 20:50:31,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 194 transitions, 1591 flow [2022-12-05 20:50:31,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 194 transitions, 1591 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-05 20:50:31,411 INFO L231 Difference]: Finished difference. Result has 82 places, 71 transitions, 465 flow [2022-12-05 20:50:31,411 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=465, PETRI_PLACES=82, PETRI_TRANSITIONS=71} [2022-12-05 20:50:31,411 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 32 predicate places. [2022-12-05 20:50:31,412 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 71 transitions, 465 flow [2022-12-05 20:50:31,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:31,412 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:31,412 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:31,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-05 20:50:31,412 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 4 more)] === [2022-12-05 20:50:31,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:31,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1571483643, now seen corresponding path program 2 times [2022-12-05 20:50:31,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:31,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848084699] [2022-12-05 20:50:31,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:31,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:31,579 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-05 20:50:31,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:31,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848084699] [2022-12-05 20:50:31,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848084699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:31,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:31,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:50:31,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741651961] [2022-12-05 20:50:31,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:31,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:50:31,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:31,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:50:31,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:50:31,580 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:31,581 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 71 transitions, 465 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:31,581 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:31,581 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:31,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:33,972 INFO L130 PetriNetUnfolder]: 27453/33785 cut-off events. [2022-12-05 20:50:33,972 INFO L131 PetriNetUnfolder]: For 105497/105497 co-relation queries the response was YES. [2022-12-05 20:50:34,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155104 conditions, 33785 events. 27453/33785 cut-off events. For 105497/105497 co-relation queries the response was YES. Maximal size of possible extension queue 893. Compared 135511 event pairs, 4471 based on Foata normal form. 736/34521 useless extension candidates. Maximal degree in co-relation 106141. Up to 19825 conditions per place. [2022-12-05 20:50:34,157 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 177 selfloop transitions, 10 changer transitions 0/187 dead transitions. [2022-12-05 20:50:34,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 187 transitions, 1566 flow [2022-12-05 20:50:34,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:34,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:34,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 104 transitions. [2022-12-05 20:50:34,158 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5621621621621622 [2022-12-05 20:50:34,158 INFO L175 Difference]: Start difference. First operand has 82 places, 71 transitions, 465 flow. Second operand 5 states and 104 transitions. [2022-12-05 20:50:34,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 187 transitions, 1566 flow [2022-12-05 20:50:34,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 187 transitions, 1551 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-05 20:50:34,611 INFO L231 Difference]: Finished difference. Result has 87 places, 74 transitions, 504 flow [2022-12-05 20:50:34,611 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=504, PETRI_PLACES=87, PETRI_TRANSITIONS=74} [2022-12-05 20:50:34,611 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 37 predicate places. [2022-12-05 20:50:34,612 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 74 transitions, 504 flow [2022-12-05 20:50:34,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:34,612 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:34,612 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:34,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-05 20:50:34,612 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 4 more)] === [2022-12-05 20:50:34,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -2042265612, now seen corresponding path program 2 times [2022-12-05 20:50:34,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:34,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515829693] [2022-12-05 20:50:34,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:34,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:34,824 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-05 20:50:34,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:34,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515829693] [2022-12-05 20:50:34,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515829693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:34,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:34,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:50:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630051355] [2022-12-05 20:50:34,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:34,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:50:34,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:34,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:50:34,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:50:34,827 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:34,827 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 74 transitions, 504 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:34,827 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:34,827 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:34,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:36,938 INFO L130 PetriNetUnfolder]: 24413/29993 cut-off events. [2022-12-05 20:50:36,939 INFO L131 PetriNetUnfolder]: For 101179/101179 co-relation queries the response was YES. [2022-12-05 20:50:37,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143527 conditions, 29993 events. 24413/29993 cut-off events. For 101179/101179 co-relation queries the response was YES. Maximal size of possible extension queue 761. Compared 118655 event pairs, 1399 based on Foata normal form. 368/30361 useless extension candidates. Maximal degree in co-relation 126037. Up to 13182 conditions per place. [2022-12-05 20:50:37,125 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 185 selfloop transitions, 9 changer transitions 0/194 dead transitions. [2022-12-05 20:50:37,125 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 194 transitions, 1645 flow [2022-12-05 20:50:37,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:37,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:37,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2022-12-05 20:50:37,127 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5783783783783784 [2022-12-05 20:50:37,127 INFO L175 Difference]: Start difference. First operand has 87 places, 74 transitions, 504 flow. Second operand 5 states and 107 transitions. [2022-12-05 20:50:37,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 194 transitions, 1645 flow [2022-12-05 20:50:37,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 194 transitions, 1621 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-05 20:50:37,604 INFO L231 Difference]: Finished difference. Result has 90 places, 73 transitions, 495 flow [2022-12-05 20:50:37,604 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=495, PETRI_PLACES=90, PETRI_TRANSITIONS=73} [2022-12-05 20:50:37,605 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 40 predicate places. [2022-12-05 20:50:37,605 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 73 transitions, 495 flow [2022-12-05 20:50:37,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:37,605 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:37,605 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:37,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-05 20:50:37,606 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 4 more)] === [2022-12-05 20:50:37,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:37,606 INFO L85 PathProgramCache]: Analyzing trace with hash 587393343, now seen corresponding path program 2 times [2022-12-05 20:50:37,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:37,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124160516] [2022-12-05 20:50:37,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:37,792 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-05 20:50:37,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:37,792 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124160516] [2022-12-05 20:50:37,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124160516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:50:37,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1858027273] [2022-12-05 20:50:37,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 20:50:37,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:37,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:50:37,794 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-05 20:50:37,797 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-05 20:50:37,958 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 20:50:37,959 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:50:37,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-05 20:50:37,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:50:38,096 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-05 20:50:38,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:50:38,136 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-05 20:50:38,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1858027273] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:50:38,137 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:50:38,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-05 20:50:38,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84094598] [2022-12-05 20:50:38,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:50:38,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-05 20:50:38,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:38,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-05 20:50:38,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-05 20:50:38,138 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:38,138 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 73 transitions, 495 flow. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-05 20:50:38,138 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:38,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:38,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:40,828 INFO L130 PetriNetUnfolder]: 29277/35873 cut-off events. [2022-12-05 20:50:40,828 INFO L131 PetriNetUnfolder]: For 128001/128001 co-relation queries the response was YES. [2022-12-05 20:50:40,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 171320 conditions, 35873 events. 29277/35873 cut-off events. For 128001/128001 co-relation queries the response was YES. Maximal size of possible extension queue 874. Compared 145080 event pairs, 5255 based on Foata normal form. 1016/36889 useless extension candidates. Maximal degree in co-relation 150102. Up to 20069 conditions per place. [2022-12-05 20:50:41,035 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 193 selfloop transitions, 8 changer transitions 0/201 dead transitions. [2022-12-05 20:50:41,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 201 transitions, 1737 flow [2022-12-05 20:50:41,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:41,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:41,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2022-12-05 20:50:41,036 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.5837837837837838 [2022-12-05 20:50:41,036 INFO L175 Difference]: Start difference. First operand has 90 places, 73 transitions, 495 flow. Second operand 5 states and 108 transitions. [2022-12-05 20:50:41,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 201 transitions, 1737 flow [2022-12-05 20:50:41,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 201 transitions, 1702 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-05 20:50:41,351 INFO L231 Difference]: Finished difference. Result has 95 places, 76 transitions, 535 flow [2022-12-05 20:50:41,351 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=484, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=535, PETRI_PLACES=95, PETRI_TRANSITIONS=76} [2022-12-05 20:50:41,352 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 45 predicate places. [2022-12-05 20:50:41,352 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 76 transitions, 535 flow [2022-12-05 20:50:41,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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-05 20:50:41,352 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:41,352 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:41,360 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-05 20:50:41,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:41,558 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:50:41,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:41,558 INFO L85 PathProgramCache]: Analyzing trace with hash 283825908, now seen corresponding path program 2 times [2022-12-05 20:50:41,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:41,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656069074] [2022-12-05 20:50:41,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:41,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:41,802 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-05 20:50:41,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:41,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656069074] [2022-12-05 20:50:41,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656069074] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-05 20:50:41,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-05 20:50:41,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-05 20:50:41,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14456892] [2022-12-05 20:50:41,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-05 20:50:41,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-05 20:50:41,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:50:41,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-05 20:50:41,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-05 20:50:41,804 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:50:41,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 76 transitions, 535 flow. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:41,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:50:41,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:50:41,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:50:44,843 INFO L130 PetriNetUnfolder]: 33421/40853 cut-off events. [2022-12-05 20:50:44,843 INFO L131 PetriNetUnfolder]: For 170295/170295 co-relation queries the response was YES. [2022-12-05 20:50:44,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204799 conditions, 40853 events. 33421/40853 cut-off events. For 170295/170295 co-relation queries the response was YES. Maximal size of possible extension queue 982. Compared 162582 event pairs, 10579 based on Foata normal form. 836/41689 useless extension candidates. Maximal degree in co-relation 184716. Up to 23061 conditions per place. [2022-12-05 20:50:45,083 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 209 selfloop transitions, 8 changer transitions 0/217 dead transitions. [2022-12-05 20:50:45,083 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 217 transitions, 1913 flow [2022-12-05 20:50:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-05 20:50:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-05 20:50:45,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 112 transitions. [2022-12-05 20:50:45,085 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2022-12-05 20:50:45,085 INFO L175 Difference]: Start difference. First operand has 95 places, 76 transitions, 535 flow. Second operand 5 states and 112 transitions. [2022-12-05 20:50:45,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 217 transitions, 1913 flow [2022-12-05 20:50:45,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 217 transitions, 1835 flow, removed 28 selfloop flow, removed 2 redundant places. [2022-12-05 20:50:45,501 INFO L231 Difference]: Finished difference. Result has 99 places, 79 transitions, 568 flow [2022-12-05 20:50:45,501 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=568, PETRI_PLACES=99, PETRI_TRANSITIONS=79} [2022-12-05 20:50:45,502 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 49 predicate places. [2022-12-05 20:50:45,502 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 79 transitions, 568 flow [2022-12-05 20:50:45,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 0 states have call successors, (0), 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-05 20:50:45,502 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:50:45,502 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:50:45,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-05 20:50:45,502 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:50:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:50:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash 24689761, now seen corresponding path program 1 times [2022-12-05 20:50:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:50:45,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104631170] [2022-12-05 20:50:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:45,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:50:45,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:46,229 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-05 20:50:46,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:50:46,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104631170] [2022-12-05 20:50:46,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104631170] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:50:46,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394095718] [2022-12-05 20:50:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:50:46,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:50:46,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:50:46,231 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-05 20:50:46,248 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-05 20:50:49,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:50:49,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 16 conjunts are in the unsatisfiable core [2022-12-05 20:50:49,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:50:57,475 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-05 20:50:57,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:51:00,810 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-05 20:51:00,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394095718] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:51:00,810 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:51:00,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2022-12-05 20:51:00,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778195762] [2022-12-05 20:51:00,810 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:51:00,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-05 20:51:00,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:51:00,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-05 20:51:00,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=110, Unknown=3, NotChecked=0, Total=156 [2022-12-05 20:51:00,812 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:51:00,812 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 79 transitions, 568 flow. Second operand has 13 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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-05 20:51:00,812 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:51:00,812 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:51:00,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:51:02,874 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-05 20:51:06,484 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-05 20:51:14,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:18,427 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-05 20:51:27,127 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-05 20:51:30,012 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-05 20:51:34,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:36,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-05 20:51:39,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51: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-05 20:51:43,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 20:51:46,367 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-05 20:51:48,423 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-05 20:51:50,460 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-05 20:51:55,684 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-05 20:51:57,701 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-05 20:51:59,740 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-05 20:52:00,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:52:02,986 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-05 20:52:04,989 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-05 20:52:13,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-05 20:52:16,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:52:18,355 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-05 20:52:20,365 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-05 20:52:51,056 WARN L233 SmtUtils]: Spent 17.96s on a formula simplification. DAG size of input: 85 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:52:53,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:52:55,514 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:52:57,079 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-05 20:52:59,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:13,951 WARN L233 SmtUtils]: Spent 8.48s on a formula simplification. DAG size of input: 78 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:53:15,974 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-05 20:53:18,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:30,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:33,017 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-05 20:53:37,071 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-05 20:53:40,697 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-05 20:53:42,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:53:44,830 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-05 20:53:59,649 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-05 20:54:02,441 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-05 20:54:05,500 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-05 20:54:07,598 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-05 20:54:09,626 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-05 20:54:13,058 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-05 20:54:15,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:54:18,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:54:21,977 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-05 20:54:24,851 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-05 20:54:26,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:54:28,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:54:30,796 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-05 20:54:33,576 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-05 20:54:35,593 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-05 20:54:36,847 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-05 20:54:38,899 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-05 20:54:41,102 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-05 20:54:43,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:54:45,443 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-05 20:54:46,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:54:49,632 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:54:52,548 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-05 20:54:55,432 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-05 20:54:57,533 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-05 20:55:05,998 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-05 20:55:07,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:55:09,622 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-05 20:55:13,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:55:15,918 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-05 20:55:18,513 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-05 20:55:21,586 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-05 20:55:26,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-05 20:55:28,989 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-05 20:55:31,848 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-05 20:55:34,709 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-05 20:55:37,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:55:39,443 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-05 20:55:41,706 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-05 20:55:43,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-05 20:55:46,384 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-05 20:55:48,640 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-05 20:55:48,717 INFO L130 PetriNetUnfolder]: 60239/74765 cut-off events. [2022-12-05 20:55:48,717 INFO L131 PetriNetUnfolder]: For 281044/281044 co-relation queries the response was YES. [2022-12-05 20:55:49,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377255 conditions, 74765 events. 60239/74765 cut-off events. For 281044/281044 co-relation queries the response was YES. Maximal size of possible extension queue 1708. Compared 344066 event pairs, 4341 based on Foata normal form. 2/74767 useless extension candidates. Maximal degree in co-relation 346967. Up to 48529 conditions per place. [2022-12-05 20:55:49,301 INFO L137 encePairwiseOnDemand]: 11/37 looper letters, 598 selfloop transitions, 261 changer transitions 7/866 dead transitions. [2022-12-05 20:55:49,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 866 transitions, 6790 flow [2022-12-05 20:55:49,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-05 20:55:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2022-12-05 20:55:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 602 transitions. [2022-12-05 20:55:49,303 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7074030552291422 [2022-12-05 20:55:49,303 INFO L175 Difference]: Start difference. First operand has 99 places, 79 transitions, 568 flow. Second operand 23 states and 602 transitions. [2022-12-05 20:55:49,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 866 transitions, 6790 flow [2022-12-05 20:55:50,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 866 transitions, 6773 flow, removed 6 selfloop flow, removed 1 redundant places. [2022-12-05 20:55:50,388 INFO L231 Difference]: Finished difference. Result has 131 places, 340 transitions, 3623 flow [2022-12-05 20:55:50,388 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=3623, PETRI_PLACES=131, PETRI_TRANSITIONS=340} [2022-12-05 20:55:50,389 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 81 predicate places. [2022-12-05 20:55:50,389 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 340 transitions, 3623 flow [2022-12-05 20:55:50,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 0 states have call successors, (0), 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-05 20:55:50,389 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:55:50,389 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:55:50,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-05 20:55:50,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-05 20:55:50,595 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:55:50,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:55:50,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1940593713, now seen corresponding path program 1 times [2022-12-05 20:55:50,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:55:50,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982052678] [2022-12-05 20:55:50,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:55:50,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:55:50,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:55:51,262 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-05 20:55:51,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:55:51,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982052678] [2022-12-05 20:55:51,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982052678] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:55:51,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725866624] [2022-12-05 20:55:51,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:55:51,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:55:51,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:55:51,266 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-05 20:55:51,268 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-05 20:55:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:55:51,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 20:55:51,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:56:14,281 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-05 20:56:14,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:56:19,068 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-05 20:56:19,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725866624] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:56:19,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:56:19,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-05 20:56:19,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666579644] [2022-12-05 20:56:19,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:56:19,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 20:56:19,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:56:19,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 20:56:19,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=168, Unknown=5, NotChecked=0, Total=240 [2022-12-05 20:56:19,070 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:56:19,070 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 340 transitions, 3623 flow. Second operand has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 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-05 20:56:19,070 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:56:19,070 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:56:19,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:56:29,290 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-05 20:56:44,266 WARN L233 SmtUtils]: Spent 12.82s on a formula simplification. DAG size of input: 70 DAG size of output: 66 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 20:56:45,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:56:48,397 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-05 20:56:50,417 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-05 20:56:56,033 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-05 20:56:58,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-05 20:57:00,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:57:02,314 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-05 20:57:08,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:57:11,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:57:13,423 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-05 20:57:16,455 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-05 20:57:19,189 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-05 20:57:21,197 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-05 20:57:23,509 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-05 20:57:25,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:57:27,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:57:29,782 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-05 20:57:31,799 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-05 20:57:33,900 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-05 20:57:36,161 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-05 20:57:43,817 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-05 20:57:46,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:57:49,699 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-05 20:57:51,707 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-05 20:57:53,723 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-05 20:58:06,465 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-05 20:58:09,048 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-05 20:58:12,695 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:58:16,135 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-05 20:58:22,941 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-05 20:58:26,725 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-05 20:58:29,486 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-05 20:58:32,628 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-05 20:58:34,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-05 20:58:37,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:58:39,524 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-05 20:58:41,817 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-05 20:58:43,894 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-05 20:58:46,030 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-05 20:58:47,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:58:49,630 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-05 20:58:49,783 INFO L130 PetriNetUnfolder]: 72843/90558 cut-off events. [2022-12-05 20:58:49,784 INFO L131 PetriNetUnfolder]: For 595318/595318 co-relation queries the response was YES. [2022-12-05 20:58:50,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 557462 conditions, 90558 events. 72843/90558 cut-off events. For 595318/595318 co-relation queries the response was YES. Maximal size of possible extension queue 2169. Compared 425918 event pairs, 7283 based on Foata normal form. 3/90561 useless extension candidates. Maximal degree in co-relation 516626. Up to 77439 conditions per place. [2022-12-05 20:58:50,900 INFO L137 encePairwiseOnDemand]: 13/37 looper letters, 636 selfloop transitions, 204 changer transitions 8/848 dead transitions. [2022-12-05 20:58:50,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 848 transitions, 9097 flow [2022-12-05 20:58:50,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-12-05 20:58:50,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-12-05 20:58:50,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 384 transitions. [2022-12-05 20:58:50,902 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6104928457869634 [2022-12-05 20:58:50,902 INFO L175 Difference]: Start difference. First operand has 131 places, 340 transitions, 3623 flow. Second operand 17 states and 384 transitions. [2022-12-05 20:58:50,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 848 transitions, 9097 flow [2022-12-05 20:58:56,041 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 848 transitions, 8626 flow, removed 232 selfloop flow, removed 1 redundant places. [2022-12-05 20:58:56,050 INFO L231 Difference]: Finished difference. Result has 157 places, 540 transitions, 5802 flow [2022-12-05 20:58:56,050 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=3152, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5802, PETRI_PLACES=157, PETRI_TRANSITIONS=540} [2022-12-05 20:58:56,051 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 107 predicate places. [2022-12-05 20:58:56,051 INFO L495 AbstractCegarLoop]: Abstraction has has 157 places, 540 transitions, 5802 flow [2022-12-05 20:58:56,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 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-05 20:58:56,051 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 20:58:56,051 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 20:58:56,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-05 20:58:56,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-05 20:58:56,256 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 20:58:56,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 20:58:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1112992689, now seen corresponding path program 2 times [2022-12-05 20:58:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 20:58:56,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911103837] [2022-12-05 20:58:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 20:58:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 20:58:56,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 20:58:56,908 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-05 20:58:56,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 20:58:56,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911103837] [2022-12-05 20:58:56,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911103837] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 20:58:56,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954824963] [2022-12-05 20:58:56,909 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 20:58:56,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 20:58:56,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 20:58:56,910 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-05 20:58:56,913 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-05 20:58:57,126 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 20:58:57,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 20:58:57,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 20:58:57,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 20:59:08,779 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-05 20:59:08,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 20:59:13,627 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-05 20:59:13,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954824963] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 20:59:13,627 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 20:59:13,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-05 20:59:13,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267108271] [2022-12-05 20:59:13,628 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 20:59:13,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 20:59:13,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 20:59:13,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 20:59:13,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=170, Unknown=3, NotChecked=0, Total=240 [2022-12-05 20:59:13,628 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 20:59:13,629 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 540 transitions, 5802 flow. Second operand has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 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-05 20:59:13,629 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 20:59:13,629 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 20:59:13,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 20:59: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-05 20:59:18,752 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-05 20:59:28,446 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-05 20:59:30,555 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-05 20:59:34,358 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-05 20:59:37,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:59:38,902 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-05 20:59:41,867 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-05 20:59:43,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 20:59:45,141 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-05 20:59:47,568 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-05 20:59:48,920 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-05 20:59:51,374 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-05 20:59:53,489 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-05 20:59:58,237 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-05 21:00:00,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 21:00:02,300 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-05 21:00:04,914 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-05 21:00:08,033 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-05 21:00:19,653 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 21:00:21,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 21:00:24,856 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-05 21:00:31,940 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-05 21:00:35,868 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-05 21:00:41,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 21:00:43,789 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-05 21:00:45,887 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-05 21:00:46,171 INFO L130 PetriNetUnfolder]: 83465/103891 cut-off events. [2022-12-05 21:00:46,171 INFO L131 PetriNetUnfolder]: For 934718/934718 co-relation queries the response was YES. [2022-12-05 21:00:47,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 718510 conditions, 103891 events. 83465/103891 cut-off events. For 934718/934718 co-relation queries the response was YES. Maximal size of possible extension queue 2607. Compared 500597 event pairs, 7933 based on Foata normal form. 65/103956 useless extension candidates. Maximal degree in co-relation 703842. Up to 91512 conditions per place. [2022-12-05 21:00:47,791 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 823 selfloop transitions, 178 changer transitions 16/1017 dead transitions. [2022-12-05 21:00:47,792 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 1017 transitions, 12774 flow [2022-12-05 21:00:47,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-05 21:00:47,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-05 21:00:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 361 transitions. [2022-12-05 21:00:47,794 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6097972972972973 [2022-12-05 21:00:47,794 INFO L175 Difference]: Start difference. First operand has 157 places, 540 transitions, 5802 flow. Second operand 16 states and 361 transitions. [2022-12-05 21:00:47,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 1017 transitions, 12774 flow [2022-12-05 21:00:55,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 1017 transitions, 12179 flow, removed 294 selfloop flow, removed 1 redundant places. [2022-12-05 21:00:55,654 INFO L231 Difference]: Finished difference. Result has 181 places, 700 transitions, 7798 flow [2022-12-05 21:00:55,654 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=5219, PETRI_DIFFERENCE_MINUEND_PLACES=156, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=540, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=7798, PETRI_PLACES=181, PETRI_TRANSITIONS=700} [2022-12-05 21:00:55,654 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 131 predicate places. [2022-12-05 21:00:55,655 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 700 transitions, 7798 flow [2022-12-05 21:00:55,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.333333333333333) internal successors, (95), 15 states have internal predecessors, (95), 0 states have call successors, (0), 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-05 21:00:55,655 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:00:55,655 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:00:55,660 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-05 21:00:55,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:00:55,859 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 21:00:55,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:00:55,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1601404620, now seen corresponding path program 1 times [2022-12-05 21:00:55,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:00:55,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480635056] [2022-12-05 21:00:55,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:00:55,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:00:55,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:00:56,470 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-05 21:00:56,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:00:56,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480635056] [2022-12-05 21:00:56,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480635056] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:00:56,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [308234325] [2022-12-05 21:00:56,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:00:56,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:00:56,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:00:56,476 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-05 21:00:56,482 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-05 21:00:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:00:57,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-05 21:00:57,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:01:19,752 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-05 21:01:19,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:01:34,710 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-05 21:01:34,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [308234325] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:01:34,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:01:34,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-05 21:01:34,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519995998] [2022-12-05 21:01:34,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:01:34,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 21:01:34,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:01:34,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 21:01:34,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=168, Unknown=15, NotChecked=0, Total=240 [2022-12-05 21:01:34,711 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 21:01:34,711 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 700 transitions, 7798 flow. Second operand has 16 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 0 states have call successors, (0), 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-05 21:01:34,711 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:01:34,711 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 21:01:34,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-05 21:01:47,502 WARN L233 SmtUtils]: Spent 11.22s on a formula simplification. DAG size of input: 104 DAG size of output: 50 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 21:02:01,687 WARN L233 SmtUtils]: Spent 6.87s on a formula simplification. DAG size of input: 82 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-05 21:02:05,645 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-05 21:02:12,253 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-05 21:02:14,274 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-05 21:02:16,340 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-05 21:02:21,143 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-05 21:02:23,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-05 21:02:37,049 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-05 21:02:39,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 21:02:42,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-05 21:02:47,637 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-05 21:02:52,754 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-05 21:02:55,612 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-05 21:02:58,318 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-05 21:03:19,560 INFO L130 PetriNetUnfolder]: 94279/117391 cut-off events. [2022-12-05 21:03:19,560 INFO L131 PetriNetUnfolder]: For 1202978/1202978 co-relation queries the response was YES. [2022-12-05 21:03:21,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 841999 conditions, 117391 events. 94279/117391 cut-off events. For 1202978/1202978 co-relation queries the response was YES. Maximal size of possible extension queue 2972. Compared 577039 event pairs, 7679 based on Foata normal form. 90/117481 useless extension candidates. Maximal degree in co-relation 837313. Up to 106371 conditions per place. [2022-12-05 21:03:21,855 INFO L137 encePairwiseOnDemand]: 26/37 looper letters, 977 selfloop transitions, 141 changer transitions 7/1125 dead transitions. [2022-12-05 21:03:21,855 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 1125 transitions, 14195 flow [2022-12-05 21:03:21,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-05 21:03:21,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-05 21:03:21,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 335 transitions. [2022-12-05 21:03:21,857 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.6467181467181468 [2022-12-05 21:03:21,857 INFO L175 Difference]: Start difference. First operand has 181 places, 700 transitions, 7798 flow. Second operand 14 states and 335 transitions. [2022-12-05 21:03:21,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 1125 transitions, 14195 flow [2022-12-05 21:03:34,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 1125 transitions, 13412 flow, removed 388 selfloop flow, removed 1 redundant places. [2022-12-05 21:03:34,757 INFO L231 Difference]: Finished difference. Result has 201 places, 836 transitions, 9261 flow [2022-12-05 21:03:34,758 INFO L276 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=7015, PETRI_DIFFERENCE_MINUEND_PLACES=180, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=9261, PETRI_PLACES=201, PETRI_TRANSITIONS=836} [2022-12-05 21:03:34,758 INFO L294 CegarLoopForPetriNet]: 50 programPoint places, 151 predicate places. [2022-12-05 21:03:34,758 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 836 transitions, 9261 flow [2022-12-05 21:03:34,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 6.066666666666666) internal successors, (91), 15 states have internal predecessors, (91), 0 states have call successors, (0), 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-05 21:03:34,758 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-05 21:03:34,758 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-05 21:03:34,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-05 21:03:34,964 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,SelfDestructingSolverStorable16 [2022-12-05 21:03:34,965 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-05 21:03:34,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-05 21:03:34,965 INFO L85 PathProgramCache]: Analyzing trace with hash 417637590, now seen corresponding path program 2 times [2022-12-05 21:03:34,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-05 21:03:34,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354618593] [2022-12-05 21:03:34,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-05 21:03:34,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-05 21:03:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-05 21:03:35,541 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-05 21:03:35,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-05 21:03:35,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354618593] [2022-12-05 21:03:35,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354618593] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-05 21:03:35,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185760169] [2022-12-05 21:03:35,541 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-05 21:03:35,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-05 21:03:35,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-05 21:03:35,543 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-05 21:03:35,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-05 21:03:35,762 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-05 21:03:35,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-05 21:03:35,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-05 21:03:35,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-05 21:03:56,007 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-05 21:03:56,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-05 21:04:04,512 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-05 21:04:04,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185760169] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-05 21:04:04,512 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-05 21:04:04,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-05 21:04:04,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839810085] [2022-12-05 21:04:04,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-05 21:04:04,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-05 21:04:04,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-05 21:04:04,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-05 21:04:04,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=168, Unknown=7, NotChecked=0, Total=240 [2022-12-05 21:04:04,513 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-05 21:04:04,514 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 836 transitions, 9261 flow. Second operand has 16 states, 15 states have (on average 6.0) internal successors, (90), 15 states have internal predecessors, (90), 0 states have call successors, (0), 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-05 21:04:04,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-05 21:04:04,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-05 21:04:04,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-05 21:04:04,948 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-05 21:04:04,948 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-05 21:04:05,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-05 21:04:06,151 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-05 21:04:06,158 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-05 21:04:06,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-05 21:04:06,159 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-05 21:04:06,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-12-05 21:04:06,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-05 21:04:06,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-05 21:04:06,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-05 21:04:06,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-05 21:04:06,160 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2022-12-05 21:04:06,161 INFO L458 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 2, 2, 2, 2, 1, 1] [2022-12-05 21:04:06,163 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-05 21:04:06,163 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-05 21:04:06,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.12 09:04:06 BasicIcfg [2022-12-05 21:04:06,165 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-05 21:04:06,165 INFO L158 Benchmark]: Toolchain (without parser) took 837084.05ms. Allocated memory was 209.7MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 186.5MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-05 21:04:06,165 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 186.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-05 21:04:06,165 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.51ms. Allocated memory is still 209.7MB. Free memory was 186.5MB in the beginning and 174.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-05 21:04:06,165 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.66ms. Allocated memory is still 209.7MB. Free memory was 174.4MB in the beginning and 172.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-05 21:04:06,166 INFO L158 Benchmark]: Boogie Preprocessor took 27.21ms. Allocated memory is still 209.7MB. Free memory was 172.8MB in the beginning and 171.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-05 21:04:06,166 INFO L158 Benchmark]: RCFGBuilder took 497.48ms. Allocated memory is still 209.7MB. Free memory was 171.3MB in the beginning and 154.0MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-05 21:04:06,166 INFO L158 Benchmark]: TraceAbstraction took 836283.82ms. Allocated memory was 209.7MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 153.4MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. [2022-12-05 21:04:06,167 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### [2022-12-05 21:04:06,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 209.7MB. Free memory is still 186.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 235.51ms. Allocated memory is still 209.7MB. Free memory was 186.5MB in the beginning and 174.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 34.66ms. Allocated memory is still 209.7MB. Free memory was 174.4MB in the beginning and 172.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 27.21ms. Allocated memory is still 209.7MB. Free memory was 172.8MB in the beginning and 171.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 497.48ms. Allocated memory is still 209.7MB. Free memory was 171.3MB in the beginning and 154.0MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 836283.82ms. Allocated memory was 209.7MB in the beginning and 7.5GB in the end (delta: 7.2GB). Free memory was 153.4MB in the beginning and 4.1GB in the end (delta: -4.0GB). Peak memory consumption was 3.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.9s, 145 PlacesBefore, 50 PlacesAfterwards, 140 TransitionsBefore, 37 TransitionsAfterwards, 2916 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 50 TrivialYvCompositions, 45 ConcurrentYvCompositions, 8 ChoiceCompositions, 103 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1464, independent: 1464, independent conditional: 1464, 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: 1464, independent: 1464, independent conditional: 0, independent unconditional: 1464, 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: 1464, independent: 1464, independent conditional: 0, independent unconditional: 1464, 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: 1464, independent: 1464, independent conditional: 0, independent unconditional: 1464, 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: 1464, independent: 1464, independent conditional: 0, independent unconditional: 1464, 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: 1464, independent: 1464, independent conditional: 0, independent unconditional: 1464, 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: 1464, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1464, unknown conditional: 0, unknown unconditional: 1464] , Statistics on independence cache: Total cache size (in pairs): 2388, Positive cache size: 2388, Positive conditional cache size: 0, Positive unconditional cache size: 2388, 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: 114]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 102]: 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: 103]: 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: 104]: 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: 100]: 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: 105]: 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: 101]: 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 13 procedures, 185 locations, 7 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: 836.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 693.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.2s, HoareTripleCheckerStatistics: 125 mSolverCounterUnknown, 2269 SdHoareTripleChecker+Valid, 429.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2269 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 426.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7759 IncrementalHoareTripleChecker+Invalid, 8074 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 189 mSolverCounterUnsat, 0 mSDtfsCounter, 7759 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 678 GetRequests, 516 SyntacticMatches, 15 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 610 ImplicationChecksByTransitivity, 276.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9261occurred in iteration=17, InterpolantAutomatonStates: 133, 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.2s SsaConstructionTime, 5.3s SatisfiabilityAnalysisTime, 128.1s InterpolantComputationTime, 873 NumberOfCodeBlocks, 873 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1130 ConstructedInterpolants, 0 QuantifiedInterpolants, 42008 SizeOfPredicates, 57 NumberOfNonLiveVariables, 2877 ConjunctsInSsa, 130 ConjunctsInUnsatCore, 36 InterpolantComputations, 9 PerfectInterpolantSequences, 8/50 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