/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-NoLbe.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/popl20-channel-sum.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 00:42:58,016 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 00:42:58,018 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 00:42:58,074 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 00:42:58,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 00:42:58,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 00:42:58,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 00:42:58,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 00:42:58,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 00:42:58,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 00:42:58,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 00:42:58,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 00:42:58,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 00:42:58,098 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 00:42:58,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 00:42:58,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 00:42:58,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 00:42:58,100 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 00:42:58,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 00:42:58,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 00:42:58,103 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 00:42:58,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 00:42:58,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 00:42:58,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 00:42:58,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 00:42:58,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 00:42:58,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 00:42:58,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 00:42:58,112 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 00:42:58,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 00:42:58,113 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 00:42:58,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 00:42:58,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 00:42:58,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 00:42:58,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 00:42:58,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 00:42:58,115 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 00:42:58,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 00:42:58,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 00:42:58,116 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 00:42:58,117 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 00:42:58,121 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-NoLbe.epf [2022-12-12 00:42:58,144 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 00:42:58,145 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 00:42:58,146 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 00:42:58,146 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 00:42:58,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 00:42:58,147 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 00:42:58,147 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 00:42:58,147 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 00:42:58,147 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 00:42:58,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 00:42:58,148 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 00:42:58,148 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 00:42:58,148 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 00:42:58,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 00:42:58,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 00:42:58,148 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 00:42:58,149 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 00:42:58,149 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 00:42:58,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 00:42:58,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 00:42:58,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 00:42:58,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 00:42:58,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 00:42:58,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 00:42:58,149 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 00:42:58,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 00:42:58,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 00:42:58,150 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 00:42:58,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 00:42:58,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 00:42:58,150 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 00:42:58,150 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 00:42:58,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 00:42:58,407 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 00:42:58,409 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 00:42:58,410 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 00:42:58,410 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 00:42:58,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-12 00:42:59,467 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 00:42:59,692 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 00:42:59,693 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-channel-sum.wvr.c [2022-12-12 00:42:59,697 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed95f8183/98cc2c036fcf423ba223f912734c729c/FLAG239fbec27 [2022-12-12 00:42:59,710 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed95f8183/98cc2c036fcf423ba223f912734c729c [2022-12-12 00:42:59,713 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 00:42:59,714 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 00:42:59,715 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 00:42:59,715 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 00:42:59,717 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 00:42:59,718 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68aa97d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59, skipping insertion in model container [2022-12-12 00:42:59,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 00:42:59,740 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 00:42:59,850 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,851 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,859 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,860 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,862 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,866 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,871 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/popl20-channel-sum.wvr.c[2947,2960] [2022-12-12 00:42:59,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 00:42:59,882 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 00:42:59,890 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,891 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,892 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,893 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,894 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 00:42:59,895 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 00:42:59,897 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/popl20-channel-sum.wvr.c[2947,2960] [2022-12-12 00:42:59,899 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 00:42:59,908 INFO L208 MainTranslator]: Completed translation [2022-12-12 00:42:59,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59 WrapperNode [2022-12-12 00:42:59,909 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 00:42:59,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 00:42:59,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 00:42:59,910 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 00:42:59,914 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,919 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,947 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 151 [2022-12-12 00:42:59,948 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 00:42:59,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 00:42:59,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 00:42:59,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 00:42:59,956 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,956 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,979 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,984 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,987 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,989 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 00:42:59,990 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 00:42:59,990 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 00:42:59,990 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 00:42:59,990 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (1/1) ... [2022-12-12 00:42:59,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 00:43:00,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:00,025 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 00:43:00,031 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 00:43:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 00:43:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 00:43:00,053 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 00:43:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 00:43:00,053 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 00:43:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 00:43:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 00:43:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 00:43:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 00:43:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 00:43:00,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 00:43:00,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 00:43:00,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 00:43:00,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 00:43:00,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 00:43:00,055 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 00:43:00,120 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 00:43:00,122 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 00:43:00,330 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 00:43:00,372 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 00:43:00,372 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 00:43:00,374 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:43:00 BoogieIcfgContainer [2022-12-12 00:43:00,374 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 00:43:00,376 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 00:43:00,376 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 00:43:00,378 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 00:43:00,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 12:42:59" (1/3) ... [2022-12-12 00:43:00,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d19e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:43:00, skipping insertion in model container [2022-12-12 00:43:00,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 12:42:59" (2/3) ... [2022-12-12 00:43:00,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67d19e95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 12:43:00, skipping insertion in model container [2022-12-12 00:43:00,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 12:43:00" (3/3) ... [2022-12-12 00:43:00,381 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-channel-sum.wvr.c [2022-12-12 00:43:00,393 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 00:43:00,394 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 00:43:00,394 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 00:43:00,455 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 00:43:00,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 131 transitions, 278 flow [2022-12-12 00:43:00,524 INFO L130 PetriNetUnfolder]: 11/129 cut-off events. [2022-12-12 00:43:00,524 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 00:43:00,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 11/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 123 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-12 00:43:00,528 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 131 transitions, 278 flow [2022-12-12 00:43:00,531 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 121 transitions, 254 flow [2022-12-12 00:43:00,537 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 00:43:00,542 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;@62aab614, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 00:43:00,542 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 00:43:00,562 INFO L130 PetriNetUnfolder]: 11/120 cut-off events. [2022-12-12 00:43:00,562 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 00:43:00,562 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:00,563 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:00,563 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:00,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:00,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1903356989, now seen corresponding path program 1 times [2022-12-12 00:43:00,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:00,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603541265] [2022-12-12 00:43:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:00,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:00,819 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 00:43:00,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:00,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603541265] [2022-12-12 00:43:00,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603541265] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:00,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:00,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-12 00:43:00,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867628104] [2022-12-12 00:43:00,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:00,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-12 00:43:00,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:00,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-12 00:43:00,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-12 00:43:00,873 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 131 [2022-12-12 00:43:00,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 121 transitions, 254 flow. Second operand has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 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 00:43:00,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:00,878 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 131 [2022-12-12 00:43:00,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:00,951 INFO L130 PetriNetUnfolder]: 11/138 cut-off events. [2022-12-12 00:43:00,951 INFO L131 PetriNetUnfolder]: For 23/23 co-relation queries the response was YES. [2022-12-12 00:43:00,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 138 events. 11/138 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 206 event pairs, 4 based on Foata normal form. 19/148 useless extension candidates. Maximal degree in co-relation 86. Up to 21 conditions per place. [2022-12-12 00:43:00,957 INFO L137 encePairwiseOnDemand]: 124/131 looper letters, 9 selfloop transitions, 0 changer transitions 3/114 dead transitions. [2022-12-12 00:43:00,957 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 114 transitions, 258 flow [2022-12-12 00:43:00,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-12 00:43:00,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-12 00:43:00,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 244 transitions. [2022-12-12 00:43:00,971 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9312977099236641 [2022-12-12 00:43:00,975 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 1 predicate places. [2022-12-12 00:43:00,975 INFO L82 GeneralOperation]: Start removeDead. Operand has 118 places, 114 transitions, 258 flow [2022-12-12 00:43:00,978 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 111 transitions, 252 flow [2022-12-12 00:43:00,979 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 252 flow [2022-12-12 00:43:00,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 116.5) internal successors, (233), 2 states have internal predecessors, (233), 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 00:43:00,980 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:00,980 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:00,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 00:43:00,981 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:00,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:00,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1276074944, now seen corresponding path program 1 times [2022-12-12 00:43:00,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:00,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717025822] [2022-12-12 00:43:00,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:00,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:01,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:01,298 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 00:43:01,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:01,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717025822] [2022-12-12 00:43:01,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717025822] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:01,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:01,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 00:43:01,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324769545] [2022-12-12 00:43:01,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:01,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 00:43:01,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:01,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 00:43:01,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 00:43:01,302 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 131 [2022-12-12 00:43:01,302 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 252 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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 00:43:01,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:01,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 131 [2022-12-12 00:43:01,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:01,413 INFO L130 PetriNetUnfolder]: 27/278 cut-off events. [2022-12-12 00:43:01,413 INFO L131 PetriNetUnfolder]: For 84/84 co-relation queries the response was YES. [2022-12-12 00:43:01,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 404 conditions, 278 events. 27/278 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 997 event pairs, 4 based on Foata normal form. 1/257 useless extension candidates. Maximal degree in co-relation 263. Up to 38 conditions per place. [2022-12-12 00:43:01,419 INFO L137 encePairwiseOnDemand]: 126/131 looper letters, 29 selfloop transitions, 2 changer transitions 4/123 dead transitions. [2022-12-12 00:43:01,419 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 123 transitions, 371 flow [2022-12-12 00:43:01,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 00:43:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 00:43:01,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 521 transitions. [2022-12-12 00:43:01,426 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7954198473282442 [2022-12-12 00:43:01,427 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 2 predicate places. [2022-12-12 00:43:01,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 119 places, 123 transitions, 371 flow [2022-12-12 00:43:01,430 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 119 transitions, 350 flow [2022-12-12 00:43:01,430 INFO L495 AbstractCegarLoop]: Abstraction has has 117 places, 119 transitions, 350 flow [2022-12-12 00:43:01,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 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 00:43:01,431 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:01,431 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:01,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 00:43:01,431 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:01,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:01,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1186161427, now seen corresponding path program 1 times [2022-12-12 00:43:01,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:01,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936359300] [2022-12-12 00:43:01,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:01,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:01,651 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 00:43:01,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:01,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936359300] [2022-12-12 00:43:01,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936359300] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:01,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:01,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 00:43:01,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083928948] [2022-12-12 00:43:01,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:01,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 00:43:01,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:01,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 00:43:01,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 00:43:01,653 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 131 [2022-12-12 00:43:01,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 119 transitions, 350 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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 00:43:01,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:01,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 131 [2022-12-12 00:43:01,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:01,744 INFO L130 PetriNetUnfolder]: 110/415 cut-off events. [2022-12-12 00:43:01,744 INFO L131 PetriNetUnfolder]: For 403/407 co-relation queries the response was YES. [2022-12-12 00:43:01,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 914 conditions, 415 events. 110/415 cut-off events. For 403/407 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1547 event pairs, 15 based on Foata normal form. 0/384 useless extension candidates. Maximal degree in co-relation 788. Up to 167 conditions per place. [2022-12-12 00:43:01,746 INFO L137 encePairwiseOnDemand]: 126/131 looper letters, 32 selfloop transitions, 6 changer transitions 3/132 dead transitions. [2022-12-12 00:43:01,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 132 transitions, 505 flow [2022-12-12 00:43:01,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 00:43:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 00:43:01,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2022-12-12 00:43:01,748 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8473282442748091 [2022-12-12 00:43:01,748 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2022-12-12 00:43:01,748 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 132 transitions, 505 flow [2022-12-12 00:43:01,750 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 120 places, 129 transitions, 479 flow [2022-12-12 00:43:01,750 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 129 transitions, 479 flow [2022-12-12 00:43:01,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 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 00:43:01,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:01,751 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:01,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 00:43:01,751 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:01,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash 236082458, now seen corresponding path program 1 times [2022-12-12 00:43:01,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:01,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404493222] [2022-12-12 00:43:01,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:01,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:01,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:01,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404493222] [2022-12-12 00:43:01,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404493222] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:43:01,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089696347] [2022-12-12 00:43:01,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:01,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:01,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:01,988 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 00:43:02,031 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 00:43:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:02,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 10 conjunts are in the unsatisfiable core [2022-12-12 00:43:02,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:43:02,222 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:02,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:43:02,372 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 00:43:02,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089696347] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:43:02,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:43:02,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 8 [2022-12-12 00:43:02,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502902273] [2022-12-12 00:43:02,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:43:02,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 00:43:02,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:02,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 00:43:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-12 00:43:02,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 131 [2022-12-12 00:43:02,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 129 transitions, 479 flow. Second operand has 8 states, 8 states have (on average 105.25) internal successors, (842), 8 states have internal predecessors, (842), 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 00:43:02,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:02,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 131 [2022-12-12 00:43:02,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:02,518 INFO L130 PetriNetUnfolder]: 105/410 cut-off events. [2022-12-12 00:43:02,518 INFO L131 PetriNetUnfolder]: For 485/501 co-relation queries the response was YES. [2022-12-12 00:43:02,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 410 events. 105/410 cut-off events. For 485/501 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1459 event pairs, 6 based on Foata normal form. 2/383 useless extension candidates. Maximal degree in co-relation 906. Up to 177 conditions per place. [2022-12-12 00:43:02,523 INFO L137 encePairwiseOnDemand]: 124/131 looper letters, 40 selfloop transitions, 6 changer transitions 19/156 dead transitions. [2022-12-12 00:43:02,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 156 transitions, 817 flow [2022-12-12 00:43:02,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 00:43:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 00:43:02,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 766 transitions. [2022-12-12 00:43:02,525 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8353326063249727 [2022-12-12 00:43:02,526 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 9 predicate places. [2022-12-12 00:43:02,529 INFO L82 GeneralOperation]: Start removeDead. Operand has 126 places, 156 transitions, 817 flow [2022-12-12 00:43:02,533 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 123 places, 137 transitions, 636 flow [2022-12-12 00:43:02,533 INFO L495 AbstractCegarLoop]: Abstraction has has 123 places, 137 transitions, 636 flow [2022-12-12 00:43:02,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 105.25) internal successors, (842), 8 states have internal predecessors, (842), 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 00:43:02,537 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:02,538 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:02,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-12 00:43:02,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:02,743 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:02,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:02,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1330008338, now seen corresponding path program 2 times [2022-12-12 00:43:02,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:02,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221489260] [2022-12-12 00:43:02,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:02,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:03,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:03,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221489260] [2022-12-12 00:43:03,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221489260] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:03,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:03,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-12 00:43:03,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378040165] [2022-12-12 00:43:03,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:03,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 00:43:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:03,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 00:43:03,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-12 00:43:03,022 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 131 [2022-12-12 00:43:03,023 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 137 transitions, 636 flow. Second operand has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 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 00:43:03,023 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:03,024 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 131 [2022-12-12 00:43:03,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:03,378 INFO L130 PetriNetUnfolder]: 156/491 cut-off events. [2022-12-12 00:43:03,378 INFO L131 PetriNetUnfolder]: For 1284/1308 co-relation queries the response was YES. [2022-12-12 00:43:03,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1670 conditions, 491 events. 156/491 cut-off events. For 1284/1308 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1768 event pairs, 6 based on Foata normal form. 0/459 useless extension candidates. Maximal degree in co-relation 1143. Up to 240 conditions per place. [2022-12-12 00:43:03,381 INFO L137 encePairwiseOnDemand]: 119/131 looper letters, 71 selfloop transitions, 6 changer transitions 45/197 dead transitions. [2022-12-12 00:43:03,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 197 transitions, 1366 flow [2022-12-12 00:43:03,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-12 00:43:03,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-12 00:43:03,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1121 transitions. [2022-12-12 00:43:03,384 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7131043256997456 [2022-12-12 00:43:03,386 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 17 predicate places. [2022-12-12 00:43:03,386 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 197 transitions, 1366 flow [2022-12-12 00:43:03,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 152 transitions, 876 flow [2022-12-12 00:43:03,389 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 152 transitions, 876 flow [2022-12-12 00:43:03,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 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 00:43:03,389 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:03,389 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:03,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 00:43:03,390 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:03,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:03,390 INFO L85 PathProgramCache]: Analyzing trace with hash 407195731, now seen corresponding path program 1 times [2022-12-12 00:43:03,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:03,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093001059] [2022-12-12 00:43:03,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:03,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 00:43:03,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:03,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093001059] [2022-12-12 00:43:03,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093001059] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:43:03,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170569512] [2022-12-12 00:43:03,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:03,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:03,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:03,679 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 00:43:03,682 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 00:43:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:03,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 51 conjunts are in the unsatisfiable core [2022-12-12 00:43:03,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:43:04,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 00:43:04,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 00:43:04,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 00:43:04,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 00:43:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:04,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:43:06,078 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:06,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 51 [2022-12-12 00:43:06,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:06,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 153 treesize of output 149 [2022-12-12 00:43:06,097 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:06,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 137 [2022-12-12 00:43:06,105 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:06,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 113 [2022-12-12 00:43:06,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:06,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 51 [2022-12-12 00:43:06,294 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 00:43:06,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 325 treesize of output 297 [2022-12-12 00:43:06,305 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 00:43:06,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 293 treesize of output 249 [2022-12-12 00:43:06,316 INFO L321 Elim1Store]: treesize reduction 8, result has 33.3 percent of original size [2022-12-12 00:43:06,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 245 treesize of output 225 [2022-12-12 00:43:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:06,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170569512] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:43:06,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:43:06,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 28, 25] total 52 [2022-12-12 00:43:06,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448387755] [2022-12-12 00:43:06,817 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:43:06,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-12-12 00:43:06,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:06,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-12-12 00:43:06,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=2161, Unknown=26, NotChecked=0, Total=2652 [2022-12-12 00:43:06,822 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 131 [2022-12-12 00:43:06,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 152 transitions, 876 flow. Second operand has 52 states, 52 states have (on average 48.26923076923077) internal successors, (2510), 52 states have internal predecessors, (2510), 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 00:43:06,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:06,825 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 131 [2022-12-12 00:43:06,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:29,480 INFO L130 PetriNetUnfolder]: 1015/2220 cut-off events. [2022-12-12 00:43:29,480 INFO L131 PetriNetUnfolder]: For 6698/6796 co-relation queries the response was YES. [2022-12-12 00:43:29,485 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8832 conditions, 2220 events. 1015/2220 cut-off events. For 6698/6796 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14348 event pairs, 70 based on Foata normal form. 11/2121 useless extension candidates. Maximal degree in co-relation 7081. Up to 1074 conditions per place. [2022-12-12 00:43:29,496 INFO L137 encePairwiseOnDemand]: 94/131 looper letters, 250 selfloop transitions, 123 changer transitions 8/421 dead transitions. [2022-12-12 00:43:29,496 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 421 transitions, 3726 flow [2022-12-12 00:43:29,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-12-12 00:43:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2022-12-12 00:43:29,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 3086 transitions. [2022-12-12 00:43:29,503 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38618445751470404 [2022-12-12 00:43:29,504 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 70 predicate places. [2022-12-12 00:43:29,504 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 421 transitions, 3726 flow [2022-12-12 00:43:29,516 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 185 places, 413 transitions, 3649 flow [2022-12-12 00:43:29,516 INFO L495 AbstractCegarLoop]: Abstraction has has 185 places, 413 transitions, 3649 flow [2022-12-12 00:43:29,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 48.26923076923077) internal successors, (2510), 52 states have internal predecessors, (2510), 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 00:43:29,517 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:29,517 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:29,541 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 00:43:29,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-12 00:43:29,727 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:29,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:29,727 INFO L85 PathProgramCache]: Analyzing trace with hash 90700250, now seen corresponding path program 1 times [2022-12-12 00:43:29,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:29,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890861891] [2022-12-12 00:43:29,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:29,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:29,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:29,798 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 00:43:29,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:29,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890861891] [2022-12-12 00:43:29,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890861891] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:29,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:29,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 00:43:29,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401615511] [2022-12-12 00:43:29,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:29,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 00:43:29,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:29,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 00:43:29,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 00:43:29,805 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 131 [2022-12-12 00:43:29,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 413 transitions, 3649 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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 00:43:29,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:29,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 131 [2022-12-12 00:43:29,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:30,039 INFO L130 PetriNetUnfolder]: 956/2313 cut-off events. [2022-12-12 00:43:30,039 INFO L131 PetriNetUnfolder]: For 13012/13629 co-relation queries the response was YES. [2022-12-12 00:43:30,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9310 conditions, 2313 events. 956/2313 cut-off events. For 13012/13629 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 15602 event pairs, 125 based on Foata normal form. 90/2257 useless extension candidates. Maximal degree in co-relation 7062. Up to 1005 conditions per place. [2022-12-12 00:43:30,055 INFO L137 encePairwiseOnDemand]: 128/131 looper letters, 147 selfloop transitions, 2 changer transitions 0/381 dead transitions. [2022-12-12 00:43:30,055 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 381 transitions, 3606 flow [2022-12-12 00:43:30,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 00:43:30,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 00:43:30,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2022-12-12 00:43:30,056 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8905852417302799 [2022-12-12 00:43:30,057 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 70 predicate places. [2022-12-12 00:43:30,057 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 381 transitions, 3606 flow [2022-12-12 00:43:30,073 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 381 transitions, 3606 flow [2022-12-12 00:43:30,073 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 381 transitions, 3606 flow [2022-12-12 00:43:30,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 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 00:43:30,074 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:30,074 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:30,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 00:43:30,074 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:30,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:30,075 INFO L85 PathProgramCache]: Analyzing trace with hash 793504169, now seen corresponding path program 1 times [2022-12-12 00:43:30,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:30,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621144323] [2022-12-12 00:43:30,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:30,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:30,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:30,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 00:43:30,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:30,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621144323] [2022-12-12 00:43:30,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621144323] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:43:30,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195215862] [2022-12-12 00:43:30,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:30,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:30,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:30,229 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 00:43:30,233 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 00:43:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:30,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 11 conjunts are in the unsatisfiable core [2022-12-12 00:43:30,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:43:30,433 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 00:43:30,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:43:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 00:43:30,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1195215862] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:43:30,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:43:30,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 10 [2022-12-12 00:43:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853512003] [2022-12-12 00:43:30,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:43:30,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-12 00:43:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-12 00:43:30,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-12 00:43:30,613 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 131 [2022-12-12 00:43:30,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 381 transitions, 3606 flow. Second operand has 10 states, 10 states have (on average 100.8) internal successors, (1008), 10 states have internal predecessors, (1008), 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 00:43:30,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:30,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 131 [2022-12-12 00:43:30,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:31,632 INFO L130 PetriNetUnfolder]: 3192/6390 cut-off events. [2022-12-12 00:43:31,633 INFO L131 PetriNetUnfolder]: For 28827/29056 co-relation queries the response was YES. [2022-12-12 00:43:31,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29296 conditions, 6390 events. 3192/6390 cut-off events. For 28827/29056 co-relation queries the response was YES. Maximal size of possible extension queue 196. Compared 45811 event pairs, 158 based on Foata normal form. 19/6051 useless extension candidates. Maximal degree in co-relation 26150. Up to 2767 conditions per place. [2022-12-12 00:43:31,676 INFO L137 encePairwiseOnDemand]: 118/131 looper letters, 415 selfloop transitions, 134 changer transitions 8/742 dead transitions. [2022-12-12 00:43:31,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 742 transitions, 9346 flow [2022-12-12 00:43:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-12-12 00:43:31,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2022-12-12 00:43:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 2320 transitions. [2022-12-12 00:43:31,682 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8049965301873698 [2022-12-12 00:43:31,683 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 91 predicate places. [2022-12-12 00:43:31,683 INFO L82 GeneralOperation]: Start removeDead. Operand has 208 places, 742 transitions, 9346 flow [2022-12-12 00:43:31,713 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 208 places, 734 transitions, 9202 flow [2022-12-12 00:43:31,713 INFO L495 AbstractCegarLoop]: Abstraction has has 208 places, 734 transitions, 9202 flow [2022-12-12 00:43:31,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 100.8) internal successors, (1008), 10 states have internal predecessors, (1008), 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 00:43:31,714 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:31,714 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:31,722 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 00:43:31,919 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 00:43:31,919 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:31,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:31,920 INFO L85 PathProgramCache]: Analyzing trace with hash 194516949, now seen corresponding path program 2 times [2022-12-12 00:43:31,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:31,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537369149] [2022-12-12 00:43:31,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:31,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:31,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 00:43:32,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:32,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537369149] [2022-12-12 00:43:32,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537369149] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:43:32,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033017181] [2022-12-12 00:43:32,250 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 00:43:32,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:32,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:32,252 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 00:43:32,255 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 00:43:32,327 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 00:43:32,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 00:43:32,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-12 00:43:32,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:43:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:32,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:43:33,269 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:33,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033017181] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:43:33,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:43:33,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2022-12-12 00:43:33,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299785326] [2022-12-12 00:43:33,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:43:33,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-12-12 00:43:33,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:33,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-12-12 00:43:33,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2022-12-12 00:43:33,272 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 131 [2022-12-12 00:43:33,274 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 734 transitions, 9202 flow. Second operand has 30 states, 30 states have (on average 87.9) internal successors, (2637), 30 states have internal predecessors, (2637), 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 00:43:33,274 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:33,274 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 131 [2022-12-12 00:43:33,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:35,607 INFO L130 PetriNetUnfolder]: 5763/11806 cut-off events. [2022-12-12 00:43:35,607 INFO L131 PetriNetUnfolder]: For 67688/68188 co-relation queries the response was YES. [2022-12-12 00:43:35,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58746 conditions, 11806 events. 5763/11806 cut-off events. For 67688/68188 co-relation queries the response was YES. Maximal size of possible extension queue 355. Compared 94566 event pairs, 317 based on Foata normal form. 111/11166 useless extension candidates. Maximal degree in co-relation 57067. Up to 5142 conditions per place. [2022-12-12 00:43:35,746 INFO L137 encePairwiseOnDemand]: 115/131 looper letters, 719 selfloop transitions, 148 changer transitions 0/1045 dead transitions. [2022-12-12 00:43:35,746 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 1045 transitions, 15621 flow [2022-12-12 00:43:35,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-12-12 00:43:35,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2022-12-12 00:43:35,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1842 transitions. [2022-12-12 00:43:35,750 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7030534351145038 [2022-12-12 00:43:35,750 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 93 predicate places. [2022-12-12 00:43:35,751 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 1045 transitions, 15621 flow [2022-12-12 00:43:35,830 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 210 places, 1045 transitions, 15621 flow [2022-12-12 00:43:35,830 INFO L495 AbstractCegarLoop]: Abstraction has has 210 places, 1045 transitions, 15621 flow [2022-12-12 00:43:35,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 87.9) internal successors, (2637), 30 states have internal predecessors, (2637), 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 00:43:35,838 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:35,838 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:35,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-12 00:43:36,045 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 00:43:36,045 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:36,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:36,046 INFO L85 PathProgramCache]: Analyzing trace with hash 557686248, now seen corresponding path program 2 times [2022-12-12 00:43:36,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:36,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422636105] [2022-12-12 00:43:36,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:36,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:36,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 00:43:36,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:36,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422636105] [2022-12-12 00:43:36,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422636105] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:36,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:36,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 00:43:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621347292] [2022-12-12 00:43:36,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:36,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 00:43:36,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:36,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 00:43:36,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 00:43:36,194 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 131 [2022-12-12 00:43:36,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 1045 transitions, 15621 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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 00:43:36,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:36,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 131 [2022-12-12 00:43:36,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:38,987 INFO L130 PetriNetUnfolder]: 8016/16501 cut-off events. [2022-12-12 00:43:38,987 INFO L131 PetriNetUnfolder]: For 125786/127032 co-relation queries the response was YES. [2022-12-12 00:43:39,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90723 conditions, 16501 events. 8016/16501 cut-off events. For 125786/127032 co-relation queries the response was YES. Maximal size of possible extension queue 436. Compared 138120 event pairs, 494 based on Foata normal form. 21/15384 useless extension candidates. Maximal degree in co-relation 89621. Up to 7241 conditions per place. [2022-12-12 00:43:39,145 INFO L137 encePairwiseOnDemand]: 123/131 looper letters, 999 selfloop transitions, 208 changer transitions 40/1468 dead transitions. [2022-12-12 00:43:39,146 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 1468 transitions, 26111 flow [2022-12-12 00:43:39,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 00:43:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 00:43:39,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 771 transitions. [2022-12-12 00:43:39,147 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8407851690294439 [2022-12-12 00:43:39,148 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 98 predicate places. [2022-12-12 00:43:39,148 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 1468 transitions, 26111 flow [2022-12-12 00:43:39,221 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 1428 transitions, 25693 flow [2022-12-12 00:43:39,222 INFO L495 AbstractCegarLoop]: Abstraction has has 197 places, 1428 transitions, 25693 flow [2022-12-12 00:43:39,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 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 00:43:39,223 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:39,223 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:39,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-12 00:43:39,223 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:39,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:39,224 INFO L85 PathProgramCache]: Analyzing trace with hash 627454006, now seen corresponding path program 3 times [2022-12-12 00:43:39,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:39,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101361824] [2022-12-12 00:43:39,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:39,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-12-12 00:43:39,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:39,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101361824] [2022-12-12 00:43:39,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101361824] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 00:43:39,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 00:43:39,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 00:43:39,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623514428] [2022-12-12 00:43:39,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 00:43:39,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 00:43:39,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:39,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 00:43:39,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 00:43:39,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 131 [2022-12-12 00:43:39,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 1428 transitions, 25693 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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 00:43:39,368 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:39,368 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 131 [2022-12-12 00:43:39,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:43,789 INFO L130 PetriNetUnfolder]: 9012/20414 cut-off events. [2022-12-12 00:43:43,789 INFO L131 PetriNetUnfolder]: For 170421/171850 co-relation queries the response was YES. [2022-12-12 00:43:43,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110964 conditions, 20414 events. 9012/20414 cut-off events. For 170421/171850 co-relation queries the response was YES. Maximal size of possible extension queue 495. Compared 188777 event pairs, 684 based on Foata normal form. 27/19498 useless extension candidates. Maximal degree in co-relation 110157. Up to 8191 conditions per place. [2022-12-12 00:43:43,918 INFO L137 encePairwiseOnDemand]: 127/131 looper letters, 923 selfloop transitions, 33 changer transitions 0/1458 dead transitions. [2022-12-12 00:43:43,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 1458 transitions, 28250 flow [2022-12-12 00:43:43,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 00:43:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 00:43:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2022-12-12 00:43:43,932 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8759541984732825 [2022-12-12 00:43:43,932 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 83 predicate places. [2022-12-12 00:43:43,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 1458 transitions, 28250 flow [2022-12-12 00:43:44,021 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 1458 transitions, 28250 flow [2022-12-12 00:43:44,022 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 1458 transitions, 28250 flow [2022-12-12 00:43:44,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 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 00:43:44,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:43:44,022 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:43:44,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 00:43:44,023 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:43:44,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:43:44,023 INFO L85 PathProgramCache]: Analyzing trace with hash 1114568541, now seen corresponding path program 3 times [2022-12-12 00:43:44,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:43:44,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537390005] [2022-12-12 00:43:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:43:44,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:43:44,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:43:45,879 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:45,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:43:45,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537390005] [2022-12-12 00:43:45,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537390005] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:43:45,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481699562] [2022-12-12 00:43:45,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-12 00:43:45,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:43:45,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:43:45,884 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 00:43:45,885 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 00:43:46,046 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-12 00:43:46,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 00:43:46,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 82 conjunts are in the unsatisfiable core [2022-12-12 00:43:46,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:43:46,809 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 00:43:47,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 00:43:47,404 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 00:43:48,462 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:48,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 15 [2022-12-12 00:43:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:48,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:43:51,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:51,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2022-12-12 00:43:51,068 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:51,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 266 treesize of output 284 [2022-12-12 00:43:51,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:51,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 232 [2022-12-12 00:43:51,117 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:51,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 153 treesize of output 179 [2022-12-12 00:43:53,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:43:53,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 123 treesize of output 87 [2022-12-12 00:43:53,336 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 00:43:53,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 562 treesize of output 502 [2022-12-12 00:43:53,362 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 00:43:53,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 494 treesize of output 450 [2022-12-12 00:43:53,387 INFO L321 Elim1Store]: treesize reduction 44, result has 17.0 percent of original size [2022-12-12 00:43:53,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 442 treesize of output 346 [2022-12-12 00:43:53,512 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 00:43:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:43:54,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481699562] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:43:54,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:43:54,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 32] total 91 [2022-12-12 00:43:54,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536997050] [2022-12-12 00:43:54,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:43:54,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-12-12 00:43:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:43:54,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-12-12 00:43:54,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=7126, Unknown=32, NotChecked=0, Total=8190 [2022-12-12 00:43:54,339 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 131 [2022-12-12 00:43:54,342 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 1458 transitions, 28250 flow. Second operand has 91 states, 91 states have (on average 46.61538461538461) internal successors, (4242), 91 states have internal predecessors, (4242), 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 00:43:54,342 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:43:54,342 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 131 [2022-12-12 00:43:54,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:43:54,474 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (* c_~front~0 4))) (let ((.cse1 (+ c_~back~0 1)) (.cse14 (* c_~back~0 4)) (.cse30 (+ c_~queue~0.offset .cse13)) (.cse2 (select |c_#memory_int| c_~queue~0.base)) (.cse29 (+ c_~queue~0.offset .cse13 4))) (let ((.cse0 (let ((.cse34 (+ c_~sum~0 (select .cse2 .cse30) (select .cse2 .cse29)))) (and (<= .cse34 1) (<= 0 .cse34)))) (.cse5 (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse13 .cse14))) (.cse3 (+ c_~queue~0.offset .cse14 4)) (.cse27 (+ c_~queue~0.offset .cse14)) (.cse4 (<= c_~n~0 .cse1)) (.cse6 (< c_~back~0 0))) (and (or .cse0 (< .cse1 0) (not (= (+ (select .cse2 .cse3) 1) 0)) .cse4) (or .cse5 .cse4 (< 2 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse6) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 2) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse4 .cse6) (or (let ((.cse8 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse14 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse13 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse8) 1)) (not (= (+ (select .cse7 .cse9) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse10) (select .cse7 .cse11)) 1)))) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse12 .cse8) 1)) (not (= (+ (select .cse12 .cse9) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse12 .cse10) (select .cse12 .cse11)))))))) .cse4 .cse6) (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse5 .cse4 .cse6) (or (let ((.cse18 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse14)) (.cse19 (+ |c_ULTIMATE.start_main_#t~ret10#1.offset| .cse14 4)) (.cse16 (+ .cse13 |c_ULTIMATE.start_main_#t~ret10#1.offset| 4)) (.cse17 (+ .cse13 |c_ULTIMATE.start_main_#t~ret10#1.offset|))) (and (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse15 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (<= (+ c_~sum~0 (select .cse15 .cse16) (select .cse15 .cse17)) 1) (not (= (select .cse15 .cse18) 1)) (not (= 0 (+ (select .cse15 .cse19) 1)))))) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse20 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_main_#t~ret10#1.base|))) (or (not (= (select .cse20 .cse18) 1)) (not (= 0 (+ (select .cse20 .cse19) 1))) (<= 0 (+ c_~sum~0 (select .cse20 .cse16) (select .cse20 .cse17)))))))) .cse4 .cse6) (or .cse4 .cse6 (let ((.cse24 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse25 (+ .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse22 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 4)) (.cse23 (+ .cse14 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse21 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (not (= (+ (select .cse21 .cse22) 1) 0)) (not (= 1 (select .cse21 .cse23))) (<= 0 (+ (select .cse21 .cse24) c_~sum~0 (select .cse21 .cse25)))))) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse26 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (<= (+ (select .cse26 .cse24) c_~sum~0 (select .cse26 .cse25)) 1) (not (= (+ (select .cse26 .cse22) 1) 0)) (not (= 1 (select .cse26 .cse23))))))))) (or .cse0 (<= c_~n~0 c_~back~0) .cse6 (not (= (+ (select .cse2 .cse27) 1) 0))) (or .cse5 .cse4 .cse6 (< (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~i~0#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (and (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse28 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) c_~queue~0.base))) (or (not (= (+ (select .cse28 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse28 .cse29) (select .cse28 .cse30)) 1) (not (= (select .cse28 .cse27) 1))))) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse31 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) c_~queue~0.base))) (or (not (= (+ (select .cse31 .cse3) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse31 .cse29) (select .cse31 .cse30))) (not (= (select .cse31 .cse27) 1)))))) .cse4 .cse6) (or (and (forall ((v_ArrVal_206 (Array Int Int))) (let ((.cse32 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) c_~queue~0.base))) (or (not (= (+ (select .cse32 .cse3) 1) 0)) (<= (+ c_~sum~0 (select .cse32 .cse29) (select .cse32 .cse30)) 1) (not (= (select .cse32 .cse27) 1))))) (forall ((v_ArrVal_206 (Array Int Int))) (let ((.cse33 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) c_~queue~0.base))) (or (<= 0 (+ c_~sum~0 (select .cse33 .cse29) (select .cse33 .cse30))) (not (= (+ (select .cse33 .cse3) 1) 0)) (not (= (select .cse33 .cse27) 1)))))) .cse4 .cse6) (= c_~sum~0 0))))) is different from false [2022-12-12 00:44:06,960 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_int| c_~queue~0.base)) (.cse2 (* c_~front~0 4))) (let ((.cse1 (select .cse13 (+ c_~queue~0.offset .cse2)))) (let ((.cse3 (* c_~back~0 4)) (.cse4 (<= c_~n~0 (+ c_~back~0 1))) (.cse5 (< c_~back~0 0)) (.cse6 (select .cse13 (+ c_~queue~0.offset .cse2 (- 4)))) (.cse0 (+ c_~sum~0 .cse1 c_~element~0))) (and (<= 0 .cse0) (= (+ .cse1 1) 0) (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and (<= 0 c_~sum~0) (<= c_~sum~0 1) (= .cse2 .cse3)) .cse4 .cse5) (= c_~sum~0 .cse6) (or (let ((.cse8 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse9 (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse2 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse7 .cse8) 1)) (not (= (+ (select .cse7 .cse9) 1) 0)) (<= (+ c_~sum~0 (select .cse7 .cse10) (select .cse7 .cse11)) 1)))) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse12 .cse8) 1)) (not (= (+ (select .cse12 .cse9) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse12 .cse10) (select .cse12 .cse11)))))))) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse5) (= c_~queue~0.offset 0) (= .cse6 1) (<= .cse0 1) (<= c_~front~0 1) (<= 1 c_~front~0))))) is different from false [2022-12-12 00:44:14,296 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (* c_~front~0 4)) (.cse3 (* c_~back~0 4)) (.cse4 (<= c_~n~0 (+ c_~back~0 1))) (.cse5 (< c_~back~0 0)) (.cse0 (<= 0 c_~sum~0)) (.cse1 (<= c_~sum~0 1))) (and (or (< 2 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (and .cse0 .cse1 (= .cse2 .cse3)) .cse4 .cse5) (let ((.cse7 (select |c_#memory_int| c_~queue~0.base))) (or (let ((.cse6 (+ c_~sum~0 (select .cse7 (+ c_~queue~0.offset .cse2)) (select .cse7 (+ c_~queue~0.offset .cse2 4))))) (and (<= .cse6 1) (<= 0 .cse6))) (not (= (+ (select .cse7 (+ c_~queue~0.offset .cse3)) 1) 0)))) (or (let ((.cse9 (+ .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ .cse3 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse11 (+ .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse12 (+ .cse2 4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse8 .cse9) 1)) (not (= (+ (select .cse8 .cse10) 1) 0)) (<= (+ c_~sum~0 (select .cse8 .cse11) (select .cse8 .cse12)) 1)))) (forall ((v_ArrVal_205 (Array Int Int)) (v_ArrVal_206 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_205) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_206) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (not (= (select .cse13 .cse9) 1)) (not (= (+ (select .cse13 .cse10) 1) 0)) (<= 0 (+ c_~sum~0 (select .cse13 .cse11) (select .cse13 .cse12)))))))) (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post18#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse4 .cse5) .cse0 .cse1)) is different from false [2022-12-12 00:44:34,052 INFO L130 PetriNetUnfolder]: 28258/61570 cut-off events. [2022-12-12 00:44:34,052 INFO L131 PetriNetUnfolder]: For 569119/573956 co-relation queries the response was YES. [2022-12-12 00:44:34,208 INFO L83 FinitePrefix]: Finished finitePrefix Result has 387320 conditions, 61570 events. 28258/61570 cut-off events. For 569119/573956 co-relation queries the response was YES. Maximal size of possible extension queue 1607. Compared 675808 event pairs, 1403 based on Foata normal form. 586/59590 useless extension candidates. Maximal degree in co-relation 240839. Up to 26312 conditions per place. [2022-12-12 00:44:34,476 INFO L137 encePairwiseOnDemand]: 94/131 looper letters, 3244 selfloop transitions, 2166 changer transitions 210/5726 dead transitions. [2022-12-12 00:44:34,477 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 5726 transitions, 120264 flow [2022-12-12 00:44:34,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2022-12-12 00:44:34,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2022-12-12 00:44:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 8355 transitions. [2022-12-12 00:44:34,488 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3751683879658734 [2022-12-12 00:44:34,488 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 252 predicate places. [2022-12-12 00:44:34,488 INFO L82 GeneralOperation]: Start removeDead. Operand has 369 places, 5726 transitions, 120264 flow [2022-12-12 00:44:34,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 365 places, 5516 transitions, 114640 flow [2022-12-12 00:44:34,793 INFO L495 AbstractCegarLoop]: Abstraction has has 365 places, 5516 transitions, 114640 flow [2022-12-12 00:44:34,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 46.61538461538461) internal successors, (4242), 91 states have internal predecessors, (4242), 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 00:44:34,795 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:44:34,795 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:44:34,801 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 00:44:35,000 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,SelfDestructingSolverStorable11 [2022-12-12 00:44:35,000 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:44:35,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:44:35,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1312494915, now seen corresponding path program 4 times [2022-12-12 00:44:35,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:44:35,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256989933] [2022-12-12 00:44:35,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:44:35,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:44:35,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:44:35,816 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-12 00:44:35,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:44:35,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256989933] [2022-12-12 00:44:35,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256989933] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:44:35,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710524359] [2022-12-12 00:44:35,816 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-12 00:44:35,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:44:35,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:44:35,826 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 00:44:35,828 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 00:44:35,912 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-12 00:44:35,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 00:44:35,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-12 00:44:35,917 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:44:37,193 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:44:37,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 15 [2022-12-12 00:44:37,267 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:44:37,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:44:37,958 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:44:37,958 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 77 treesize of output 78 [2022-12-12 00:44:39,352 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:44:39,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710524359] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:44:39,353 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:44:39,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 28, 28] total 63 [2022-12-12 00:44:39,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384647752] [2022-12-12 00:44:39,353 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:44:39,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-12-12 00:44:39,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:44:39,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-12-12 00:44:39,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=3406, Unknown=0, NotChecked=0, Total=3906 [2022-12-12 00:44:39,358 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 131 [2022-12-12 00:44:39,362 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 365 places, 5516 transitions, 114640 flow. Second operand has 63 states, 63 states have (on average 61.23809523809524) internal successors, (3858), 63 states have internal predecessors, (3858), 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 00:44:39,362 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:44:39,362 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 131 [2022-12-12 00:44:39,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 00:46:47,790 INFO L130 PetriNetUnfolder]: 65003/142297 cut-off events. [2022-12-12 00:46:47,791 INFO L131 PetriNetUnfolder]: For 1417572/1429113 co-relation queries the response was YES. [2022-12-12 00:46:48,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 983646 conditions, 142297 events. 65003/142297 cut-off events. For 1417572/1429113 co-relation queries the response was YES. Maximal size of possible extension queue 3818. Compared 1762931 event pairs, 2859 based on Foata normal form. 1478/138080 useless extension candidates. Maximal degree in co-relation 750506. Up to 60698 conditions per place. [2022-12-12 00:46:49,257 INFO L137 encePairwiseOnDemand]: 102/131 looper letters, 10797 selfloop transitions, 4142 changer transitions 348/15406 dead transitions. [2022-12-12 00:46:49,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 646 places, 15406 transitions, 344441 flow [2022-12-12 00:46:49,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 282 states. [2022-12-12 00:46:49,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2022-12-12 00:46:49,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 17841 transitions. [2022-12-12 00:46:49,308 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.48294624005197334 [2022-12-12 00:46:49,309 INFO L295 CegarLoopForPetriNet]: 117 programPoint places, 529 predicate places. [2022-12-12 00:46:49,310 INFO L82 GeneralOperation]: Start removeDead. Operand has 646 places, 15406 transitions, 344441 flow [2022-12-12 00:46:50,343 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 636 places, 15058 transitions, 334899 flow [2022-12-12 00:46:50,343 INFO L495 AbstractCegarLoop]: Abstraction has has 636 places, 15058 transitions, 334899 flow [2022-12-12 00:46:50,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 61.23809523809524) internal successors, (3858), 63 states have internal predecessors, (3858), 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 00:46:50,344 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 00:46:50,344 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:46:50,350 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 00:46:50,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:46:50,550 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 00:46:50,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 00:46:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash 506823237, now seen corresponding path program 5 times [2022-12-12 00:46:50,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 00:46:50,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165571277] [2022-12-12 00:46:50,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 00:46:50,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 00:46:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 00:46:51,283 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-12-12 00:46:51,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 00:46:51,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165571277] [2022-12-12 00:46:51,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165571277] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 00:46:51,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1377239154] [2022-12-12 00:46:51,283 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-12 00:46:51,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:46:51,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 00:46:51,285 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 00:46:51,287 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 00:46:51,379 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-12-12 00:46:51,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 00:46:51,381 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 69 conjunts are in the unsatisfiable core [2022-12-12 00:46:51,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 00:46:53,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 00:46:53,047 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 00:46:53,051 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:46:53,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 21 [2022-12-12 00:46:53,142 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:46:53,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 00:46:53,998 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 00:46:53,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 76 [2022-12-12 00:46:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 00:46:55,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1377239154] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 00:46:55,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 00:46:55,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 34, 28] total 70 [2022-12-12 00:46:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173220589] [2022-12-12 00:46:55,406 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 00:46:55,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-12 00:46:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 00:46:55,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-12 00:46:55,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=571, Invalid=4259, Unknown=0, NotChecked=0, Total=4830 [2022-12-12 00:46:55,410 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 131 [2022-12-12 00:46:55,412 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 636 places, 15058 transitions, 334899 flow. Second operand has 70 states, 70 states have (on average 54.22857142857143) internal successors, (3796), 70 states have internal predecessors, (3796), 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 00:46:55,412 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 00:46:55,412 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 131 [2022-12-12 00:46:55,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2022-12-12 00:56:44,596 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 00:56:44,596 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 00:56:45,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 296 states. [2022-12-12 00:56:45,190 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 00:56:45,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-12 00:56:45,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 00:56:45,392 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (70states, 51/131 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 1436537 conditions, 185525 events (85978/185524 cut-off events. For 2092687/2111264 co-relation queries the response was YES. Maximal size of possible extension queue 5032. Compared 2404346 event pairs, 3847 based on Foata normal form. 1751/182489 useless extension candidates. Maximal degree in co-relation 1158023. Up to 82134 conditions per place.). [2022-12-12 00:56:45,393 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 00:56:45,393 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 00:56:45,393 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 1, 1, 1, 1] [2022-12-12 00:56:45,397 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 00:56:45,397 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 00:56:45,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 12:56:45 BasicIcfg [2022-12-12 00:56:45,401 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 00:56:45,401 INFO L158 Benchmark]: Toolchain (without parser) took 825687.59ms. Allocated memory was 226.5MB in the beginning and 3.3GB in the end (delta: 3.0GB). Free memory was 202.0MB in the beginning and 948.2MB in the end (delta: -746.2MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-12 00:56:45,401 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 226.5MB. Free memory was 202.3MB in the beginning and 202.1MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 00:56:45,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.93ms. Allocated memory is still 226.5MB. Free memory was 202.0MB in the beginning and 188.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-12 00:56:45,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.52ms. Allocated memory is still 226.5MB. Free memory was 188.7MB in the beginning and 186.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 00:56:45,405 INFO L158 Benchmark]: Boogie Preprocessor took 40.17ms. Allocated memory is still 226.5MB. Free memory was 186.6MB in the beginning and 185.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 00:56:45,405 INFO L158 Benchmark]: RCFGBuilder took 384.18ms. Allocated memory is still 226.5MB. Free memory was 185.1MB in the beginning and 165.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-12-12 00:56:45,406 INFO L158 Benchmark]: TraceAbstraction took 825025.16ms. Allocated memory was 226.5MB in the beginning and 3.3GB in the end (delta: 3.0GB). Free memory was 164.1MB in the beginning and 948.2MB in the end (delta: -784.1MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. [2022-12-12 00:56:45,407 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.11ms. Allocated memory is still 226.5MB. Free memory was 202.3MB in the beginning and 202.1MB in the end (delta: 152.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.93ms. Allocated memory is still 226.5MB. Free memory was 202.0MB in the beginning and 188.7MB in the end (delta: 13.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.52ms. Allocated memory is still 226.5MB. Free memory was 188.7MB in the beginning and 186.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.17ms. Allocated memory is still 226.5MB. Free memory was 186.6MB in the beginning and 185.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 384.18ms. Allocated memory is still 226.5MB. Free memory was 185.1MB in the beginning and 165.1MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 825025.16ms. Allocated memory was 226.5MB in the beginning and 3.3GB in the end (delta: 3.0GB). Free memory was 164.1MB in the beginning and 948.2MB in the end (delta: -784.1MB). Peak memory consumption was 3.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 105]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (70states, 51/131 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 1436537 conditions, 185525 events (85978/185524 cut-off events. For 2092687/2111264 co-relation queries the response was YES. Maximal size of possible extension queue 5032. Compared 2404346 event pairs, 3847 based on Foata normal form. 1751/182489 useless extension candidates. Maximal degree in co-relation 1158023. Up to 82134 conditions per place.). - TimeoutResultAtElement [Line: 99]: 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 (70states, 51/131 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 1436537 conditions, 185525 events (85978/185524 cut-off events. For 2092687/2111264 co-relation queries the response was YES. Maximal size of possible extension queue 5032. Compared 2404346 event pairs, 3847 based on Foata normal form. 1751/182489 useless extension candidates. Maximal degree in co-relation 1158023. Up to 82134 conditions per place.). - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (70states, 51/131 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 1436537 conditions, 185525 events (85978/185524 cut-off events. For 2092687/2111264 co-relation queries the response was YES. Maximal size of possible extension queue 5032. Compared 2404346 event pairs, 3847 based on Foata normal form. 1751/182489 useless extension candidates. Maximal degree in co-relation 1158023. Up to 82134 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 156 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 1.7s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 824.9s, OverallIterations: 14, TraceHistogramMax: 2, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 794.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 82 mSolverCounterUnknown, 8786 SdHoareTripleChecker+Valid, 17.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8786 mSDsluCounter, 7482 SdHoareTripleChecker+Invalid, 15.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 7 IncrementalHoareTripleChecker+Unchecked, 7125 mSDsCounter, 894 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26301 IncrementalHoareTripleChecker+Invalid, 27284 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 894 mSolverCounterUnsat, 357 mSDtfsCounter, 26301 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2617 GetRequests, 1465 SyntacticMatches, 17 SemanticMatches, 1135 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 126101 ImplicationChecksByTransitivity, 86.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=334899occurred in iteration=13, InterpolantAutomatonStates: 599, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 13 MinimizatonAttempts, 16529 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 25.5s InterpolantComputationTime, 2393 NumberOfCodeBlocks, 2373 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 3205 ConstructedInterpolants, 45 QuantifiedInterpolants, 36800 SizeOfPredicates, 170 NumberOfNonLiveVariables, 1879 ConjunctsInSsa, 306 ConjunctsInUnsatCore, 28 InterpolantComputations, 7 PerfectInterpolantSequences, 123/415 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