/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 --traceabstraction.use.on-demand.petri.net.difference true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 19:05:43,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 19:05:43,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 19:05:43,629 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 19:05:43,630 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 19:05:43,630 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 19:05:43,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 19:05:43,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 19:05:43,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 19:05:43,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 19:05:43,646 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 19:05:43,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 19:05:43,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 19:05:43,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 19:05:43,652 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 19:05:43,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 19:05:43,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 19:05:43,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 19:05:43,655 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 19:05:43,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 19:05:43,657 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 19:05:43,658 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 19:05:43,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 19:05:43,659 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 19:05:43,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 19:05:43,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 19:05:43,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 19:05:43,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 19:05:43,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 19:05:43,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 19:05:43,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 19:05:43,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 19:05:43,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 19:05:43,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 19:05:43,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 19:05:43,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 19:05:43,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 19:05:43,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 19:05:43,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 19:05:43,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 19:05:43,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 19:05:43,673 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-SemanticLbe.epf [2022-12-12 19:05:43,699 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 19:05:43,699 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 19:05:43,700 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 19:05:43,700 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 19:05:43,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 19:05:43,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 19:05:43,701 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 19:05:43,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 19:05:43,701 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 19:05:43,702 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 19:05:43,702 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 19:05:43,702 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 19:05:43,702 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 19:05:43,702 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 19:05:43,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 19:05:43,703 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 19:05:43,703 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 19:05:43,703 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 19:05:43,703 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 19:05:43,703 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 19:05:43,703 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 19:05:43,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 19:05:43,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 19:05:43,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 19:05:43,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 19:05:43,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 19:05:43,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 19:05:43,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 19:05:43,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 19:05:43,704 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 19:05:43,704 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-12 19:05:43,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 19:05:43,955 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 19:05:43,957 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 19:05:43,957 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 19:05:43,958 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 19:05:43,959 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2022-12-12 19:05:44,991 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 19:05:45,154 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 19:05:45,155 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp3x3-opt.wvr.c [2022-12-12 19:05:45,171 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e480bb0f/04ed2f3abaf7436690e9332ab27bf1bc/FLAG9be084858 [2022-12-12 19:05:45,188 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e480bb0f/04ed2f3abaf7436690e9332ab27bf1bc [2022-12-12 19:05:45,190 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 19:05:45,190 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 19:05:45,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 19:05:45,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 19:05:45,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 19:05:45,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@375c2d35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45, skipping insertion in model container [2022-12-12 19:05:45,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 19:05:45,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 19:05:45,334 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-opt.wvr.c[2826,2839] [2022-12-12 19:05:45,337 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 19:05:45,347 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 19:05:45,370 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-opt.wvr.c[2826,2839] [2022-12-12 19:05:45,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 19:05:45,382 INFO L208 MainTranslator]: Completed translation [2022-12-12 19:05:45,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45 WrapperNode [2022-12-12 19:05:45,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 19:05:45,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 19:05:45,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 19:05:45,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 19:05:45,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,427 INFO L138 Inliner]: procedures = 25, calls = 44, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 125 [2022-12-12 19:05:45,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 19:05:45,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 19:05:45,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 19:05:45,428 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 19:05:45,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,445 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,452 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,456 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 19:05:45,471 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 19:05:45,471 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 19:05:45,472 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 19:05:45,472 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (1/1) ... [2022-12-12 19:05:45,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 19:05:45,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:05:45,507 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 19:05:45,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 19:05:45,565 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 19:05:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 19:05:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 19:05:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 19:05:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 19:05:45,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 19:05:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 19:05:45,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 19:05:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 19:05:45,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 19:05:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-12 19:05:45,566 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-12 19:05:45,566 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 19:05:45,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2022-12-12 19:05:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2022-12-12 19:05:45,567 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2022-12-12 19:05:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2022-12-12 19:05:45,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 19:05:45,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 19:05:45,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 19:05:45,568 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 19:05:45,680 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 19:05:45,681 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 19:05:45,878 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 19:05:45,884 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 19:05:45,884 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-12 19:05:45,885 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 07:05:45 BoogieIcfgContainer [2022-12-12 19:05:45,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 19:05:45,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 19:05:45,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 19:05:45,889 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 19:05:45,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 07:05:45" (1/3) ... [2022-12-12 19:05:45,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6391ea2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 07:05:45, skipping insertion in model container [2022-12-12 19:05:45,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 07:05:45" (2/3) ... [2022-12-12 19:05:45,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6391ea2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 07:05:45, skipping insertion in model container [2022-12-12 19:05:45,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 07:05:45" (3/3) ... [2022-12-12 19:05:45,891 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp3x3-opt.wvr.c [2022-12-12 19:05:45,903 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 19:05:45,903 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 19:05:45,903 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 19:05:46,032 INFO L144 ThreadInstanceAdder]: Constructed 6 joinOtherThreadTransitions. [2022-12-12 19:05:46,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 167 places, 162 transitions, 372 flow [2022-12-12 19:05:46,120 INFO L130 PetriNetUnfolder]: 14/156 cut-off events. [2022-12-12 19:05:46,120 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-12 19:05:46,124 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 65 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-12 19:05:46,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 162 transitions, 372 flow [2022-12-12 19:05:46,128 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 145 places, 140 transitions, 316 flow [2022-12-12 19:05:46,129 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 19:05:46,142 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-12 19:05:46,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 140 transitions, 316 flow [2022-12-12 19:05:46,174 INFO L130 PetriNetUnfolder]: 14/140 cut-off events. [2022-12-12 19:05:46,174 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-12 19:05:46,176 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 64 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-12 19:05:46,179 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 145 places, 140 transitions, 316 flow [2022-12-12 19:05:46,179 INFO L226 LiptonReduction]: Number of co-enabled transitions 2916 [2022-12-12 19:05:50,509 INFO L241 LiptonReduction]: Total number of compositions: 103 [2022-12-12 19:05:50,532 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 19:05:50,537 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;@6ccc38b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 19:05:50,538 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-12 19:05:50,545 INFO L130 PetriNetUnfolder]: 6/36 cut-off events. [2022-12-12 19:05:50,545 INFO L131 PetriNetUnfolder]: For 6/6 co-relation queries the response was YES. [2022-12-12 19:05:50,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:05:50,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:05:50,546 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-12 19:05:50,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:05:50,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1155012049, now seen corresponding path program 1 times [2022-12-12 19:05:50,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:05:50,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651119950] [2022-12-12 19:05:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:50,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:05:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:51,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:05:51,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:05:51,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651119950] [2022-12-12 19:05:51,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651119950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:05:51,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:05:51,165 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 19:05:51,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951191641] [2022-12-12 19:05:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:05:51,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 19:05:51,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:05:51,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 19:05:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 19:05:51,191 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:05:51,192 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-12 19:05:51,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:05:51,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:05:51,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:05:51,503 INFO L130 PetriNetUnfolder]: 3473/4229 cut-off events. [2022-12-12 19:05:51,503 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2022-12-12 19:05:51,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8842 conditions, 4229 events. 3473/4229 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 11640 event pairs, 837 based on Foata normal form. 1/2430 useless extension candidates. Maximal degree in co-relation 6136. Up to 2397 conditions per place. [2022-12-12 19:05:51,571 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 59 selfloop transitions, 3 changer transitions 9/71 dead transitions. [2022-12-12 19:05:51,571 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 71 transitions, 353 flow [2022-12-12 19:05:51,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 19:05:51,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 19:05:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-12-12 19:05:51,580 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2022-12-12 19:05:51,584 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 2 predicate places. [2022-12-12 19:05:51,584 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 71 transitions, 353 flow [2022-12-12 19:05:51,594 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 62 transitions, 302 flow [2022-12-12 19:05:51,595 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 62 transitions, 302 flow [2022-12-12 19:05:51,596 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-12 19:05:51,596 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:05:51,596 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:05:51,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 19:05:51,596 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-12 19:05:51,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:05:51,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1979655612, now seen corresponding path program 1 times [2022-12-12 19:05:51,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:05:51,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308794064] [2022-12-12 19:05:51,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:51,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:05:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:51,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:05:51,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:05:51,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308794064] [2022-12-12 19:05:51,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308794064] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:05:51,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:05:51,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:05:51,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063524214] [2022-12-12 19:05:51,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:05:51,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:05:51,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:05:51,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:05:51,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:05:51,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:05:51,822 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 62 transitions, 302 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-12 19:05:51,822 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:05:51,822 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:05:51,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:05:52,204 INFO L130 PetriNetUnfolder]: 4641/5640 cut-off events. [2022-12-12 19:05:52,204 INFO L131 PetriNetUnfolder]: For 421/421 co-relation queries the response was YES. [2022-12-12 19:05:52,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17418 conditions, 5640 events. 4641/5640 cut-off events. For 421/421 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17310 event pairs, 209 based on Foata normal form. 0/3302 useless extension candidates. Maximal degree in co-relation 16888. Up to 4585 conditions per place. [2022-12-12 19:05:52,230 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 89 selfloop transitions, 13 changer transitions 2/104 dead transitions. [2022-12-12 19:05:52,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 104 transitions, 705 flow [2022-12-12 19:05:52,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 19:05:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 19:05:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 85 transitions. [2022-12-12 19:05:52,233 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5743243243243243 [2022-12-12 19:05:52,234 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 5 predicate places. [2022-12-12 19:05:52,234 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 104 transitions, 705 flow [2022-12-12 19:05:52,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 102 transitions, 693 flow [2022-12-12 19:05:52,257 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 102 transitions, 693 flow [2022-12-12 19:05:52,257 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-12 19:05:52,257 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:05:52,257 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:05:52,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 19:05:52,257 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-12 19:05:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:05:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash 246741914, now seen corresponding path program 1 times [2022-12-12 19:05:52,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:05:52,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767749375] [2022-12-12 19:05:52,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:52,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:05:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:52,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 19:05:52,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:05:52,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767749375] [2022-12-12 19:05:52,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767749375] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:05:52,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979936606] [2022-12-12 19:05:52,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:52,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:05:52,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:05:52,455 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:05:52,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 19:05:52,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:52,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 19:05:52,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:05:52,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:05:52,728 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 19:05:52,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979936606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:05:52,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 19:05:52,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-12 19:05:52,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154479842] [2022-12-12 19:05:52,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:05:52,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 19:05:52,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:05:52,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 19:05:52,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 19:05:52,730 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:05:52,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 102 transitions, 693 flow. Second operand has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 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-12 19:05:52,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:05:52,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:05:52,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:05:53,082 INFO L130 PetriNetUnfolder]: 5893/7163 cut-off events. [2022-12-12 19:05:53,082 INFO L131 PetriNetUnfolder]: For 544/544 co-relation queries the response was YES. [2022-12-12 19:05:53,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29280 conditions, 7163 events. 5893/7163 cut-off events. For 544/544 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 22768 event pairs, 187 based on Foata normal form. 1/4098 useless extension candidates. Maximal degree in co-relation 28212. Up to 6504 conditions per place. [2022-12-12 19:05:53,112 INFO L137 encePairwiseOnDemand]: 31/37 looper letters, 118 selfloop transitions, 13 changer transitions 1/132 dead transitions. [2022-12-12 19:05:53,113 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 132 transitions, 1164 flow [2022-12-12 19:05:53,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 19:05:53,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 19:05:53,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-12 19:05:53,114 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2022-12-12 19:05:53,114 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 7 predicate places. [2022-12-12 19:05:53,114 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 132 transitions, 1164 flow [2022-12-12 19:05:53,136 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 57 places, 131 transitions, 1153 flow [2022-12-12 19:05:53,174 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 131 transitions, 1153 flow [2022-12-12 19:05:53,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.0) internal successors, (32), 2 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-12 19:05:53,175 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:05:53,175 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:05:53,182 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-12 19:05:53,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:05:53,375 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-12 19:05:53,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:05:53,376 INFO L85 PathProgramCache]: Analyzing trace with hash -45236880, now seen corresponding path program 1 times [2022-12-12 19:05:53,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:05:53,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159472504] [2022-12-12 19:05:53,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:53,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:05:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:53,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:05:53,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:05:53,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159472504] [2022-12-12 19:05:53,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159472504] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:05:53,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:05:53,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:05:53,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695918152] [2022-12-12 19:05:53,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:05:53,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:05:53,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:05:53,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:05:53,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:05:53,685 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:05:53,686 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 131 transitions, 1153 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:05:53,686 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:05:53,686 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:05:53,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:05:54,262 INFO L130 PetriNetUnfolder]: 5829/7098 cut-off events. [2022-12-12 19:05:54,262 INFO L131 PetriNetUnfolder]: For 590/590 co-relation queries the response was YES. [2022-12-12 19:05:54,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36118 conditions, 7098 events. 5829/7098 cut-off events. For 590/590 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 22140 event pairs, 483 based on Foata normal form. 0/4096 useless extension candidates. Maximal degree in co-relation 34804. Up to 6439 conditions per place. [2022-12-12 19:05:54,327 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 134 selfloop transitions, 21 changer transitions 0/155 dead transitions. [2022-12-12 19:05:54,328 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 155 transitions, 1664 flow [2022-12-12 19:05:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 19:05:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 19:05:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-12 19:05:54,332 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2022-12-12 19:05:54,333 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 10 predicate places. [2022-12-12 19:05:54,333 INFO L82 GeneralOperation]: Start removeDead. Operand has 60 places, 155 transitions, 1664 flow [2022-12-12 19:05:54,353 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 60 places, 155 transitions, 1664 flow [2022-12-12 19:05:54,353 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 155 transitions, 1664 flow [2022-12-12 19:05:54,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:05:54,353 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:05:54,353 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:05:54,353 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 19:05:54,353 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-12 19:05:54,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:05:54,354 INFO L85 PathProgramCache]: Analyzing trace with hash 200318112, now seen corresponding path program 1 times [2022-12-12 19:05:54,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:05:54,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768160923] [2022-12-12 19:05:54,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:54,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:05:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:54,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:05:54,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:05:54,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768160923] [2022-12-12 19:05:54,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768160923] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:05:54,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71463379] [2022-12-12 19:05:54,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:54,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:05:54,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:05:54,610 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:05:54,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 19:05:54,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:54,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 19:05:54,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:05:54,786 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:05:54,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 19:05:54,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71463379] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:05:54,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 19:05:54,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-12 19:05:54,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217013492] [2022-12-12 19:05:54,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:05:54,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 19:05:54,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:05:54,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 19:05:54,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 19:05:54,787 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:05:54,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 155 transitions, 1664 flow. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:05:54,788 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:05:54,788 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:05:54,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:05:55,443 INFO L130 PetriNetUnfolder]: 8713/10555 cut-off events. [2022-12-12 19:05:55,443 INFO L131 PetriNetUnfolder]: For 878/878 co-relation queries the response was YES. [2022-12-12 19:05:55,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64182 conditions, 10555 events. 8713/10555 cut-off events. For 878/878 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 34517 event pairs, 629 based on Foata normal form. 1/6048 useless extension candidates. Maximal degree in co-relation 62020. Up to 9896 conditions per place. [2022-12-12 19:05:55,484 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 174 selfloop transitions, 15 changer transitions 9/198 dead transitions. [2022-12-12 19:05:55,484 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 198 transitions, 2517 flow [2022-12-12 19:05:55,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 19:05:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 19:05:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-12-12 19:05:55,485 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2022-12-12 19:05:55,487 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 12 predicate places. [2022-12-12 19:05:55,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 198 transitions, 2517 flow [2022-12-12 19:05:55,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 62 places, 189 transitions, 2394 flow [2022-12-12 19:05:55,566 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 189 transitions, 2394 flow [2022-12-12 19:05:55,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:05:55,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:05:55,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:05:55,586 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-12 19:05:55,771 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-12 19:05:55,772 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-12 19:05:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:05:55,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1572524144, now seen corresponding path program 1 times [2022-12-12 19:05:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:05:55,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258184063] [2022-12-12 19:05:55,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:05:55,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:55,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:05:55,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:05:55,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258184063] [2022-12-12 19:05:55,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258184063] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:05:55,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:05:55,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:05:55,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891827035] [2022-12-12 19:05:55,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:05:55,953 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:05:55,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:05:55,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:05:55,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:05:55,954 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:05:55,954 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 189 transitions, 2394 flow. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:05:55,954 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:05:55,954 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:05:55,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:05:56,635 INFO L130 PetriNetUnfolder]: 8573/10390 cut-off events. [2022-12-12 19:05:56,635 INFO L131 PetriNetUnfolder]: For 883/883 co-relation queries the response was YES. [2022-12-12 19:05:56,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73570 conditions, 10390 events. 8573/10390 cut-off events. For 883/883 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 34078 event pairs, 1088 based on Foata normal form. 0/6002 useless extension candidates. Maximal degree in co-relation 71528. Up to 9731 conditions per place. [2022-12-12 19:05:56,680 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 189 selfloop transitions, 31 changer transitions 21/241 dead transitions. [2022-12-12 19:05:56,680 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 241 transitions, 3530 flow [2022-12-12 19:05:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 19:05:56,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 19:05:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 83 transitions. [2022-12-12 19:05:56,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2022-12-12 19:05:56,684 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 15 predicate places. [2022-12-12 19:05:56,684 INFO L82 GeneralOperation]: Start removeDead. Operand has 65 places, 241 transitions, 3530 flow [2022-12-12 19:05:56,722 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 65 places, 220 transitions, 3230 flow [2022-12-12 19:05:56,722 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 220 transitions, 3230 flow [2022-12-12 19:05:56,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:05:56,722 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:05:56,723 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:05:56,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 19:05:56,725 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-12 19:05:56,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:05:56,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1467155102, now seen corresponding path program 1 times [2022-12-12 19:05:56,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:05:56,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854320134] [2022-12-12 19:05:56,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:05:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:56,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 19:05:56,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:05:56,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854320134] [2022-12-12 19:05:56,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854320134] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:05:56,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1278376666] [2022-12-12 19:05:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:56,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:05:56,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:05:56,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:05:56,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 19:05:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:57,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 19:05:57,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:05:57,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:05:57,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 19:05:57,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1278376666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:05:57,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 19:05:57,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [3] total 4 [2022-12-12 19:05:57,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005026627] [2022-12-12 19:05:57,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:05:57,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 19:05:57,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:05:57,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 19:05:57,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 19:05:57,122 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:05:57,122 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 220 transitions, 3230 flow. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:05:57,122 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:05:57,122 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:05:57,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:05:58,039 INFO L130 PetriNetUnfolder]: 11133/13429 cut-off events. [2022-12-12 19:05:58,039 INFO L131 PetriNetUnfolder]: For 1175/1175 co-relation queries the response was YES. [2022-12-12 19:05:58,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108460 conditions, 13429 events. 11133/13429 cut-off events. For 1175/1175 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 45063 event pairs, 1138 based on Foata normal form. 1/7694 useless extension candidates. Maximal degree in co-relation 105508. Up to 13138 conditions per place. [2022-12-12 19:05:58,088 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 241 selfloop transitions, 15 changer transitions 7/263 dead transitions. [2022-12-12 19:05:58,088 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 263 transitions, 4385 flow [2022-12-12 19:05:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 19:05:58,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 19:05:58,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2022-12-12 19:05:58,090 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5765765765765766 [2022-12-12 19:05:58,091 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 17 predicate places. [2022-12-12 19:05:58,091 INFO L82 GeneralOperation]: Start removeDead. Operand has 67 places, 263 transitions, 4385 flow [2022-12-12 19:05:58,130 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 67 places, 256 transitions, 4270 flow [2022-12-12 19:05:58,131 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 256 transitions, 4270 flow [2022-12-12 19:05:58,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:05:58,131 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:05:58,131 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:05:58,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 19:05:58,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:05:58,336 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-12 19:05:58,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:05:58,337 INFO L85 PathProgramCache]: Analyzing trace with hash -909544242, now seen corresponding path program 1 times [2022-12-12 19:05:58,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:05:58,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701832659] [2022-12-12 19:05:58,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:58,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:05:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:58,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:05:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:05:58,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701832659] [2022-12-12 19:05:58,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701832659] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:05:58,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432896745] [2022-12-12 19:05:58,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:05:58,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:05:58,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:05:58,511 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:05:58,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-12 19:05:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:05:58,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 19:05:58,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:05:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:05:58,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:05:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:05:58,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432896745] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:05:58,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:05:58,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-12 19:05:58,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501045907] [2022-12-12 19:05:58,739 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:05:58,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 19:05:58,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:05:58,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 19:05:58,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 19:05:58,740 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:05:58,741 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 256 transitions, 4270 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:05:58,741 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:05:58,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:05:58,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:00,320 INFO L130 PetriNetUnfolder]: 14692/17756 cut-off events. [2022-12-12 19:06:00,321 INFO L131 PetriNetUnfolder]: For 1602/1602 co-relation queries the response was YES. [2022-12-12 19:06:00,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160998 conditions, 17756 events. 14692/17756 cut-off events. For 1602/1602 co-relation queries the response was YES. Maximal size of possible extension queue 473. Compared 62223 event pairs, 1126 based on Foata normal form. 1/10329 useless extension candidates. Maximal degree in co-relation 157450. Up to 17504 conditions per place. [2022-12-12 19:06:00,384 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 341 selfloop transitions, 43 changer transitions 7/391 dead transitions. [2022-12-12 19:06:00,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 391 transitions, 7284 flow [2022-12-12 19:06:00,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:06:00,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:06:00,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 133 transitions. [2022-12-12 19:06:00,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5990990990990991 [2022-12-12 19:06:00,385 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 22 predicate places. [2022-12-12 19:06:00,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 72 places, 391 transitions, 7284 flow [2022-12-12 19:06:00,434 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 384 transitions, 7155 flow [2022-12-12 19:06:00,434 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 384 transitions, 7155 flow [2022-12-12 19:06:00,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:00,434 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:00,435 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:00,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-12 19:06:00,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:00,640 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-12 19:06:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash -512424776, now seen corresponding path program 1 times [2022-12-12 19:06:00,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:00,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916760314] [2022-12-12 19:06:00,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:00,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:06:00,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:00,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916760314] [2022-12-12 19:06:00,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916760314] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:06:00,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373758638] [2022-12-12 19:06:00,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:00,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:00,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:06:00,812 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:06:00,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-12 19:06:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:00,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 19:06:00,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:06:01,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:06:01,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:06:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:06:01,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1373758638] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:06:01,075 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:06:01,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-12 19:06:01,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417231131] [2022-12-12 19:06:01,075 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:06:01,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 19:06:01,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:06:01,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 19:06:01,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 19:06:01,076 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:06:01,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 384 transitions, 7155 flow. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:01,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:06:01,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:06:01,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:02,602 INFO L130 PetriNetUnfolder]: 15163/18311 cut-off events. [2022-12-12 19:06:02,602 INFO L131 PetriNetUnfolder]: For 1767/1767 co-relation queries the response was YES. [2022-12-12 19:06:02,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184320 conditions, 18311 events. 15163/18311 cut-off events. For 1767/1767 co-relation queries the response was YES. Maximal size of possible extension queue 448. Compared 63416 event pairs, 506 based on Foata normal form. 1/11020 useless extension candidates. Maximal degree in co-relation 180370. Up to 18086 conditions per place. [2022-12-12 19:06:02,708 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 442 selfloop transitions, 35 changer transitions 36/513 dead transitions. [2022-12-12 19:06:02,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 513 transitions, 10566 flow [2022-12-12 19:06:02,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:06:02,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:06:02,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2022-12-12 19:06:02,710 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5900900900900901 [2022-12-12 19:06:02,710 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 27 predicate places. [2022-12-12 19:06:02,710 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 513 transitions, 10566 flow [2022-12-12 19:06:02,853 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 76 places, 477 transitions, 9822 flow [2022-12-12 19:06:02,854 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 477 transitions, 9822 flow [2022-12-12 19:06:02,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 5 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:02,854 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:02,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:02,859 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-12 19:06:03,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:03,056 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-12 19:06:03,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:03,057 INFO L85 PathProgramCache]: Analyzing trace with hash -2008057014, now seen corresponding path program 1 times [2022-12-12 19:06:03,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:03,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426046353] [2022-12-12 19:06:03,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:03,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:03,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:06:03,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:03,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426046353] [2022-12-12 19:06:03,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426046353] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:06:03,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263879043] [2022-12-12 19:06:03,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:03,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:03,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:06:03,270 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:06:03,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-12 19:06:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:03,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 19:06:03,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:06:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:06:03,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 19:06:03,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263879043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:06:03,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 19:06:03,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-12 19:06:03,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545336443] [2022-12-12 19:06:03,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:06:03,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:06:03,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:06:03,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:06:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 19:06:03,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:06:03,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 477 transitions, 9822 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:03,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:06:03,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:06:03,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:04,657 INFO L130 PetriNetUnfolder]: 11794/14307 cut-off events. [2022-12-12 19:06:04,657 INFO L131 PetriNetUnfolder]: For 1446/1446 co-relation queries the response was YES. [2022-12-12 19:06:04,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158366 conditions, 14307 events. 11794/14307 cut-off events. For 1446/1446 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 48269 event pairs, 34 based on Foata normal form. 0/9093 useless extension candidates. Maximal degree in co-relation 154336. Up to 14137 conditions per place. [2022-12-12 19:06:04,717 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 552 selfloop transitions, 39 changer transitions 213/804 dead transitions. [2022-12-12 19:06:04,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 804 transitions, 18138 flow [2022-12-12 19:06:04,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:06:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:06:04,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-12 19:06:04,718 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.572972972972973 [2022-12-12 19:06:04,719 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 30 predicate places. [2022-12-12 19:06:04,719 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 804 transitions, 18138 flow [2022-12-12 19:06:04,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 591 transitions, 13341 flow [2022-12-12 19:06:04,773 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 591 transitions, 13341 flow [2022-12-12 19:06:04,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:04,773 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:04,773 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:04,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-12 19:06:04,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:04,978 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-12 19:06:04,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:04,979 INFO L85 PathProgramCache]: Analyzing trace with hash 144226408, now seen corresponding path program 1 times [2022-12-12 19:06:04,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:04,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837512238] [2022-12-12 19:06:04,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:04,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:05,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:05,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:06:05,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:05,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837512238] [2022-12-12 19:06:05,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837512238] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:06:05,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554648323] [2022-12-12 19:06:05,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:05,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:05,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:06:05,183 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:06:05,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-12 19:06:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:05,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 19:06:05,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:06:05,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:06:05,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:06:05,442 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:06:05,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554648323] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:06:05,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:06:05,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-12 19:06:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840347644] [2022-12-12 19:06:05,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:06:05,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 19:06:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:06:05,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 19:06:05,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 19:06:05,445 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:06:05,445 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 591 transitions, 13341 flow. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:05,445 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:06:05,445 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:06:05,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:06,982 INFO L130 PetriNetUnfolder]: 11014/13241 cut-off events. [2022-12-12 19:06:06,982 INFO L131 PetriNetUnfolder]: For 1285/1285 co-relation queries the response was YES. [2022-12-12 19:06:06,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159778 conditions, 13241 events. 11014/13241 cut-off events. For 1285/1285 co-relation queries the response was YES. Maximal size of possible extension queue 310. Compared 42488 event pairs, 20 based on Foata normal form. 0/8709 useless extension candidates. Maximal degree in co-relation 156029. Up to 13185 conditions per place. [2022-12-12 19:06:07,047 INFO L137 encePairwiseOnDemand]: 28/37 looper letters, 866 selfloop transitions, 69 changer transitions 0/935 dead transitions. [2022-12-12 19:06:07,047 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 935 transitions, 22959 flow [2022-12-12 19:06:07,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:06:07,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:06:07,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 123 transitions. [2022-12-12 19:06:07,048 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5540540540540541 [2022-12-12 19:06:07,049 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 33 predicate places. [2022-12-12 19:06:07,049 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 935 transitions, 22959 flow [2022-12-12 19:06:07,248 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 935 transitions, 22959 flow [2022-12-12 19:06:07,249 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 935 transitions, 22959 flow [2022-12-12 19:06:07,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:07,249 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:07,249 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:07,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-12 19:06:07,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:07,454 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-12 19:06:07,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:07,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1833170150, now seen corresponding path program 2 times [2022-12-12 19:06:07,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:07,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266182364] [2022-12-12 19:06:07,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:07,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:06:07,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:07,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266182364] [2022-12-12 19:06:07,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266182364] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:06:07,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:06:07,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:06:07,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881960470] [2022-12-12 19:06:07,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:06:07,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:06:07,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:06:07,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:06:07,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:06:07,592 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:06:07,592 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 935 transitions, 22959 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:07,592 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:06:07,592 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:06:07,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:09,653 INFO L130 PetriNetUnfolder]: 14070/16893 cut-off events. [2022-12-12 19:06:09,654 INFO L131 PetriNetUnfolder]: For 1579/1579 co-relation queries the response was YES. [2022-12-12 19:06:09,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220714 conditions, 16893 events. 14070/16893 cut-off events. For 1579/1579 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 56210 event pairs, 12 based on Foata normal form. 0/11231 useless extension candidates. Maximal degree in co-relation 216660. Up to 16837 conditions per place. [2022-12-12 19:06:09,769 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 1228 selfloop transitions, 35 changer transitions 0/1263 dead transitions. [2022-12-12 19:06:09,769 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 1263 transitions, 33513 flow [2022-12-12 19:06:09,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 19:06:09,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 19:06:09,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-12 19:06:09,770 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2022-12-12 19:06:09,770 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 36 predicate places. [2022-12-12 19:06:09,771 INFO L82 GeneralOperation]: Start removeDead. Operand has 86 places, 1263 transitions, 33513 flow [2022-12-12 19:06:09,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 1263 transitions, 33513 flow [2022-12-12 19:06:09,925 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 1263 transitions, 33513 flow [2022-12-12 19:06:09,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:09,925 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:09,925 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:09,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-12 19:06:09,925 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-12 19:06:09,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:09,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1514523780, now seen corresponding path program 3 times [2022-12-12 19:06:09,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:09,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430058176] [2022-12-12 19:06:09,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:09,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:09,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:10,066 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 19:06:10,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430058176] [2022-12-12 19:06:10,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430058176] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:06:10,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [659779939] [2022-12-12 19:06:10,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:06:10,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:10,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:06:10,068 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:06:10,105 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-12 19:06:10,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 19:06:10,210 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:06:10,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 19:06:10,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:06:10,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:06:10,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 19:06:10,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [659779939] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:06:10,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 19:06:10,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-12 19:06:10,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872606357] [2022-12-12 19:06:10,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:06:10,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:06:10,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:06:10,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:06:10,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 19:06:10,276 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:06:10,276 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 1263 transitions, 33513 flow. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:10,276 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:06:10,276 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:06:10,276 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:13,162 INFO L130 PetriNetUnfolder]: 16854/20217 cut-off events. [2022-12-12 19:06:13,162 INFO L131 PetriNetUnfolder]: For 1929/1929 co-relation queries the response was YES. [2022-12-12 19:06:13,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284326 conditions, 20217 events. 16854/20217 cut-off events. For 1929/1929 co-relation queries the response was YES. Maximal size of possible extension queue 476. Compared 68593 event pairs, 12 based on Foata normal form. 0/13505 useless extension candidates. Maximal degree in co-relation 279967. Up to 20161 conditions per place. [2022-12-12 19:06:13,372 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 1488 selfloop transitions, 73 changer transitions 0/1561 dead transitions. [2022-12-12 19:06:13,373 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 1561 transitions, 44521 flow [2022-12-12 19:06:13,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 19:06:13,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 19:06:13,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-12 19:06:13,374 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2022-12-12 19:06:13,374 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 39 predicate places. [2022-12-12 19:06:13,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 89 places, 1561 transitions, 44521 flow [2022-12-12 19:06:13,484 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 1561 transitions, 44521 flow [2022-12-12 19:06:13,484 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 1561 transitions, 44521 flow [2022-12-12 19:06:13,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:13,485 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:13,485 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:13,491 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-12 19:06:13,689 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,SelfDestructingSolverStorable12 [2022-12-12 19:06:13,690 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-12 19:06:13,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:13,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1749869706, now seen corresponding path program 1 times [2022-12-12 19:06:13,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:13,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344365978] [2022-12-12 19:06:13,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:13,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:06:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:13,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344365978] [2022-12-12 19:06:13,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344365978] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:06:13,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:06:13,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:06:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349129675] [2022-12-12 19:06:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:06:13,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:06:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:06:13,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:06:13,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:06:13,824 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:06:13,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 1561 transitions, 44521 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:13,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:06:13,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:06:13,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:17,126 INFO L130 PetriNetUnfolder]: 16390/19753 cut-off events. [2022-12-12 19:06:17,126 INFO L131 PetriNetUnfolder]: For 1929/1929 co-relation queries the response was YES. [2022-12-12 19:06:17,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 297584 conditions, 19753 events. 16390/19753 cut-off events. For 1929/1929 co-relation queries the response was YES. Maximal size of possible extension queue 464. Compared 67801 event pairs, 0 based on Foata normal form. 0/13505 useless extension candidates. Maximal degree in co-relation 292980. Up to 19697 conditions per place. [2022-12-12 19:06:17,384 INFO L137 encePairwiseOnDemand]: 32/37 looper letters, 2137 selfloop transitions, 262 changer transitions 260/2659 dead transitions. [2022-12-12 19:06:17,384 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 2659 transitions, 80961 flow [2022-12-12 19:06:17,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 19:06:17,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 19:06:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-12-12 19:06:17,385 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.572972972972973 [2022-12-12 19:06:17,385 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 43 predicate places. [2022-12-12 19:06:17,385 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 2659 transitions, 80961 flow [2022-12-12 19:06:17,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 2399 transitions, 73002 flow [2022-12-12 19:06:17,518 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 2399 transitions, 73002 flow [2022-12-12 19:06:17,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:17,518 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:17,518 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:17,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-12 19:06:17,518 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-12 19:06:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:17,519 INFO L85 PathProgramCache]: Analyzing trace with hash 724117008, now seen corresponding path program 1 times [2022-12-12 19:06:17,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:17,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911556595] [2022-12-12 19:06:17,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:17,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:06:17,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:17,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911556595] [2022-12-12 19:06:17,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911556595] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:06:17,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440517961] [2022-12-12 19:06:17,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:17,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:17,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:06:17,649 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-12 19:06:17,651 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-12 19:06:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:17,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 19:06:17,766 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:06:17,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:06:17,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:06:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:06:17,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440517961] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:06:17,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:06:17,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2022-12-12 19:06:17,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041579439] [2022-12-12 19:06:17,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:06:17,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 19:06:17,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:06:17,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 19:06:17,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 19:06:17,869 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:06:17,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 2399 transitions, 73002 flow. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:17,869 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:06:17,869 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:06:17,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:24,022 INFO L130 PetriNetUnfolder]: 20139/24353 cut-off events. [2022-12-12 19:06:24,023 INFO L131 PetriNetUnfolder]: For 2376/2376 co-relation queries the response was YES. [2022-12-12 19:06:24,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391258 conditions, 24353 events. 20139/24353 cut-off events. For 2376/2376 co-relation queries the response was YES. Maximal size of possible extension queue 513. Compared 86542 event pairs, 0 based on Foata normal form. 1/17094 useless extension candidates. Maximal degree in co-relation 384586. Up to 24322 conditions per place. [2022-12-12 19:06:24,154 INFO L137 encePairwiseOnDemand]: 27/37 looper letters, 2749 selfloop transitions, 271 changer transitions 1522/4542 dead transitions. [2022-12-12 19:06:24,154 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 4542 transitions, 147360 flow [2022-12-12 19:06:24,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 19:06:24,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 19:06:24,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2022-12-12 19:06:24,155 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5720720720720721 [2022-12-12 19:06:24,155 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 48 predicate places. [2022-12-12 19:06:24,155 INFO L82 GeneralOperation]: Start removeDead. Operand has 98 places, 4542 transitions, 147360 flow [2022-12-12 19:06:24,291 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 96 places, 3020 transitions, 97969 flow [2022-12-12 19:06:24,291 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 3020 transitions, 97969 flow [2022-12-12 19:06:24,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:24,291 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:24,291 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:24,297 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-12 19:06:24,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-12 19:06:24,496 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-12 19:06:24,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1899425460, now seen corresponding path program 2 times [2022-12-12 19:06:24,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:24,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491089621] [2022-12-12 19:06:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:24,685 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:06:24,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:24,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491089621] [2022-12-12 19:06:24,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491089621] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:06:24,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 19:06:24,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 19:06:24,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256991589] [2022-12-12 19:06:24,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:06:24,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:06:24,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:06:24,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:06:24,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 19:06:24,686 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:06:24,687 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 3020 transitions, 97969 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:24,687 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:06:24,687 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:06:24,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:30,527 INFO L130 PetriNetUnfolder]: 17128/20537 cut-off events. [2022-12-12 19:06:30,528 INFO L131 PetriNetUnfolder]: For 1646/1646 co-relation queries the response was YES. [2022-12-12 19:06:30,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350420 conditions, 20537 events. 17128/20537 cut-off events. For 1646/1646 co-relation queries the response was YES. Maximal size of possible extension queue 441. Compared 69007 event pairs, 0 based on Foata normal form. 0/14597 useless extension candidates. Maximal degree in co-relation 344347. Up to 20525 conditions per place. [2022-12-12 19:06:30,669 INFO L137 encePairwiseOnDemand]: 29/37 looper letters, 3697 selfloop transitions, 91 changer transitions 0/3788 dead transitions. [2022-12-12 19:06:30,669 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 3788 transitions, 130313 flow [2022-12-12 19:06:30,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 19:06:30,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 19:06:30,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-12-12 19:06:30,670 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5067567567567568 [2022-12-12 19:06:30,670 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 49 predicate places. [2022-12-12 19:06:30,670 INFO L82 GeneralOperation]: Start removeDead. Operand has 99 places, 3788 transitions, 130313 flow [2022-12-12 19:06:30,914 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 99 places, 3788 transitions, 130313 flow [2022-12-12 19:06:30,915 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 3788 transitions, 130313 flow [2022-12-12 19:06:30,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:30,915 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:30,915 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:30,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-12 19:06:30,915 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-12 19:06:30,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:30,915 INFO L85 PathProgramCache]: Analyzing trace with hash 497026232, now seen corresponding path program 3 times [2022-12-12 19:06:30,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:30,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819285340] [2022-12-12 19:06:30,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:30,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:06:31,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:31,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819285340] [2022-12-12 19:06:31,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819285340] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:06:31,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029698038] [2022-12-12 19:06:31,041 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 19:06:31,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:06:31,043 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:06:31,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-12-12 19:06:31,190 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-12-12 19:06:31,190 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 19:06:31,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 19:06:31,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:06:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:06:31,245 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 19:06:31,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029698038] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 19:06:31,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 19:06:31,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-12-12 19:06:31,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100072335] [2022-12-12 19:06:31,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 19:06:31,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 19:06:31,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:06:31,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 19:06:31,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 19:06:31,246 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:06:31,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 3788 transitions, 130313 flow. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:31,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:06:31,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:06:31,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:06:41,349 INFO L130 PetriNetUnfolder]: 19992/23945 cut-off events. [2022-12-12 19:06:41,349 INFO L131 PetriNetUnfolder]: For 1776/1776 co-relation queries the response was YES. [2022-12-12 19:06:41,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 432462 conditions, 23945 events. 19992/23945 cut-off events. For 1776/1776 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 81529 event pairs, 0 based on Foata normal form. 0/17069 useless extension candidates. Maximal degree in co-relation 426036. Up to 23933 conditions per place. [2022-12-12 19:06:41,533 INFO L137 encePairwiseOnDemand]: 33/37 looper letters, 4399 selfloop transitions, 291 changer transitions 0/4690 dead transitions. [2022-12-12 19:06:41,534 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 4690 transitions, 170553 flow [2022-12-12 19:06:41,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 19:06:41,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 19:06:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2022-12-12 19:06:41,535 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5337837837837838 [2022-12-12 19:06:41,535 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 52 predicate places. [2022-12-12 19:06:41,535 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 4690 transitions, 170553 flow [2022-12-12 19:06:41,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 4690 transitions, 170553 flow [2022-12-12 19:06:41,845 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 4690 transitions, 170553 flow [2022-12-12 19:06:41,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:06:41,845 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:06:41,845 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:06:41,850 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-12-12 19:06:42,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-12 19:06:42,047 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-12 19:06:42,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:06:42,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1039155107, now seen corresponding path program 1 times [2022-12-12 19:06:42,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:06:42,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269840304] [2022-12-12 19:06:42,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:42,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:06:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:42,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:06:42,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:06:42,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269840304] [2022-12-12 19:06:42,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269840304] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:06:42,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231213157] [2022-12-12 19:06:42,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:06:42,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:06:42,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:06:42,434 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:06:42,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-12-12 19:06:49,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:06:49,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-12 19:06:49,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 19:06:52,301 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-12 19:06:52,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 19:07:07,863 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:07:07,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231213157] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 19:07:07,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 19:07:07,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2022-12-12 19:07:07,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404175505] [2022-12-12 19:07:07,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 19:07:07,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-12 19:07:07,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:07:07,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-12 19:07:07,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=139, Unknown=4, NotChecked=0, Total=182 [2022-12-12 19:07:07,865 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:07:07,865 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 4690 transitions, 170553 flow. Second operand has 14 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:07:07,865 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:07:07,865 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:07:07,865 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:07:10,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:14,488 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:21,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:23,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:26,147 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:28,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:30,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:50,172 WARN L233 SmtUtils]: Spent 16.70s on a formula simplification. DAG size of input: 79 DAG size of output: 45 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:07:52,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:54,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:56,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:07:58,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:00,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:02,349 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:06,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:15,314 WARN L233 SmtUtils]: Spent 6.36s on a formula simplification. DAG size of input: 74 DAG size of output: 37 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:08:21,771 WARN L233 SmtUtils]: Spent 6.27s on a formula simplification. DAG size of input: 85 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:08:39,042 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:40,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:48,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:52,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:54,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:56,271 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:08:58,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:00,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:02,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:04,887 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:09,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:11,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:13,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:20,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:22,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-12 19:09:38,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:40,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:43,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:45,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:47,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:49,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:51,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:09:59,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:01,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:04,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:07,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:09,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:14,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:16,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:19,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:21,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:29,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:31,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:33,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:45,052 WARN L233 SmtUtils]: Spent 7.24s on a formula simplification. DAG size of input: 60 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:10:47,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:50,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:10:52,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:11:09,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:11:22,635 WARN L233 SmtUtils]: Spent 11.15s on a formula simplification. DAG size of input: 66 DAG size of output: 63 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 19:11:26,495 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-12 19:11:31,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:11:33,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:11:35,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:11:46,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:11:47,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:11:53,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:11:56,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:11:58,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:12:05,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:12:28,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:12:30,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:12:53,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:13:00,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:13:15,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:13:27,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:13:48,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:13:50,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:13:55,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:13:57,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-12 19:14:00,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:14:02,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:14:05,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:14:07,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:14:09,693 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:14:11,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 19:14:14,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:14:16,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 19:14:16,583 INFO L130 PetriNetUnfolder]: 149521/181273 cut-off events. [2022-12-12 19:14:16,584 INFO L131 PetriNetUnfolder]: For 17024/17024 co-relation queries the response was YES. [2022-12-12 19:14:16,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3455881 conditions, 181273 events. 149521/181273 cut-off events. For 17024/17024 co-relation queries the response was YES. Maximal size of possible extension queue 4054. Compared 829177 event pairs, 84 based on Foata normal form. 17/127620 useless extension candidates. Maximal degree in co-relation 3411333. Up to 181261 conditions per place. [2022-12-12 19:14:18,400 INFO L137 encePairwiseOnDemand]: 12/37 looper letters, 20555 selfloop transitions, 5906 changer transitions 9691/36152 dead transitions. [2022-12-12 19:14:18,400 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 36152 transitions, 1388872 flow [2022-12-12 19:14:18,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-12-12 19:14:18,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-12-12 19:14:18,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 1208 transitions. [2022-12-12 19:14:18,405 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5441441441441441 [2022-12-12 19:14:18,405 INFO L295 CegarLoopForPetriNet]: 50 programPoint places, 111 predicate places. [2022-12-12 19:14:18,405 INFO L82 GeneralOperation]: Start removeDead. Operand has 161 places, 36152 transitions, 1388872 flow [2022-12-12 19:14:20,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 144 places, 26461 transitions, 1015229 flow [2022-12-12 19:14:20,126 INFO L495 AbstractCegarLoop]: Abstraction has has 144 places, 26461 transitions, 1015229 flow [2022-12-12 19:14:20,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 8.538461538461538) internal successors, (111), 13 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:14:20,126 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 19:14:20,127 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:14:20,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-12-12 19:14:20,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-12 19:14:20,335 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-12 19:14:20,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 19:14:20,336 INFO L85 PathProgramCache]: Analyzing trace with hash -372840419, now seen corresponding path program 2 times [2022-12-12 19:14:20,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 19:14:20,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145340102] [2022-12-12 19:14:20,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 19:14:20,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 19:14:20,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 19:14:21,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-12-12 19:14:21,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 19:14:21,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145340102] [2022-12-12 19:14:21,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145340102] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 19:14:21,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15581116] [2022-12-12 19:14:21,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 19:14:21,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 19:14:21,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 19:14:21,084 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 19:14:21,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process Received shutdown request... [2022-12-12 19:19:59,137 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 19:19:59,162 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 19:20:00,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 [2022-12-12 19:20:00,338 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forcibly destroying the process [2022-12-12 19:20:00,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-12 19:20:00,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-12-12 19:20:00,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2022-12-12 19:20:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719855673] [2022-12-12 19:20:00,356 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-12-12 19:20:00,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 19:20:00,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 19:20:00,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 19:20:00,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-12 19:20:00,357 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 37 [2022-12-12 19:20:00,357 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 26461 transitions, 1015229 flow. Second operand has 8 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 19:20:00,357 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 19:20:00,357 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 37 [2022-12-12 19:20:00,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 19:20:00,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 137 [2022-12-12 19:20:00,402 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-12 19:20:00,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-12 19:20:00,403 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-12 19:20:00,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 7 remaining) [2022-12-12 19:20:00,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-12 19:20:00,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-12 19:20:00,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-12 19:20:00,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr4INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-12 19:20:00,404 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 7 remaining) [2022-12-12 19:20:00,404 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 19:20:00,409 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 19:20:00,409 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 19:20:00,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 07:20:00 BasicIcfg [2022-12-12 19:20:00,414 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 19:20:00,415 INFO L158 Benchmark]: Toolchain (without parser) took 855224.29ms. Allocated memory was 192.9MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 169.4MB in the beginning and 3.7GB in the end (delta: -3.5GB). Peak memory consumption was 2.7GB. Max. memory is 8.0GB. [2022-12-12 19:20:00,415 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 19:20:00,415 INFO L158 Benchmark]: CACSL2BoogieTranslator took 190.32ms. Allocated memory is still 192.9MB. Free memory was 169.4MB in the beginning and 157.7MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-12 19:20:00,417 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.04ms. Allocated memory is still 192.9MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 19:20:00,418 INFO L158 Benchmark]: Boogie Preprocessor took 30.04ms. Allocated memory is still 192.9MB. Free memory was 155.6MB in the beginning and 154.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 19:20:00,418 INFO L158 Benchmark]: RCFGBuilder took 414.32ms. Allocated memory is still 192.9MB. Free memory was 154.0MB in the beginning and 136.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-12 19:20:00,418 INFO L158 Benchmark]: TraceAbstraction took 854527.00ms. Allocated memory was 192.9MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 135.2MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. [2022-12-12 19:20:00,419 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 192.9MB. Free memory is still 169.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 190.32ms. Allocated memory is still 192.9MB. Free memory was 169.4MB in the beginning and 157.7MB in the end (delta: 11.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 44.04ms. Allocated memory is still 192.9MB. Free memory was 157.7MB in the beginning and 155.6MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.04ms. Allocated memory is still 192.9MB. Free memory was 155.6MB in the beginning and 154.0MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 414.32ms. Allocated memory is still 192.9MB. Free memory was 154.0MB in the beginning and 136.7MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 854527.00ms. Allocated memory was 192.9MB in the beginning and 6.4GB in the end (delta: 6.2GB). Free memory was 135.2MB in the beginning and 3.7GB in the end (delta: -3.6GB). Peak memory consumption was 2.6GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.3s, 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: 1584, independent: 1584, independent conditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 1584, independent conditional: 0, independent unconditional: 1584, 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: 1584, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1584, unknown conditional: 0, unknown unconditional: 1584] , Statistics on independence cache: Total cache size (in pairs): 2588, Positive cache size: 2588, Positive conditional cache size: 0, Positive unconditional cache size: 2588, 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: 117]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 107]: 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: 108]: 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: 106]: 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. - 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: 3.5s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 854.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 472.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.5s, HoareTripleCheckerStatistics: 70 mSolverCounterUnknown, 1602 SdHoareTripleChecker+Valid, 190.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1602 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 188.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5050 IncrementalHoareTripleChecker+Invalid, 5211 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 0 mSDtfsCounter, 5050 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 663 GetRequests, 524 SyntacticMatches, 15 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 139.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1015229occurred in iteration=18, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 437275 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 8.4s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1032 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1174 ConstructedInterpolants, 0 QuantifiedInterpolants, 23534 SizeOfPredicates, 80 NumberOfNonLiveVariables, 3579 ConjunctsInSsa, 97 ConjunctsInUnsatCore, 35 InterpolantComputations, 13 PerfectInterpolantSequences, 97/124 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