/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 --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 22:04:21,831 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 22:04:21,833 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 22:04:21,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 22:04:21,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 22:04:21,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 22:04:21,868 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 22:04:21,871 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 22:04:21,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 22:04:21,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 22:04:21,878 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 22:04:21,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 22:04:21,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 22:04:21,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 22:04:21,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 22:04:21,885 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 22:04:21,886 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 22:04:21,886 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 22:04:21,888 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 22:04:21,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 22:04:21,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 22:04:21,892 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 22:04:21,892 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 22:04:21,893 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 22:04:21,898 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 22:04:21,898 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 22:04:21,899 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 22:04:21,900 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 22:04:21,900 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 22:04:21,900 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 22:04:21,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 22:04:21,901 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 22:04:21,903 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 22:04:21,903 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 22:04:21,904 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 22:04:21,904 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 22:04:21,904 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 22:04:21,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 22:04:21,905 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 22:04:21,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 22:04:21,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 22:04:21,906 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 22:04:21,930 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 22:04:21,931 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 22:04:21,932 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 22:04:21,932 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 22:04:21,933 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 22:04:21,933 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 22:04:21,933 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 22:04:21,933 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 22:04:21,933 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 22:04:21,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 22:04:21,934 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 22:04:21,934 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 22:04:21,934 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 22:04:21,934 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 22:04:21,935 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 22:04:21,935 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 22:04:21,935 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 22:04:21,935 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 22:04:21,935 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 22:04:21,935 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 22:04:21,935 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 22:04:21,935 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 22:04:21,935 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 22:04:21,935 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 22:04:21,936 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 22:04:21,936 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 22:04:21,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 22:04:21,936 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 22:04:21,936 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 22:04:21,936 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 22:04:21,936 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 22:04:22,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 22:04:22,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 22:04:22,273 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 22:04:22,274 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 22:04:22,274 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 22:04:22,275 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-12-12 22:04:23,267 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 22:04:23,484 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 22:04:23,485 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2022-12-12 22:04:23,506 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cda2e135/154238e347ac4d80ba6f2517a47e60e1/FLAG72d2e101f [2022-12-12 22:04:23,517 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8cda2e135/154238e347ac4d80ba6f2517a47e60e1 [2022-12-12 22:04:23,519 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 22:04:23,520 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 22:04:23,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 22:04:23,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 22:04:23,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 22:04:23,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46dc0ff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23, skipping insertion in model container [2022-12-12 22:04:23,525 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,529 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 22:04:23,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 22:04:23,636 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-exp2x3.wvr.c[2237,2250] [2022-12-12 22:04:23,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 22:04:23,645 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 22:04:23,657 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-exp2x3.wvr.c[2237,2250] [2022-12-12 22:04:23,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 22:04:23,666 INFO L208 MainTranslator]: Completed translation [2022-12-12 22:04:23,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23 WrapperNode [2022-12-12 22:04:23,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 22:04:23,668 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 22:04:23,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 22:04:23,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 22:04:23,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,686 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,704 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-12-12 22:04:23,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 22:04:23,705 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 22:04:23,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 22:04:23,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 22:04:23,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,714 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,721 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,722 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,730 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 22:04:23,731 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 22:04:23,731 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 22:04:23,731 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 22:04:23,732 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (1/1) ... [2022-12-12 22:04:23,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 22:04:23,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:04:23,777 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 22:04:23,800 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 22:04:23,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 22:04:23,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 22:04:23,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 22:04:23,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 22:04:23,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 22:04:23,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-12 22:04:23,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-12 22:04:23,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-12 22:04:23,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-12 22:04:23,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 22:04:23,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 22:04:23,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 22:04:23,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 22:04:23,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 22:04:23,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 22:04:23,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 22:04:23,814 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 22:04:23,902 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 22:04:23,903 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 22:04:24,129 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 22:04:24,135 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 22:04:24,136 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-12 22:04:24,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 10:04:24 BoogieIcfgContainer [2022-12-12 22:04:24,137 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 22:04:24,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 22:04:24,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 22:04:24,140 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 22:04:24,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 10:04:23" (1/3) ... [2022-12-12 22:04:24,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7cd627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 10:04:24, skipping insertion in model container [2022-12-12 22:04:24,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 10:04:23" (2/3) ... [2022-12-12 22:04:24,141 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a7cd627 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 10:04:24, skipping insertion in model container [2022-12-12 22:04:24,141 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 10:04:24" (3/3) ... [2022-12-12 22:04:24,142 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2022-12-12 22:04:24,156 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 22:04:24,156 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 22:04:24,157 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 22:04:24,215 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-12 22:04:24,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 118 transitions, 268 flow [2022-12-12 22:04:24,302 INFO L130 PetriNetUnfolder]: 10/114 cut-off events. [2022-12-12 22:04:24,303 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 22:04:24,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 114 events. 10/114 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-12 22:04:24,307 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 118 transitions, 268 flow [2022-12-12 22:04:24,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 105 places, 102 transitions, 228 flow [2022-12-12 22:04:24,312 INFO L203 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-12-12 22:04:24,326 INFO L174 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 102 transitions, 228 flow [2022-12-12 22:04:24,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 102 transitions, 228 flow [2022-12-12 22:04:24,359 INFO L130 PetriNetUnfolder]: 10/102 cut-off events. [2022-12-12 22:04:24,359 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 22:04:24,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 102 events. 10/102 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 46 event pairs, 0 based on Foata normal form. 0/92 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-12-12 22:04:24,363 INFO L222 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 102 transitions, 228 flow [2022-12-12 22:04:24,363 INFO L226 LiptonReduction]: Number of co-enabled transitions 1224 [2022-12-12 22:04:27,300 INFO L241 LiptonReduction]: Total number of compositions: 77 [2022-12-12 22:04:27,315 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 22:04:27,319 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;@64bd5fd3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 22:04:27,319 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-12 22:04:27,323 INFO L130 PetriNetUnfolder]: 4/24 cut-off events. [2022-12-12 22:04:27,324 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-12 22:04:27,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:27,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:27,324 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:04:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:27,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2001352824, now seen corresponding path program 1 times [2022-12-12 22:04:27,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:27,334 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117899039] [2022-12-12 22:04:27,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:27,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:27,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:27,900 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 22:04:27,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:27,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117899039] [2022-12-12 22:04:27,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117899039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:27,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:27,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-12 22:04:27,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254195254] [2022-12-12 22:04:27,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:27,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 22:04:27,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:27,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 22:04:27,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 22:04:27,927 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:27,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 74 flow. Second operand has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:27,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:27,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:27,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:28,067 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2022-12-12 22:04:28,067 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-12 22:04:28,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1448 conditions, 677 events. 497/677 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1775 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1016. Up to 471 conditions per place. [2022-12-12 22:04:28,073 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2022-12-12 22:04:28,073 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 47 transitions, 233 flow [2022-12-12 22:04:28,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 22:04:28,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 22:04:28,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-12-12 22:04:28,081 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.64 [2022-12-12 22:04:28,083 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-12 22:04:28,083 INFO L82 GeneralOperation]: Start removeDead. Operand has 36 places, 47 transitions, 233 flow [2022-12-12 22:04:28,085 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 36 places, 46 transitions, 226 flow [2022-12-12 22:04:28,086 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 46 transitions, 226 flow [2022-12-12 22:04:28,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:28,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:28,087 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:28,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 22:04:28,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:04:28,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1404355402, now seen corresponding path program 1 times [2022-12-12 22:04:28,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:28,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16848044] [2022-12-12 22:04:28,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:28,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:28,264 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 22:04:28,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:28,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16848044] [2022-12-12 22:04:28,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16848044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:28,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:28,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 22:04:28,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48418101] [2022-12-12 22:04:28,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:28,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 22:04:28,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:28,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 22:04:28,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 22:04:28,266 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:28,266 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 46 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:28,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:28,267 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:28,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:28,402 INFO L130 PetriNetUnfolder]: 461/640 cut-off events. [2022-12-12 22:04:28,402 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-12 22:04:28,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2014 conditions, 640 events. 461/640 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1787 event pairs, 37 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 1736. Up to 435 conditions per place. [2022-12-12 22:04:28,411 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 50 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2022-12-12 22:04:28,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 59 transitions, 405 flow [2022-12-12 22:04:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 22:04:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 22:04:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-12 22:04:28,413 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-12 22:04:28,414 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-12 22:04:28,414 INFO L82 GeneralOperation]: Start removeDead. Operand has 39 places, 59 transitions, 405 flow [2022-12-12 22:04:28,416 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 39 places, 59 transitions, 405 flow [2022-12-12 22:04:28,417 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 59 transitions, 405 flow [2022-12-12 22:04:28,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:28,417 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:28,417 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:28,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 22:04:28,417 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:04:28,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:28,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1417631276, now seen corresponding path program 2 times [2022-12-12 22:04:28,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:28,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102177050] [2022-12-12 22:04:28,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:28,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:28,582 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 22:04:28,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:28,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102177050] [2022-12-12 22:04:28,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102177050] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:04:28,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964056180] [2022-12-12 22:04:28,585 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 22:04:28,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:04:28,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:04:28,598 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 22:04:28,616 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 22:04:28,697 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 22:04:28,697 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 22:04:28,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 22:04:28,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:04:28,916 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 22:04:28,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:04:28,982 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 22:04:28,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964056180] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:04:28,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:04:28,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-12 22:04:28,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59139851] [2022-12-12 22:04:28,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:04:28,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 22:04:28,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:28,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 22:04:28,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 22:04:28,984 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:28,985 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 59 transitions, 405 flow. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 22:04:28,985 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:28,985 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:28,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:29,226 INFO L130 PetriNetUnfolder]: 893/1232 cut-off events. [2022-12-12 22:04:29,226 INFO L131 PetriNetUnfolder]: For 138/138 co-relation queries the response was YES. [2022-12-12 22:04:29,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5089 conditions, 1232 events. 893/1232 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4114 event pairs, 37 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 4592. Up to 1027 conditions per place. [2022-12-12 22:04:29,233 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 98 selfloop transitions, 12 changer transitions 0/110 dead transitions. [2022-12-12 22:04:29,234 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 110 transitions, 973 flow [2022-12-12 22:04:29,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 22:04:29,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 22:04:29,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 99 transitions. [2022-12-12 22:04:29,235 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.66 [2022-12-12 22:04:29,235 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-12-12 22:04:29,235 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 110 transitions, 973 flow [2022-12-12 22:04:29,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 44 places, 110 transitions, 973 flow [2022-12-12 22:04:29,241 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 110 transitions, 973 flow [2022-12-12 22:04:29,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 6 states have internal predecessors, (48), 0 states have call successors, (0), 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 22:04:29,241 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:29,242 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:29,250 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 22:04:29,449 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 22:04:29,449 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:04:29,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:29,449 INFO L85 PathProgramCache]: Analyzing trace with hash 618130395, now seen corresponding path program 1 times [2022-12-12 22:04:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:29,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515891105] [2022-12-12 22:04:29,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:29,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:29,614 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 22:04:29,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:29,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515891105] [2022-12-12 22:04:29,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515891105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:29,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:29,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 22:04:29,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915659817] [2022-12-12 22:04:29,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:29,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 22:04:29,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:29,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 22:04:29,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 22:04:29,616 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:29,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 110 transitions, 973 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:29,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:29,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:29,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:29,789 INFO L130 PetriNetUnfolder]: 863/1202 cut-off events. [2022-12-12 22:04:29,789 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2022-12-12 22:04:29,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6172 conditions, 1202 events. 863/1202 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3916 event pairs, 104 based on Foata normal form. 0/790 useless extension candidates. Maximal degree in co-relation 5572. Up to 997 conditions per place. [2022-12-12 22:04:29,796 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 102 selfloop transitions, 11 changer transitions 17/130 dead transitions. [2022-12-12 22:04:29,797 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 130 transitions, 1405 flow [2022-12-12 22:04:29,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 22:04:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 22:04:29,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 61 transitions. [2022-12-12 22:04:29,798 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.61 [2022-12-12 22:04:29,798 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 13 predicate places. [2022-12-12 22:04:29,798 INFO L82 GeneralOperation]: Start removeDead. Operand has 47 places, 130 transitions, 1405 flow [2022-12-12 22:04:29,805 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 47 places, 113 transitions, 1223 flow [2022-12-12 22:04:29,805 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 113 transitions, 1223 flow [2022-12-12 22:04:29,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:29,805 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:29,805 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:29,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 22:04:29,806 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:04:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:29,806 INFO L85 PathProgramCache]: Analyzing trace with hash -501456879, now seen corresponding path program 1 times [2022-12-12 22:04:29,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:29,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114092045] [2022-12-12 22:04:29,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:29,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:29,912 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 22:04:29,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:29,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114092045] [2022-12-12 22:04:29,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114092045] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:04:29,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1137306540] [2022-12-12 22:04:29,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:29,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:04:29,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:04:29,914 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 22:04:29,917 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 22:04:30,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:30,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 22:04:30,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:04:30,126 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 22:04:30,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:04:30,167 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 22:04:30,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1137306540] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:04:30,168 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:04:30,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2022-12-12 22:04:30,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516653263] [2022-12-12 22:04:30,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:04:30,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 22:04:30,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:30,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 22:04:30,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 22:04:30,169 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:30,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 113 transitions, 1223 flow. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:30,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:30,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:30,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:30,448 INFO L130 PetriNetUnfolder]: 1456/1993 cut-off events. [2022-12-12 22:04:30,448 INFO L131 PetriNetUnfolder]: For 256/256 co-relation queries the response was YES. [2022-12-12 22:04:30,450 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12178 conditions, 1993 events. 1456/1993 cut-off events. For 256/256 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6999 event pairs, 100 based on Foata normal form. 0/1331 useless extension candidates. Maximal degree in co-relation 11341. Up to 1919 conditions per place. [2022-12-12 22:04:30,461 INFO L137 encePairwiseOnDemand]: 18/25 looper letters, 213 selfloop transitions, 27 changer transitions 0/240 dead transitions. [2022-12-12 22:04:30,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 240 transitions, 3057 flow [2022-12-12 22:04:30,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 22:04:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 22:04:30,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-12-12 22:04:30,462 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.62 [2022-12-12 22:04:30,463 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-12-12 22:04:30,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 240 transitions, 3057 flow [2022-12-12 22:04:30,474 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 52 places, 240 transitions, 3057 flow [2022-12-12 22:04:30,474 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 240 transitions, 3057 flow [2022-12-12 22:04:30,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 6 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:30,474 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:30,474 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:30,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 22:04:30,680 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 22:04:30,680 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:04:30,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:30,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1246409451, now seen corresponding path program 2 times [2022-12-12 22:04:30,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:30,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572449677] [2022-12-12 22:04:30,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:30,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:30,834 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 22:04:30,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:30,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572449677] [2022-12-12 22:04:30,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572449677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:30,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:30,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 22:04:30,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117229281] [2022-12-12 22:04:30,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:30,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 22:04:30,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:30,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 22:04:30,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 22:04:30,835 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:30,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 240 transitions, 3057 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:30,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:30,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:30,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:31,049 INFO L130 PetriNetUnfolder]: 1708/2329 cut-off events. [2022-12-12 22:04:31,050 INFO L131 PetriNetUnfolder]: For 332/332 co-relation queries the response was YES. [2022-12-12 22:04:31,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16542 conditions, 2329 events. 1708/2329 cut-off events. For 332/332 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 8432 event pairs, 84 based on Foata normal form. 0/1577 useless extension candidates. Maximal degree in co-relation 15574. Up to 2255 conditions per place. [2022-12-12 22:04:31,065 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 267 selfloop transitions, 13 changer transitions 0/280 dead transitions. [2022-12-12 22:04:31,065 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 280 transitions, 4115 flow [2022-12-12 22:04:31,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 22:04:31,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 22:04:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-12 22:04:31,066 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-12 22:04:31,067 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-12-12 22:04:31,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 55 places, 280 transitions, 4115 flow [2022-12-12 22:04:31,124 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 55 places, 280 transitions, 4115 flow [2022-12-12 22:04:31,125 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 280 transitions, 4115 flow [2022-12-12 22:04:31,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:31,125 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:31,125 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:31,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 22:04:31,125 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:04:31,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:31,126 INFO L85 PathProgramCache]: Analyzing trace with hash 850639269, now seen corresponding path program 1 times [2022-12-12 22:04:31,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:31,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550325991] [2022-12-12 22:04:31,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:31,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:31,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:31,207 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 22:04:31,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:31,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550325991] [2022-12-12 22:04:31,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550325991] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:04:31,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 22:04:31,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 22:04:31,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30857694] [2022-12-12 22:04:31,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:04:31,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 22:04:31,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:31,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 22:04:31,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 22:04:31,208 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:31,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 280 transitions, 4115 flow. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:31,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:31,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:31,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:31,443 INFO L130 PetriNetUnfolder]: 1924/2613 cut-off events. [2022-12-12 22:04:31,443 INFO L131 PetriNetUnfolder]: For 334/334 co-relation queries the response was YES. [2022-12-12 22:04:31,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21164 conditions, 2613 events. 1924/2613 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9673 event pairs, 22 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 19965. Up to 2539 conditions per place. [2022-12-12 22:04:31,457 INFO L137 encePairwiseOnDemand]: 19/25 looper letters, 303 selfloop transitions, 13 changer transitions 0/316 dead transitions. [2022-12-12 22:04:31,457 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 316 transitions, 5263 flow [2022-12-12 22:04:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 22:04:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 22:04:31,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-12-12 22:04:31,458 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.57 [2022-12-12 22:04:31,458 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 24 predicate places. [2022-12-12 22:04:31,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 58 places, 316 transitions, 5263 flow [2022-12-12 22:04:31,473 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 58 places, 316 transitions, 5263 flow [2022-12-12 22:04:31,473 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 316 transitions, 5263 flow [2022-12-12 22:04:31,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:04:31,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:04:31,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:04:31,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 22:04:31,473 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:04:31,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:04:31,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1770583295, now seen corresponding path program 1 times [2022-12-12 22:04:31,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:04:31,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067209538] [2022-12-12 22:04:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:31,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:04:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:31,831 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:04:31,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:04:31,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067209538] [2022-12-12 22:04:31,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067209538] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:04:31,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840162471] [2022-12-12 22:04:31,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:04:31,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:04:31,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:04:31,833 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 22:04:31,898 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 22:04:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:04:31,985 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 22:04:31,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:04:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:04:41,509 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:04:42,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:04:42,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840162471] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:04:42,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:04:42,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5, 5] total 13 [2022-12-12 22:04:42,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247788388] [2022-12-12 22:04:42,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:04:42,804 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-12 22:04:42,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:04:42,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-12 22:04:42,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=147, Unknown=1, NotChecked=0, Total=210 [2022-12-12 22:04:42,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:04:42,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 316 transitions, 5263 flow. Second operand has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 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 22:04:42,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:04:42,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:04:42,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:04:45,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:04:52,471 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 22:04:53,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:04:55,757 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 22:04:57,815 WARN 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 22:05:00,777 WARN 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 22:05:04,917 WARN 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 22:05:19,520 WARN 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 22:05:21,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:05:24,173 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 22:05:30,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:05:32,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:05:34,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:05:36,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:05:40,142 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 22:05:42,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:05:44,467 WARN 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 22:05:46,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:05:54,657 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 22:05:56,801 INFO L130 PetriNetUnfolder]: 4108/5737 cut-off events. [2022-12-12 22:05:56,802 INFO L131 PetriNetUnfolder]: For 766/766 co-relation queries the response was YES. [2022-12-12 22:05:56,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52288 conditions, 5737 events. 4108/5737 cut-off events. For 766/766 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 25890 event pairs, 36 based on Foata normal form. 4/3909 useless extension candidates. Maximal degree in co-relation 48476. Up to 5663 conditions per place. [2022-12-12 22:05:56,835 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 679 selfloop transitions, 144 changer transitions 4/827 dead transitions. [2022-12-12 22:05:56,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 827 transitions, 15492 flow [2022-12-12 22:05:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 22:05:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 22:05:56,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 314 transitions. [2022-12-12 22:05:56,837 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.628 [2022-12-12 22:05:56,837 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 43 predicate places. [2022-12-12 22:05:56,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 827 transitions, 15492 flow [2022-12-12 22:05:56,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 823 transitions, 15408 flow [2022-12-12 22:05:56,873 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 823 transitions, 15408 flow [2022-12-12 22:05:56,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 0 states have call successors, (0), 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 22:05:56,874 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:05:56,874 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:05:56,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-12 22:05:57,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:05:57,074 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:05:57,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:05:57,075 INFO L85 PathProgramCache]: Analyzing trace with hash -937633870, now seen corresponding path program 1 times [2022-12-12 22:05:57,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:05:57,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051408572] [2022-12-12 22:05:57,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:05:57,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:05:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:05:57,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:05:57,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:05:57,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051408572] [2022-12-12 22:05:57,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051408572] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:05:57,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815238917] [2022-12-12 22:05:57,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:05:57,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:05:57,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:05:57,770 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 22:05:57,776 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 22:05:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:05:57,900 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 22:05:57,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:06:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:06:18,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:06:21,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:06:21,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1815238917] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:06:21,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:06:21,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-12 22:06:21,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795207545] [2022-12-12 22:06:21,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:06:21,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 22:06:21,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:06:21,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 22:06:21,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=168, Unknown=1, NotChecked=0, Total=240 [2022-12-12 22:06:21,960 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:06:21,961 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 823 transitions, 15408 flow. Second operand has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 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 22:06:21,961 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:06:21,961 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:06:21,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:06:24,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:25,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:27,934 WARN 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 22:06:32,255 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:34,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 22:06:42,529 WARN 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 22:06:45,185 WARN 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 22:06:47,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:49,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:51,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:53,946 WARN 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 22:06:55,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:06:58,410 WARN 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 22:07:00,416 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 22:07:02,442 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 22:07:03,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:06,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:08,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:10,415 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 22:07:12,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 22:07:14,426 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 22:07:26,623 WARN 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 22:07:31,756 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:33,821 WARN 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 22:07:35,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:37,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:07:39,564 WARN 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 22:07:54,796 WARN L233 SmtUtils]: Spent 7.13s on a formula simplification. DAG size of input: 60 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:08:10,041 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 22:08:11,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:14,351 WARN 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 22:08:17,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 22:08:19,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:21,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:23,807 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 22:08:25,821 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 22:08:27,827 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 22:08:29,841 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 22:08:31,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:33,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:34,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:08:37,306 WARN 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 22:08:39,357 WARN 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 22:08:41,367 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 22:08:43,375 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 22:08:45,382 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 22:08:49,089 WARN 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 22:08:51,139 WARN 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 22:08:53,144 WARN 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 22:08:55,311 WARN 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 22:08:57,316 WARN 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 22:08:59,340 WARN 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 22:09:01,346 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 22:09:03,358 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 22:09:05,362 WARN 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 22:09:07,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:10,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:14,463 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 22:09:16,612 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 22:09:18,618 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 22:09:21,803 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 22:09:25,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:27,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:09:29,705 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 22:09:31,710 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 22:09:33,790 INFO L130 PetriNetUnfolder]: 5890/8274 cut-off events. [2022-12-12 22:09:33,790 INFO L131 PetriNetUnfolder]: For 1215/1215 co-relation queries the response was YES. [2022-12-12 22:09:33,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83655 conditions, 8274 events. 5890/8274 cut-off events. For 1215/1215 co-relation queries the response was YES. Maximal size of possible extension queue 289. Compared 40005 event pairs, 30 based on Foata normal form. 6/5625 useless extension candidates. Maximal degree in co-relation 78119. Up to 8200 conditions per place. [2022-12-12 22:09:33,830 INFO L137 encePairwiseOnDemand]: 8/25 looper letters, 1094 selfloop transitions, 144 changer transitions 36/1274 dead transitions. [2022-12-12 22:09:33,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 1274 transitions, 26407 flow [2022-12-12 22:09:33,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-12-12 22:09:33,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2022-12-12 22:09:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 262 transitions. [2022-12-12 22:09:33,832 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5822222222222222 [2022-12-12 22:09:33,832 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 60 predicate places. [2022-12-12 22:09:33,832 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 1274 transitions, 26407 flow [2022-12-12 22:09:33,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 1238 transitions, 25624 flow [2022-12-12 22:09:33,873 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 1238 transitions, 25624 flow [2022-12-12 22:09:33,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.466666666666667) internal successors, (67), 15 states have internal predecessors, (67), 0 states have call successors, (0), 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 22:09:33,873 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:09:33,873 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:09:33,878 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 22:09:34,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:09:34,079 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:09:34,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:09:34,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1500050034, now seen corresponding path program 2 times [2022-12-12 22:09:34,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:09:34,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123786746] [2022-12-12 22:09:34,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:09:34,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:09:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:09:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:09:34,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:09:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123786746] [2022-12-12 22:09:34,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123786746] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:09:34,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1159220569] [2022-12-12 22:09:34,495 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 22:09:34,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:09:34,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:09:34,512 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 22:09:34,514 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 22:09:34,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 22:09:34,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 22:09:34,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 22:09:34,671 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:10:00,054 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:10:00,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:10:15,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:10:15,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1159220569] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:10:15,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:10:15,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2022-12-12 22:10:15,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871944213] [2022-12-12 22:10:15,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:10:15,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 22:10:15,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:10:15,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 22:10:15,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=167, Unknown=12, NotChecked=0, Total=240 [2022-12-12 22:10:15,491 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:10:15,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 1238 transitions, 25624 flow. Second operand has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:10:15,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:10:15,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:10:15,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:10:20,712 WARN 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 22:10:26,715 WARN 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 22:10:28,952 WARN 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 22:10:31,011 WARN 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 22:10:34,820 WARN 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 22:10:36,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:10:51,426 WARN L233 SmtUtils]: Spent 12.85s on a formula simplification. DAG size of input: 78 DAG size of output: 60 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:10:55,703 WARN 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 22:10:57,711 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 22:10:59,721 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 22:11:01,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:04,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:05,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:06,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:13,158 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 22:11:15,194 WARN 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 22:11:17,206 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 22:11:19,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:21,228 WARN 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 22:11:23,504 WARN 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 22:11:25,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:11:27,567 WARN 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 22:11:29,578 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 22:11:31,586 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 22:11:33,589 WARN 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 22:12:03,195 WARN L233 SmtUtils]: Spent 12.86s on a formula simplification. DAG size of input: 54 DAG size of output: 30 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:12:05,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:07,988 WARN 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 22:12:12,726 WARN 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 22:12:14,731 WARN 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 22:12:16,957 WARN 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 22:12:20,177 WARN 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 22:12:22,312 WARN 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 22:12:24,623 WARN 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 22:12:27,189 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 22:12:30,554 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 22:12:33,528 WARN 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 22:12:35,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:38,281 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 22:12:41,865 WARN 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 22:12:44,262 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 22:12:46,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:12:47,102 INFO L130 PetriNetUnfolder]: 8040/11588 cut-off events. [2022-12-12 22:12:47,102 INFO L131 PetriNetUnfolder]: For 1793/1793 co-relation queries the response was YES. [2022-12-12 22:12:47,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128736 conditions, 11588 events. 8040/11588 cut-off events. For 1793/1793 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 62583 event pairs, 88 based on Foata normal form. 4/7901 useless extension candidates. Maximal degree in co-relation 120540. Up to 11514 conditions per place. [2022-12-12 22:12:47,162 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 1737 selfloop transitions, 295 changer transitions 21/2053 dead transitions. [2022-12-12 22:12:47,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 2053 transitions, 46591 flow [2022-12-12 22:12:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-12 22:12:47,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2022-12-12 22:12:47,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 263 transitions. [2022-12-12 22:12:47,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.5536842105263158 [2022-12-12 22:12:47,164 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 78 predicate places. [2022-12-12 22:12:47,164 INFO L82 GeneralOperation]: Start removeDead. Operand has 112 places, 2053 transitions, 46591 flow [2022-12-12 22:12:47,256 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 112 places, 2032 transitions, 46096 flow [2022-12-12 22:12:47,256 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 2032 transitions, 46096 flow [2022-12-12 22:12:47,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 4.333333333333333) internal successors, (65), 15 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:12:47,256 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:12:47,256 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:12:47,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-12 22:12:47,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-12 22:12:47,463 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:12:47,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:12:47,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1287299241, now seen corresponding path program 2 times [2022-12-12 22:12:47,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:12:47,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979547675] [2022-12-12 22:12:47,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:12:47,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:12:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:12:47,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:12:47,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:12:47,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979547675] [2022-12-12 22:12:47,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979547675] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:12:47,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363713882] [2022-12-12 22:12:47,862 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 22:12:47,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:12:47,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:12:47,872 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 22:12:47,896 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 22:12:48,017 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 22:12:48,017 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 22:12:48,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-12 22:12:48,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:13:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:13:14,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:13:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:13:24,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [363713882] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:13:24,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:13:24,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 15 [2022-12-12 22:13:24,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575695566] [2022-12-12 22:13:24,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:13:24,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-12-12 22:13:24,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:13:24,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-12-12 22:13:24,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=193, Unknown=9, NotChecked=0, Total=272 [2022-12-12 22:13:24,075 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:13:24,075 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 2032 transitions, 46096 flow. Second operand has 17 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:13:24,075 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:13:24,075 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:13:24,075 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:13:28,329 WARN 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 22:13:29,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:30,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:32,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:46,275 WARN L233 SmtUtils]: Spent 11.20s on a formula simplification. DAG size of input: 54 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:13:48,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:51,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:13:59,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:01,661 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 22:14:16,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:21,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:26,866 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:14:29,911 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 22:14:32,486 INFO L130 PetriNetUnfolder]: 11168/16048 cut-off events. [2022-12-12 22:14:32,486 INFO L131 PetriNetUnfolder]: For 2447/2447 co-relation queries the response was YES. [2022-12-12 22:14:32,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194367 conditions, 16048 events. 11168/16048 cut-off events. For 2447/2447 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 90909 event pairs, 136 based on Foata normal form. 8/10793 useless extension candidates. Maximal degree in co-relation 180938. Up to 15974 conditions per place. [2022-12-12 22:14:32,584 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 2435 selfloop transitions, 218 changer transitions 12/2665 dead transitions. [2022-12-12 22:14:32,584 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 2665 transitions, 65814 flow [2022-12-12 22:14:32,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-12 22:14:32,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2022-12-12 22:14:32,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 266 transitions. [2022-12-12 22:14:32,586 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.665 [2022-12-12 22:14:32,587 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 93 predicate places. [2022-12-12 22:14:32,587 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 2665 transitions, 65814 flow [2022-12-12 22:14:32,749 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 2653 transitions, 65502 flow [2022-12-12 22:14:32,749 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 2653 transitions, 65502 flow [2022-12-12 22:14:32,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.6875) internal successors, (59), 16 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:14:32,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:14:32,750 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 22:14:32,758 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 22:14:32,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:14:32,957 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-12 22:14:32,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:14:32,957 INFO L85 PathProgramCache]: Analyzing trace with hash -879544913, now seen corresponding path program 3 times [2022-12-12 22:14:32,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:14:32,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137492028] [2022-12-12 22:14:32,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:14:32,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:14:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:14:33,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:14:33,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:14:33,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137492028] [2022-12-12 22:14:33,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137492028] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:14:33,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403680376] [2022-12-12 22:14:33,091 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 22:14:33,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:14:33,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:14:33,104 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 22:14:33,105 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 22:14:34,176 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-12 22:14:34,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 22:14:34,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-12 22:14:34,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:14:41,203 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:14:41,203 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 22:15:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 22:15:18,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403680376] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 22:15:18,171 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 22:15:18,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2022-12-12 22:15:18,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812349795] [2022-12-12 22:15:18,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 22:15:18,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-12-12 22:15:18,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:15:18,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-12-12 22:15:18,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=176, Unknown=4, NotChecked=0, Total=240 [2022-12-12 22:15:18,172 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:15:18,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 2653 transitions, 65502 flow. Second operand has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 22:15:18,174 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:15:18,174 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:15:18,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 22:15:20,209 WARN 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 22:15:22,359 WARN 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 22:15:24,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:32,468 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 69 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 22:15:33,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:35,774 WARN 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 22:15:39,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:41,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:43,775 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 22:15:45,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:47,835 WARN 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 22:15:49,841 WARN 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 22:15:52,991 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 22:15:55,012 WARN 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 22:15:57,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:15:59,030 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 22:16:01,265 WARN 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 22:16:03,323 WARN 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 22:16:05,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:07,376 WARN 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 22:16:09,385 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 22:16:11,510 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 22:16:13,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:15,729 WARN 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 22:16:17,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:16:33,606 WARN 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 22:16:38,114 WARN 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 22:16:47,287 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 22:16:49,292 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 22:16:51,338 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 22:16:53,344 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 22:16:55,472 WARN 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 22:16:57,486 WARN 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 22:16:59,490 WARN 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 22:17:01,515 WARN 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 22:17:03,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:05,573 WARN 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 22:17:07,579 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 22:17:10,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:14,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:16,064 WARN 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 22:17:18,112 WARN 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 22:17:20,118 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 22:17:21,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:27,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 22:17:29,909 WARN 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 22:17:32,287 WARN 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 22:17:34,968 WARN 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 22:17:36,985 WARN 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 22:17:38,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:41,064 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 22:17:43,069 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 22:17:45,101 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 22:17:47,109 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 22:17:54,059 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:17:58,490 WARN 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 22:18:00,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:18:02,521 WARN 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 22:18:04,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 22:18:09,675 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 22:18:11,691 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 22:18:13,695 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 22:18:30,226 INFO L130 PetriNetUnfolder]: 27093/39290 cut-off events. [2022-12-12 22:18:30,226 INFO L131 PetriNetUnfolder]: For 6000/6000 co-relation queries the response was YES. [2022-12-12 22:18:30,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 515210 conditions, 39290 events. 27093/39290 cut-off events. For 6000/6000 co-relation queries the response was YES. Maximal size of possible extension queue 1625. Compared 258978 event pairs, 160 based on Foata normal form. 16/26976 useless extension candidates. Maximal degree in co-relation 482255. Up to 39216 conditions per place. [2022-12-12 22:18:30,666 INFO L137 encePairwiseOnDemand]: 17/25 looper letters, 4965 selfloop transitions, 1465 changer transitions 42/6472 dead transitions. [2022-12-12 22:18:30,666 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 6472 transitions, 172967 flow [2022-12-12 22:18:30,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-12-12 22:18:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2022-12-12 22:18:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 529 transitions. [2022-12-12 22:18:30,672 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.66125 [2022-12-12 22:18:30,672 INFO L295 CegarLoopForPetriNet]: 34 programPoint places, 121 predicate places. [2022-12-12 22:18:30,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 155 places, 6472 transitions, 172967 flow [2022-12-12 22:18:31,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 6430 transitions, 171821 flow [2022-12-12 22:18:31,045 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 6430 transitions, 171821 flow [2022-12-12 22:18:31,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.875) internal successors, (62), 15 states have internal predecessors, (62), 0 states have call successors, (0), 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 22:18:31,045 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 22:18:31,045 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] [2022-12-12 22:18:31,050 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 22:18:31,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:18:31,250 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 2 more)] === [2022-12-12 22:18:31,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 22:18:31,251 INFO L85 PathProgramCache]: Analyzing trace with hash 468863912, now seen corresponding path program 1 times [2022-12-12 22:18:31,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 22:18:31,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265495397] [2022-12-12 22:18:31,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:18:31,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 22:18:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:18:31,361 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 22:18:31,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 22:18:31,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265495397] [2022-12-12 22:18:31,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265495397] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 22:18:31,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [123946292] [2022-12-12 22:18:31,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 22:18:31,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 22:18:31,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 22:18:31,363 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 22:18:31,365 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 22:18:31,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 22:18:31,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-12 22:18:31,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 22:18:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 22:18:31,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-12 22:18:31,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [123946292] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 22:18:31,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-12 22:18:31,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2022-12-12 22:18:31,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462987591] [2022-12-12 22:18:31,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 22:18:31,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 22:18:31,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 22:18:31,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 22:18:31,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-12 22:18:31,521 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 0 out of 25 [2022-12-12 22:18:31,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 6430 transitions, 171821 flow. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 22:18:31,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 22:18:31,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 0 of 25 [2022-12-12 22:18:31,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-12 22:19:00,042 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 22:19:00,042 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 22:19:00,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 22:19:00,071 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-12 22:19:00,090 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 22:19:00,276 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 22:19:00,276 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 0/25 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 457117 conditions, 32401 events (22996/32400 cut-off events. For 4893/4893 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 205100 event pairs, 106 based on Foata normal form. 37/23060 useless extension candidates. Maximal degree in co-relation 446948. Up to 32326 conditions per place.). [2022-12-12 22:19:00,278 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-12 22:19:00,278 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-12 22:19:00,278 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-12 22:19:00,278 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-12 22:19:00,279 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1] [2022-12-12 22:19:00,281 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 22:19:00,281 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 22:19:00,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 10:19:00 BasicIcfg [2022-12-12 22:19:00,282 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 22:19:00,283 INFO L158 Benchmark]: Toolchain (without parser) took 876762.70ms. Allocated memory was 190.8MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 167.4MB in the beginning and 368.9MB in the end (delta: -201.5MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-12 22:19:00,283 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 190.8MB. Free memory is still 166.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 22:19:00,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 144.97ms. Allocated memory is still 190.8MB. Free memory was 167.4MB in the beginning and 156.3MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-12 22:19:00,283 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.99ms. Allocated memory is still 190.8MB. Free memory was 156.3MB in the beginning and 154.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 22:19:00,283 INFO L158 Benchmark]: Boogie Preprocessor took 25.10ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 153.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 22:19:00,283 INFO L158 Benchmark]: RCFGBuilder took 405.98ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 138.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2022-12-12 22:19:00,283 INFO L158 Benchmark]: TraceAbstraction took 876143.84ms. Allocated memory was 190.8MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 137.6MB in the beginning and 368.9MB in the end (delta: -231.3MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-12 22:19:00,284 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.09ms. Allocated memory is still 190.8MB. Free memory is still 166.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 144.97ms. Allocated memory is still 190.8MB. Free memory was 167.4MB in the beginning and 156.3MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.99ms. Allocated memory is still 190.8MB. Free memory was 156.3MB in the beginning and 154.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.10ms. Allocated memory is still 190.8MB. Free memory was 154.3MB in the beginning and 153.3MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 405.98ms. Allocated memory is still 190.8MB. Free memory was 153.3MB in the beginning and 138.6MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * TraceAbstraction took 876143.84ms. Allocated memory was 190.8MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 137.6MB in the beginning and 368.9MB in the end (delta: -231.3MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.9s, 105 PlacesBefore, 34 PlacesAfterwards, 102 TransitionsBefore, 25 TransitionsAfterwards, 1224 CoEnabledTransitionPairs, 2 FixpointIterations, 0 TrivialSequentialCompositions, 0 ConcurrentSequentialCompositions, 42 TrivialYvCompositions, 29 ConcurrentYvCompositions, 6 ChoiceCompositions, 77 TotalNumberOfCompositions, Independence Relation Statistics: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 615, independent: 615, independent conditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 615, independent conditional: 0, independent unconditional: 615, 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: 615, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 615, unknown conditional: 0, unknown unconditional: 615] , Statistics on independence cache: Total cache size (in pairs): 1005, Positive cache size: 1005, Positive conditional cache size: 0, Positive unconditional cache size: 1005, 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: 92]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 0/25 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 457117 conditions, 32401 events (22996/32400 cut-off events. For 4893/4893 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 205100 event pairs, 106 based on Foata normal form. 37/23060 useless extension candidates. Maximal degree in co-relation 446948. Up to 32326 conditions per place.). - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 0/25 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 457117 conditions, 32401 events (22996/32400 cut-off events. For 4893/4893 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 205100 event pairs, 106 based on Foata normal form. 37/23060 useless extension candidates. Maximal degree in co-relation 446948. Up to 32326 conditions per place.). - TimeoutResultAtElement [Line: 82]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 0/25 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 457117 conditions, 32401 events (22996/32400 cut-off events. For 4893/4893 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 205100 event pairs, 106 based on Foata normal form. 37/23060 useless extension candidates. Maximal degree in co-relation 446948. Up to 32326 conditions per place.). - TimeoutResultAtElement [Line: 84]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 0/25 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 457117 conditions, 32401 events (22996/32400 cut-off events. For 4893/4893 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 205100 event pairs, 106 based on Foata normal form. 37/23060 useless extension candidates. Maximal degree in co-relation 446948. Up to 32326 conditions per place.). - TimeoutResultAtElement [Line: 83]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (4states, 0/25 universal loopers) in iteration 13,while PetriNetUnfolder was constructing finite prefix that currently has 457117 conditions, 32401 events (22996/32400 cut-off events. For 4893/4893 co-relation queries the response was YES. Maximal size of possible extension queue 1453. Compared 205100 event pairs, 106 based on Foata normal form. 37/23060 useless extension candidates. Maximal degree in co-relation 446948. Up to 32326 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 133 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.8s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 876.0s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 708.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 160 mSolverCounterUnknown, 1765 SdHoareTripleChecker+Valid, 467.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1765 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 464.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 206 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5894 IncrementalHoareTripleChecker+Invalid, 6260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 206 mSolverCounterUnsat, 0 mSDtfsCounter, 5894 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 442 GetRequests, 280 SyntacticMatches, 10 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 307.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171821occurred in iteration=12, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 3009 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 159.1s InterpolantComputationTime, 477 NumberOfCodeBlocks, 477 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 23309 SizeOfPredicates, 36 NumberOfNonLiveVariables, 1624 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 28 InterpolantComputations, 6 PerfectInterpolantSequences, 13/52 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