/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 -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-8d0d62b [2022-12-06 17:41:09,811 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-06 17:41:09,813 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-06 17:41:09,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-06 17:41:09,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-06 17:41:09,849 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-06 17:41:09,851 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-06 17:41:09,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-06 17:41:09,858 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-06 17:41:09,862 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-06 17:41:09,862 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-06 17:41:09,864 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-06 17:41:09,864 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-06 17:41:09,866 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-06 17:41:09,867 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-06 17:41:09,869 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-06 17:41:09,869 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-06 17:41:09,870 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-06 17:41:09,872 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-06 17:41:09,875 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-06 17:41:09,876 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-06 17:41:09,877 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-06 17:41:09,878 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-06 17:41:09,879 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-06 17:41:09,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-06 17:41:09,884 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-06 17:41:09,884 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-06 17:41:09,886 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-06 17:41:09,886 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-06 17:41:09,886 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-06 17:41:09,887 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-06 17:41:09,892 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-06 17:41:09,893 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-06 17:41:09,893 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-06 17:41:09,894 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-06 17:41:09,894 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-06 17:41:09,894 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-06 17:41:09,894 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-06 17:41:09,895 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-06 17:41:09,895 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-06 17:41:09,896 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-06 17:41:09,896 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-06 17:41:09,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-06 17:41:09,922 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-06 17:41:09,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-06 17:41:09,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-06 17:41:09,924 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-06 17:41:09,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-06 17:41:09,924 INFO L138 SettingsManager]: * Use SBE=true [2022-12-06 17:41:09,924 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-06 17:41:09,924 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-06 17:41:09,934 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-06 17:41:09,935 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-06 17:41:09,935 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-06 17:41:09,935 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-06 17:41:09,935 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-06 17:41:09,936 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-06 17:41:09,936 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-06 17:41:09,936 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-06 17:41:09,936 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-06 17:41:09,936 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-06 17:41:09,936 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-06 17:41:09,936 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-06 17:41:09,936 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-06 17:41:09,936 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-06 17:41:09,936 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:41:09,937 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-06 17:41:09,937 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-06 17:41:09,937 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-06 17:41:09,937 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-06 17:41:09,937 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-06 17:41:09,937 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-06 17:41:09,937 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-06 17:41:09,937 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true [2022-12-06 17:41:10,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-06 17:41:10,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-06 17:41:10,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-06 17:41:10,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-06 17:41:10,232 INFO L275 PluginConnector]: CDTParser initialized [2022-12-06 17:41:10,233 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 17:41:11,252 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-06 17:41:11,466 INFO L351 CDTParser]: Found 1 translation units. [2022-12-06 17:41:11,467 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 17:41:11,473 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ccf95aa/1b9f613ead074076b28f16873019e488/FLAGf7eb8f83d [2022-12-06 17:41:11,488 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63ccf95aa/1b9f613ead074076b28f16873019e488 [2022-12-06 17:41:11,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-06 17:41:11,491 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-06 17:41:11,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-06 17:41:11,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-06 17:41:11,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-06 17:41:11,495 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b1ac79f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11, skipping insertion in model container [2022-12-06 17:41:11,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,500 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-06 17:41:11,520 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-06 17:41:11,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,643 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,646 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,649 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,650 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,651 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,652 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,653 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,654 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,655 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,656 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,659 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,669 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-06 17:41:11,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:41:11,683 INFO L203 MainTranslator]: Completed pre-run [2022-12-06 17:41:11,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,692 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,693 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,697 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-06 17:41:11,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-06 17:41:11,704 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-bad-buffer-mult-alt2.wvr.c[4174,4187] [2022-12-06 17:41:11,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-06 17:41:11,721 INFO L208 MainTranslator]: Completed translation [2022-12-06 17:41:11,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11 WrapperNode [2022-12-06 17:41:11,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-06 17:41:11,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-06 17:41:11,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-06 17:41:11,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-06 17:41:11,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,759 INFO L138 Inliner]: procedures = 26, calls = 75, calls flagged for inlining = 17, calls inlined = 21, statements flattened = 315 [2022-12-06 17:41:11,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-06 17:41:11,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-06 17:41:11,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-06 17:41:11,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-06 17:41:11,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,781 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-06 17:41:11,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-06 17:41:11,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-06 17:41:11,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-06 17:41:11,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (1/1) ... [2022-12-06 17:41:11,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-06 17:41:11,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:41:11,816 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-06 17:41:11,836 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-06 17:41:11,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-06 17:41:11,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-06 17:41:11,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-06 17:41:11,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-06 17:41:11,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-06 17:41:11,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-06 17:41:11,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-06 17:41:11,855 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-06 17:41:11,855 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-06 17:41:11,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-06 17:41:11,856 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2022-12-06 17:41:11,856 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2022-12-06 17:41:11,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-06 17:41:11,856 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-06 17:41:11,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-06 17:41:11,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-06 17:41:11,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-06 17:41:11,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-06 17:41:11,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-06 17:41:11,858 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-06 17:41:12,001 INFO L236 CfgBuilder]: Building ICFG [2022-12-06 17:41:12,002 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-06 17:41:12,340 INFO L277 CfgBuilder]: Performing block encoding [2022-12-06 17:41:12,487 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-06 17:41:12,487 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2022-12-06 17:41:12,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:41:12 BoogieIcfgContainer [2022-12-06 17:41:12,489 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-06 17:41:12,490 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-06 17:41:12,490 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-06 17:41:12,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-06 17:41:12,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 05:41:11" (1/3) ... [2022-12-06 17:41:12,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5265c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:41:12, skipping insertion in model container [2022-12-06 17:41:12,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 05:41:11" (2/3) ... [2022-12-06 17:41:12,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c5265c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 05:41:12, skipping insertion in model container [2022-12-06 17:41:12,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 05:41:12" (3/3) ... [2022-12-06 17:41:12,508 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt2.wvr.c [2022-12-06 17:41:12,520 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-06 17:41:12,520 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-06 17:41:12,520 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-06 17:41:12,587 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2022-12-06 17:41:12,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 17:41:12,703 INFO L130 PetriNetUnfolder]: 19/222 cut-off events. [2022-12-06 17:41:12,703 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 17:41:12,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239 conditions, 222 events. 19/222 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 107 event pairs, 0 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 185. Up to 2 conditions per place. [2022-12-06 17:41:12,709 INFO L82 GeneralOperation]: Start removeDead. Operand has 220 places, 226 transitions, 484 flow [2022-12-06 17:41:12,719 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 210 transitions, 444 flow [2022-12-06 17:41:12,733 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-06 17:41:12,739 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;@469b0c1a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-06 17:41:12,740 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-12-06 17:41:12,776 INFO L130 PetriNetUnfolder]: 19/209 cut-off events. [2022-12-06 17:41:12,777 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2022-12-06 17:41:12,777 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:12,778 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:12,779 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:12,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:12,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1911713322, now seen corresponding path program 1 times [2022-12-06 17:41:12,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:12,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573232391] [2022-12-06 17:41:12,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:12,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:13,836 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-06 17:41:13,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:13,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573232391] [2022-12-06 17:41:13,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573232391] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:13,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:13,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-06 17:41:13,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961946598] [2022-12-06 17:41:13,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:13,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-06 17:41:13,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:13,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-06 17:41:13,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-06 17:41:13,872 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 226 [2022-12-06 17:41:13,878 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 210 transitions, 444 flow. Second operand has 8 states, 8 states have (on average 161.25) internal successors, (1290), 8 states have internal predecessors, (1290), 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-06 17:41:13,878 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:13,879 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 226 [2022-12-06 17:41:13,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:14,327 INFO L130 PetriNetUnfolder]: 417/970 cut-off events. [2022-12-06 17:41:14,330 INFO L131 PetriNetUnfolder]: For 145/145 co-relation queries the response was YES. [2022-12-06 17:41:14,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1748 conditions, 970 events. 417/970 cut-off events. For 145/145 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 4346 event pairs, 71 based on Foata normal form. 250/1107 useless extension candidates. Maximal degree in co-relation 1362. Up to 385 conditions per place. [2022-12-06 17:41:14,344 INFO L137 encePairwiseOnDemand]: 200/226 looper letters, 61 selfloop transitions, 6 changer transitions 7/215 dead transitions. [2022-12-06 17:41:14,344 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 215 transitions, 620 flow [2022-12-06 17:41:14,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 17:41:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 17:41:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1499 transitions. [2022-12-06 17:41:14,359 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7369714847590954 [2022-12-06 17:41:14,363 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 8 predicate places. [2022-12-06 17:41:14,363 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 215 transitions, 620 flow [2022-12-06 17:41:14,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 161.25) internal successors, (1290), 8 states have internal predecessors, (1290), 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-06 17:41:14,364 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:14,364 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:14,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-06 17:41:14,365 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:14,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:14,366 INFO L85 PathProgramCache]: Analyzing trace with hash -830477053, now seen corresponding path program 1 times [2022-12-06 17:41:14,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:14,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785630081] [2022-12-06 17:41:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:14,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:14,814 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-06 17:41:14,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:14,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785630081] [2022-12-06 17:41:14,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785630081] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:14,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:14,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:14,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958784532] [2022-12-06 17:41:14,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:14,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:14,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:14,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:14,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:14,818 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 226 [2022-12-06 17:41:14,819 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 215 transitions, 620 flow. Second operand has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:14,820 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:14,820 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 226 [2022-12-06 17:41:14,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:15,206 INFO L130 PetriNetUnfolder]: 900/1944 cut-off events. [2022-12-06 17:41:15,207 INFO L131 PetriNetUnfolder]: For 867/1992 co-relation queries the response was YES. [2022-12-06 17:41:15,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4654 conditions, 1944 events. 900/1944 cut-off events. For 867/1992 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 11402 event pairs, 81 based on Foata normal form. 23/1723 useless extension candidates. Maximal degree in co-relation 3840. Up to 831 conditions per place. [2022-12-06 17:41:15,223 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 84 selfloop transitions, 16 changer transitions 7/273 dead transitions. [2022-12-06 17:41:15,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 273 transitions, 1083 flow [2022-12-06 17:41:15,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-06 17:41:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-06 17:41:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1387 transitions. [2022-12-06 17:41:15,226 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8767383059418458 [2022-12-06 17:41:15,227 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 14 predicate places. [2022-12-06 17:41:15,227 INFO L495 AbstractCegarLoop]: Abstraction has has 218 places, 273 transitions, 1083 flow [2022-12-06 17:41:15,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:15,227 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:15,227 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:15,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-06 17:41:15,228 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1576633893, now seen corresponding path program 2 times [2022-12-06 17:41:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068313457] [2022-12-06 17:41:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:15,580 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-06 17:41:15,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:15,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068313457] [2022-12-06 17:41:15,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068313457] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:15,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:15,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-06 17:41:15,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12957249] [2022-12-06 17:41:15,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:15,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-06 17:41:15,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:15,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-06 17:41:15,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-06 17:41:15,585 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 226 [2022-12-06 17:41:15,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 273 transitions, 1083 flow. Second operand has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 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-06 17:41:15,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:15,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 226 [2022-12-06 17:41:15,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:16,157 INFO L130 PetriNetUnfolder]: 2025/3600 cut-off events. [2022-12-06 17:41:16,157 INFO L131 PetriNetUnfolder]: For 3619/8273 co-relation queries the response was YES. [2022-12-06 17:41:16,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12157 conditions, 3600 events. 2025/3600 cut-off events. For 3619/8273 co-relation queries the response was YES. Maximal size of possible extension queue 231. Compared 22040 event pairs, 140 based on Foata normal form. 146/3394 useless extension candidates. Maximal degree in co-relation 9806. Up to 2215 conditions per place. [2022-12-06 17:41:16,190 INFO L137 encePairwiseOnDemand]: 213/226 looper letters, 215 selfloop transitions, 36 changer transitions 8/399 dead transitions. [2022-12-06 17:41:16,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 399 transitions, 2417 flow [2022-12-06 17:41:16,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 17:41:16,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 17:41:16,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1468 transitions. [2022-12-06 17:41:16,193 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.7217305801376598 [2022-12-06 17:41:16,194 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 22 predicate places. [2022-12-06 17:41:16,194 INFO L495 AbstractCegarLoop]: Abstraction has has 226 places, 399 transitions, 2417 flow [2022-12-06 17:41:16,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 158.85714285714286) internal successors, (1112), 7 states have internal predecessors, (1112), 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-06 17:41:16,195 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:16,195 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:16,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-06 17:41:16,195 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:16,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1268109261, now seen corresponding path program 3 times [2022-12-06 17:41:16,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:16,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323040945] [2022-12-06 17:41:16,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:16,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:16,597 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-06 17:41:16,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:16,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323040945] [2022-12-06 17:41:16,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323040945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:16,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:16,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:16,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79081201] [2022-12-06 17:41:16,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:16,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:16,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:16,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:16,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:16,603 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 226 [2022-12-06 17:41:16,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 399 transitions, 2417 flow. Second operand has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:16,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:16,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 226 [2022-12-06 17:41:16,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:17,403 INFO L130 PetriNetUnfolder]: 2814/5020 cut-off events. [2022-12-06 17:41:17,403 INFO L131 PetriNetUnfolder]: For 7668/27070 co-relation queries the response was YES. [2022-12-06 17:41:17,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20578 conditions, 5020 events. 2814/5020 cut-off events. For 7668/27070 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 33361 event pairs, 43 based on Foata normal form. 571/5175 useless extension candidates. Maximal degree in co-relation 16592. Up to 3037 conditions per place. [2022-12-06 17:41:17,507 INFO L137 encePairwiseOnDemand]: 218/226 looper letters, 318 selfloop transitions, 62 changer transitions 8/558 dead transitions. [2022-12-06 17:41:17,507 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 558 transitions, 4530 flow [2022-12-06 17:41:17,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:41:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:41:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1197 transitions. [2022-12-06 17:41:17,514 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8827433628318584 [2022-12-06 17:41:17,516 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 27 predicate places. [2022-12-06 17:41:17,516 INFO L495 AbstractCegarLoop]: Abstraction has has 231 places, 558 transitions, 4530 flow [2022-12-06 17:41:17,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:17,516 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:17,517 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:17,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-06 17:41:17,517 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:17,518 INFO L85 PathProgramCache]: Analyzing trace with hash -146914117, now seen corresponding path program 4 times [2022-12-06 17:41:17,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:17,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734611909] [2022-12-06 17:41:17,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:17,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:17,811 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-06 17:41:17,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:17,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734611909] [2022-12-06 17:41:17,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734611909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:17,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:17,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:17,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426439983] [2022-12-06 17:41:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:17,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:17,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:17,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:17,813 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 226 [2022-12-06 17:41:17,814 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 558 transitions, 4530 flow. Second operand has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:17,814 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:17,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 226 [2022-12-06 17:41:17,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:18,721 INFO L130 PetriNetUnfolder]: 2880/5611 cut-off events. [2022-12-06 17:41:18,721 INFO L131 PetriNetUnfolder]: For 11817/32609 co-relation queries the response was YES. [2022-12-06 17:41:18,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25506 conditions, 5611 events. 2880/5611 cut-off events. For 11817/32609 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 40680 event pairs, 76 based on Foata normal form. 435/5548 useless extension candidates. Maximal degree in co-relation 20472. Up to 3135 conditions per place. [2022-12-06 17:41:18,779 INFO L137 encePairwiseOnDemand]: 221/226 looper letters, 458 selfloop transitions, 22 changer transitions 14/664 dead transitions. [2022-12-06 17:41:18,779 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 664 transitions, 6666 flow [2022-12-06 17:41:18,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 17:41:18,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 17:41:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 993 transitions. [2022-12-06 17:41:18,781 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8787610619469026 [2022-12-06 17:41:18,782 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 31 predicate places. [2022-12-06 17:41:18,782 INFO L495 AbstractCegarLoop]: Abstraction has has 235 places, 664 transitions, 6666 flow [2022-12-06 17:41:18,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:18,782 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:18,783 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:18,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-06 17:41:18,783 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:18,783 INFO L85 PathProgramCache]: Analyzing trace with hash -11654399, now seen corresponding path program 5 times [2022-12-06 17:41:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:18,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107600937] [2022-12-06 17:41:18,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:18,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:19,128 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-06 17:41:19,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:19,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107600937] [2022-12-06 17:41:19,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107600937] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:19,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:19,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:19,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933028578] [2022-12-06 17:41:19,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:19,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:19,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:19,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:19,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:19,131 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 226 [2022-12-06 17:41:19,132 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 664 transitions, 6666 flow. Second operand has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:19,132 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:19,132 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 226 [2022-12-06 17:41:19,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:20,203 INFO L130 PetriNetUnfolder]: 3506/6809 cut-off events. [2022-12-06 17:41:20,203 INFO L131 PetriNetUnfolder]: For 23906/136658 co-relation queries the response was YES. [2022-12-06 17:41:20,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35551 conditions, 6809 events. 3506/6809 cut-off events. For 23906/136658 co-relation queries the response was YES. Maximal size of possible extension queue 393. Compared 51977 event pairs, 80 based on Foata normal form. 1237/7467 useless extension candidates. Maximal degree in co-relation 30601. Up to 4040 conditions per place. [2022-12-06 17:41:20,271 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 464 selfloop transitions, 96 changer transitions 11/741 dead transitions. [2022-12-06 17:41:20,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 741 transitions, 8748 flow [2022-12-06 17:41:20,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:41:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:41:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1196 transitions. [2022-12-06 17:41:20,276 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8820058997050148 [2022-12-06 17:41:20,278 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 36 predicate places. [2022-12-06 17:41:20,278 INFO L495 AbstractCegarLoop]: Abstraction has has 240 places, 741 transitions, 8748 flow [2022-12-06 17:41:20,279 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:20,279 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:20,279 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:20,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-06 17:41:20,279 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:20,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1014067103, now seen corresponding path program 6 times [2022-12-06 17:41:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:20,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591950971] [2022-12-06 17:41:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:20,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:20,672 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-06 17:41:20,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:20,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591950971] [2022-12-06 17:41:20,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591950971] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:20,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:20,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:20,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401221584] [2022-12-06 17:41:20,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:20,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:20,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:20,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:20,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:20,678 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 226 [2022-12-06 17:41:20,679 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 741 transitions, 8748 flow. Second operand has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:20,679 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:20,679 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 226 [2022-12-06 17:41:20,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:22,074 INFO L130 PetriNetUnfolder]: 4203/7967 cut-off events. [2022-12-06 17:41:22,074 INFO L131 PetriNetUnfolder]: For 34876/92177 co-relation queries the response was YES. [2022-12-06 17:41:22,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48136 conditions, 7967 events. 4203/7967 cut-off events. For 34876/92177 co-relation queries the response was YES. Maximal size of possible extension queue 486. Compared 61681 event pairs, 88 based on Foata normal form. 1407/8721 useless extension candidates. Maximal degree in co-relation 38816. Up to 4902 conditions per place. [2022-12-06 17:41:22,176 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 611 selfloop transitions, 53 changer transitions 18/852 dead transitions. [2022-12-06 17:41:22,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 852 transitions, 11711 flow [2022-12-06 17:41:22,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-06 17:41:22,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-06 17:41:22,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 999 transitions. [2022-12-06 17:41:22,178 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8840707964601769 [2022-12-06 17:41:22,179 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 40 predicate places. [2022-12-06 17:41:22,179 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 852 transitions, 11711 flow [2022-12-06 17:41:22,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:22,180 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:22,180 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:22,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-06 17:41:22,180 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:22,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:22,180 INFO L85 PathProgramCache]: Analyzing trace with hash 812493213, now seen corresponding path program 7 times [2022-12-06 17:41:22,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:22,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734778249] [2022-12-06 17:41:22,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:22,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:22,558 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-06 17:41:22,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:22,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734778249] [2022-12-06 17:41:22,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734778249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:22,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:22,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-06 17:41:22,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539583711] [2022-12-06 17:41:22,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:22,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-06 17:41:22,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:22,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-06 17:41:22,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-06 17:41:22,560 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 226 [2022-12-06 17:41:22,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 852 transitions, 11711 flow. Second operand has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:22,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:22,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 226 [2022-12-06 17:41:22,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:24,418 INFO L130 PetriNetUnfolder]: 5663/10226 cut-off events. [2022-12-06 17:41:24,418 INFO L131 PetriNetUnfolder]: For 57200/207365 co-relation queries the response was YES. [2022-12-06 17:41:24,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71211 conditions, 10226 events. 5663/10226 cut-off events. For 57200/207365 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 79110 event pairs, 108 based on Foata normal form. 2081/11545 useless extension candidates. Maximal degree in co-relation 65612. Up to 7017 conditions per place. [2022-12-06 17:41:24,525 INFO L137 encePairwiseOnDemand]: 219/226 looper letters, 699 selfloop transitions, 111 changer transitions 20/996 dead transitions. [2022-12-06 17:41:24,526 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 996 transitions, 15792 flow [2022-12-06 17:41:24,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-06 17:41:24,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-06 17:41:24,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1196 transitions. [2022-12-06 17:41:24,528 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8820058997050148 [2022-12-06 17:41:24,528 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 45 predicate places. [2022-12-06 17:41:24,528 INFO L495 AbstractCegarLoop]: Abstraction has has 249 places, 996 transitions, 15792 flow [2022-12-06 17:41:24,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 191.8) internal successors, (959), 5 states have internal predecessors, (959), 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-06 17:41:24,529 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:24,529 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:24,529 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-06 17:41:24,529 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash -805530908, now seen corresponding path program 1 times [2022-12-06 17:41:24,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:24,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709815538] [2022-12-06 17:41:24,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:24,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-06 17:41:24,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:24,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709815538] [2022-12-06 17:41:24,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [709815538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-06 17:41:24,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-06 17:41:24,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-06 17:41:24,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682658520] [2022-12-06 17:41:24,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-06 17:41:24,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-06 17:41:24,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:24,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-06 17:41:24,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-06 17:41:24,640 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 226 [2022-12-06 17:41:24,641 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 996 transitions, 15792 flow. Second operand has 6 states, 6 states have (on average 178.66666666666666) internal successors, (1072), 6 states have internal predecessors, (1072), 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-06 17:41:24,641 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:24,641 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 226 [2022-12-06 17:41:24,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:26,736 INFO L130 PetriNetUnfolder]: 5612/10522 cut-off events. [2022-12-06 17:41:26,736 INFO L131 PetriNetUnfolder]: For 85574/166737 co-relation queries the response was YES. [2022-12-06 17:41:26,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76813 conditions, 10522 events. 5612/10522 cut-off events. For 85574/166737 co-relation queries the response was YES. Maximal size of possible extension queue 598. Compared 82588 event pairs, 121 based on Foata normal form. 507/10225 useless extension candidates. Maximal degree in co-relation 58318. Up to 6944 conditions per place. [2022-12-06 17:41:26,873 INFO L137 encePairwiseOnDemand]: 215/226 looper letters, 602 selfloop transitions, 8 changer transitions 76/1059 dead transitions. [2022-12-06 17:41:26,873 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 1059 transitions, 18078 flow [2022-12-06 17:41:26,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-06 17:41:26,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-06 17:41:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1629 transitions. [2022-12-06 17:41:26,877 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.8008849557522124 [2022-12-06 17:41:26,878 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 53 predicate places. [2022-12-06 17:41:26,878 INFO L495 AbstractCegarLoop]: Abstraction has has 257 places, 1059 transitions, 18078 flow [2022-12-06 17:41:26,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 178.66666666666666) internal successors, (1072), 6 states have internal predecessors, (1072), 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-06 17:41:26,879 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:41:26,880 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:41:26,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-06 17:41:26,880 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:41:26,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:41:26,880 INFO L85 PathProgramCache]: Analyzing trace with hash 2013348405, now seen corresponding path program 1 times [2022-12-06 17:41:26,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:41:26,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692135066] [2022-12-06 17:41:26,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:26,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:41:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:28,447 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-06 17:41:28,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:41:28,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692135066] [2022-12-06 17:41:28,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692135066] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:41:28,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809127745] [2022-12-06 17:41:28,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:41:28,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:41:28,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:41:28,451 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-06 17:41:28,455 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-06 17:41:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:41:28,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-06 17:41:28,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:41:29,332 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-06 17:41:30,250 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-06 17:41:30,373 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-06 17:41:30,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 17:41:30,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 17:41:30,730 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 25 treesize of output 7 [2022-12-06 17:41:30,959 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-06 17:41:30,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:41:32,008 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (~q1_back~0 Int) (v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_228)) (.cse1 (+ (* ~q1_back~0 4) c_~q1~0.offset))) (or (<= c_~n1~0 ~q1_back~0) (< 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_229) c_~q1~0.base) .cse1) c_~total~0)) (< ~q1_back~0 0) (<= (select (select .cse0 c_~q1~0.base) .cse1) 0)))) is different from false [2022-12-06 17:41:32,354 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (~q1_back~0 Int) (v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_228)) (.cse1 (+ (* ~q1_back~0 4) |c_ULTIMATE.start_main_#t~ret24#1.offset|))) (or (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret24#1.base|) .cse1) 0) (<= c_~n1~0 ~q1_back~0) (< 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_main_#t~ret24#1.base|) .cse1) c_~total~0)) (< ~q1_back~0 0)))) is different from false [2022-12-06 17:41:32,369 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (~q1_back~0 Int) (v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_228)) (.cse1 (+ (* ~q1_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= c_~n1~0 ~q1_back~0) (< 0 (+ c_~total~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1))) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1) 0) (< ~q1_back~0 0)))) is different from false [2022-12-06 17:41:32,396 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_227 (Array Int Int)) (~q1_back~0 Int) (v_ArrVal_229 (Array Int Int)) (v_ArrVal_228 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_227) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_228)) (.cse1 (+ (* ~q1_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= c_~n1~0 ~q1_back~0) (< 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_229) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~total~0)) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 0) (< ~q1_back~0 0)))) is different from false [2022-12-06 17:41:32,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:41:32,661 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 64 treesize of output 52 [2022-12-06 17:41:32,666 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 475 treesize of output 443 [2022-12-06 17:41:32,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 314 treesize of output 266 [2022-12-06 17:41:32,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 395 treesize of output 371 [2022-12-06 17:41:32,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 371 treesize of output 323 [2022-12-06 17:41:33,489 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-06 17:41:33,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809127745] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-06 17:41:33,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-06 17:41:33,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 30, 30] total 73 [2022-12-06 17:41:33,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413182857] [2022-12-06 17:41:33,490 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-06 17:41:33,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-12-06 17:41:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-06 17:41:33,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-12-06 17:41:33,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=394, Invalid=4299, Unknown=15, NotChecked=548, Total=5256 [2022-12-06 17:41:33,496 INFO L490 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 226 [2022-12-06 17:41:33,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 1059 transitions, 18078 flow. Second operand has 73 states, 73 states have (on average 84.05479452054794) internal successors, (6136), 73 states have internal predecessors, (6136), 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-06 17:41:33,502 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-06 17:41:33,502 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 226 [2022-12-06 17:41:33,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-06 17:41:48,258 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-06 17:42:44,245 INFO L130 PetriNetUnfolder]: 156018/258987 cut-off events. [2022-12-06 17:42:44,246 INFO L131 PetriNetUnfolder]: For 1981463/2070420 co-relation queries the response was YES. [2022-12-06 17:42:45,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1687669 conditions, 258987 events. 156018/258987 cut-off events. For 1981463/2070420 co-relation queries the response was YES. Maximal size of possible extension queue 11195. Compared 2718551 event pairs, 7080 based on Foata normal form. 4204/244962 useless extension candidates. Maximal degree in co-relation 1112852. Up to 137292 conditions per place. [2022-12-06 17:42:47,320 INFO L137 encePairwiseOnDemand]: 167/226 looper letters, 5978 selfloop transitions, 3700 changer transitions 448/10221 dead transitions. [2022-12-06 17:42:47,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 10221 transitions, 213112 flow [2022-12-06 17:42:47,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2022-12-06 17:42:47,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2022-12-06 17:42:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 13502 transitions. [2022-12-06 17:42:47,381 INFO L535 CegarLoopForPetriNet]: DFA transition density 0.3904794956330615 [2022-12-06 17:42:47,382 INFO L294 CegarLoopForPetriNet]: 204 programPoint places, 205 predicate places. [2022-12-06 17:42:47,382 INFO L495 AbstractCegarLoop]: Abstraction has has 409 places, 10221 transitions, 213112 flow [2022-12-06 17:42:47,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 84.05479452054794) internal successors, (6136), 73 states have internal predecessors, (6136), 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-06 17:42:47,385 INFO L205 CegarLoopForPetriNet]: Found error trace [2022-12-06 17:42:47,385 INFO L213 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 17:42:47,393 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-06 17:42:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-06 17:42:47,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2022-12-06 17:42:47,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-06 17:42:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash 246475449, now seen corresponding path program 2 times [2022-12-06 17:42:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-06 17:42:47,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538331433] [2022-12-06 17:42:47,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-06 17:42:47,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-06 17:42:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-06 17:42:50,212 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-06 17:42:50,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-06 17:42:50,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538331433] [2022-12-06 17:42:50,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538331433] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-06 17:42:50,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130685223] [2022-12-06 17:42:50,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-06 17:42:50,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-06 17:42:50,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-06 17:42:50,216 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-06 17:42:50,218 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-06 17:42:50,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-06 17:42:50,401 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-06 17:42:50,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 57 conjunts are in the unsatisfiable core [2022-12-06 17:42:50,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-06 17:42:51,194 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-06 17:42:52,233 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-06 17:42:52,378 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-06 17:42:52,519 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-06 17:42:52,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-06 17:42:52,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-06 17:42:53,023 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-06 17:42:53,040 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-06 17:42:53,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-06 17:42:54,749 WARN L837 $PredicateComparison]: unable to prove that (forall ((~q1_back~0 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_278)) (.cse1 (+ (* ~q1_back~0 4) |c_ULTIMATE.start_main_#t~ret24#1.offset|))) (or (<= c_~n1~0 ~q1_back~0) (< 0 (+ c_~total~0 (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_main_#t~ret24#1.base|) .cse1))) (<= (select (select .cse0 |c_ULTIMATE.start_main_#t~ret24#1.base|) .cse1) 0) (< ~q1_back~0 0)))) is different from false [2022-12-06 17:42:54,775 WARN L837 $PredicateComparison]: unable to prove that (forall ((~q1_back~0 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_278)) (.cse1 (+ (* ~q1_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (<= c_~n1~0 ~q1_back~0) (< 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1) c_~total~0)) (< ~q1_back~0 0) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse1) 0)))) is different from false [2022-12-06 17:42:54,807 WARN L837 $PredicateComparison]: unable to prove that (forall ((~q1_back~0 Int) (v_ArrVal_276 (Array Int Int)) (v_ArrVal_278 (Array Int Int)) (v_ArrVal_277 (Array Int Int)) (v_ArrVal_279 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_276) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_277) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_278)) (.cse1 (+ (* ~q1_back~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (<= c_~n1~0 ~q1_back~0) (< 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_279) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) c_~total~0)) (< ~q1_back~0 0) (<= (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse1) 0)))) is different from false [2022-12-06 17:42:55,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-06 17:42:55,150 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 70 treesize of output 58 [2022-12-06 17:42:55,172 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 3299 treesize of output 3203 [2022-12-06 17:42:55,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 3203 treesize of output 3131 [2022-12-06 17:42:55,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2582 treesize of output 2198 [2022-12-06 17:42:55,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1375 treesize of output 1231 [2022-12-06 17:42:55,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2603 treesize of output 2315 Received shutdown request... [2022-12-06 17:54:47,877 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-12-06 17:54:47,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-06 17:54:47,922 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-06 17:54:47,922 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-06 17:54:48,082 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,SelfDestructingSolverStorable10 [2022-12-06 17:54:48,082 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 178 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-16-2-2-3-4-3-5-4-3-2-2-2-2-2-1 context. [2022-12-06 17:54:48,084 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2022-12-06 17:54:48,084 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2022-12-06 17:54:48,084 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2022-12-06 17:54:48,084 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2022-12-06 17:54:48,084 INFO L458 BasicCegarLoop]: Path program histogram: [7, 2, 1, 1] [2022-12-06 17:54:48,087 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-06 17:54:48,087 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-06 17:54:48,090 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 05:54:48 BasicIcfg [2022-12-06 17:54:48,090 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-06 17:54:48,090 INFO L158 Benchmark]: Toolchain (without parser) took 816599.52ms. Allocated memory was 197.1MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 173.3MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. [2022-12-06 17:54:48,090 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 174.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-06 17:54:48,090 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.81ms. Allocated memory is still 197.1MB. Free memory was 173.0MB in the beginning and 157.6MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2022-12-06 17:54:48,091 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.84ms. Allocated memory is still 197.1MB. Free memory was 157.6MB in the beginning and 154.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 17:54:48,091 INFO L158 Benchmark]: Boogie Preprocessor took 24.47ms. Allocated memory is still 197.1MB. Free memory was 154.9MB in the beginning and 152.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-06 17:54:48,091 INFO L158 Benchmark]: RCFGBuilder took 703.98ms. Allocated memory is still 197.1MB. Free memory was 152.8MB in the beginning and 168.0MB in the end (delta: -15.2MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. [2022-12-06 17:54:48,091 INFO L158 Benchmark]: TraceAbstraction took 815599.46ms. Allocated memory was 197.1MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 167.5MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. [2022-12-06 17:54:48,092 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 174.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 229.81ms. Allocated memory is still 197.1MB. Free memory was 173.0MB in the beginning and 157.6MB in the end (delta: 15.4MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 36.84ms. Allocated memory is still 197.1MB. Free memory was 157.6MB in the beginning and 154.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.47ms. Allocated memory is still 197.1MB. Free memory was 154.9MB in the beginning and 152.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 703.98ms. Allocated memory is still 197.1MB. Free memory was 152.8MB in the beginning and 168.0MB in the end (delta: -15.2MB). Peak memory consumption was 45.5MB. Max. memory is 8.0GB. * TraceAbstraction took 815599.46ms. Allocated memory was 197.1MB in the beginning and 6.8GB in the end (delta: 6.6GB). Free memory was 167.5MB in the beginning and 1.8GB in the end (delta: -1.6GB). Peak memory consumption was 6.1GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 150]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 178 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-16-2-2-3-4-3-5-4-3-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 141]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 178 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-16-2-2-3-4-3-5-4-3-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 140]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 178 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-16-2-2-3-4-3-5-4-3-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 142]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 178 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-16-2-2-3-4-3-5-4-3-2-2-2-2-2-1 context. - TimeoutResultAtElement [Line: 143]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while CegarLoopForPetriNet was analyzing trace of length 178 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ATOM-1 term,while PolyPacSimplificationTermWalker was simplifying 3 xjuncts wrt. a ∧-16-2-2-3-4-3-5-4-3-2-2-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 240 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 815.5s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 84.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 39 mSolverCounterUnknown, 5170 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5170 mSDsluCounter, 3648 SdHoareTripleChecker+Invalid, 6.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1414 IncrementalHoareTripleChecker+Unchecked, 3380 mSDsCounter, 478 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6301 IncrementalHoareTripleChecker+Invalid, 8232 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 478 mSolverCounterUnsat, 268 mSDtfsCounter, 6301 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 595 GetRequests, 323 SyntacticMatches, 5 SemanticMatches, 267 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 14361 ImplicationChecksByTransitivity, 19.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213112occurred in iteration=10, InterpolantAutomatonStates: 215, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.4s InterpolantComputationTime, 1857 NumberOfCodeBlocks, 1857 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 2022 ConstructedInterpolants, 58 QuantifiedInterpolants, 14064 SizeOfPredicates, 52 NumberOfNonLiveVariables, 469 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 9/18 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