/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-horseshoe.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-11 22:04:56,699 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-11 22:04:56,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-11 22:04:56,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-11 22:04:56,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-11 22:04:56,725 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-11 22:04:56,726 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-11 22:04:56,728 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-11 22:04:56,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-11 22:04:56,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-11 22:04:56,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-11 22:04:56,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-11 22:04:56,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-11 22:04:56,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-11 22:04:56,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-11 22:04:56,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-11 22:04:56,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-11 22:04:56,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-11 22:04:56,738 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-11 22:04:56,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-11 22:04:56,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-11 22:04:56,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-11 22:04:56,743 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-11 22:04:56,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-11 22:04:56,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-11 22:04:56,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-11 22:04:56,748 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-11 22:04:56,748 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-11 22:04:56,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-11 22:04:56,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-11 22:04:56,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-11 22:04:56,750 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-11 22:04:56,751 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-11 22:04:56,752 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-11 22:04:56,752 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-11 22:04:56,753 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-11 22:04:56,753 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-11 22:04:56,753 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-11 22:04:56,754 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-11 22:04:56,754 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-11 22:04:56,755 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-11 22:04:56,756 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-11 22:04:56,775 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-11 22:04:56,775 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-11 22:04:56,776 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-11 22:04:56,776 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-11 22:04:56,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-11 22:04:56,777 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-11 22:04:56,777 INFO L138 SettingsManager]: * Use SBE=true [2022-12-11 22:04:56,777 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-11 22:04:56,777 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-11 22:04:56,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-11 22:04:56,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-11 22:04:56,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-11 22:04:56,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-11 22:04:56,778 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-11 22:04:56,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-11 22:04:56,779 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-11 22:04:56,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-11 22:04:56,779 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-11 22:04:56,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-11 22:04:56,780 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-11 22:04:56,780 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-11 22:04:56,780 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-11 22:04:56,780 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-11 22:04:56,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:04:56,781 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-11 22:04:56,781 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-11 22:04:56,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-11 22:04:56,781 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-11 22:04:56,782 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-11 22:04:56,782 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-11 22:04:56,782 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-11 22:04:56,782 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-11 22:04:57,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-11 22:04:57,140 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-11 22:04:57,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-11 22:04:57,144 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-11 22:04:57,145 INFO L275 PluginConnector]: CDTParser initialized [2022-12-11 22:04:57,146 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-11 22:04:58,238 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-11 22:04:58,383 INFO L351 CDTParser]: Found 1 translation units. [2022-12-11 22:04:58,384 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-horseshoe.wvr.c [2022-12-11 22:04:58,389 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80340088/34a0e06a3c10490db7bbf40bdaced0bb/FLAGca1667caf [2022-12-11 22:04:58,400 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e80340088/34a0e06a3c10490db7bbf40bdaced0bb [2022-12-11 22:04:58,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-11 22:04:58,403 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-11 22:04:58,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-11 22:04:58,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-11 22:04:58,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-11 22:04:58,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e598748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58, skipping insertion in model container [2022-12-11 22:04:58,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,413 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-11 22:04:58,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-11 22:04:58,583 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,588 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,601 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-horseshoe.wvr.c[3424,3437] [2022-12-11 22:04:58,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:04:58,622 INFO L203 MainTranslator]: Completed pre-run [2022-12-11 22:04:58,635 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,637 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,638 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,639 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,640 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-11 22:04:58,642 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-11 22:04:58,648 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-horseshoe.wvr.c[3424,3437] [2022-12-11 22:04:58,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-11 22:04:58,666 INFO L208 MainTranslator]: Completed translation [2022-12-11 22:04:58,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58 WrapperNode [2022-12-11 22:04:58,667 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-11 22:04:58,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-11 22:04:58,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-11 22:04:58,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-11 22:04:58,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,700 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,737 INFO L138 Inliner]: procedures = 25, calls = 55, calls flagged for inlining = 16, calls inlined = 18, statements flattened = 245 [2022-12-11 22:04:58,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-11 22:04:58,740 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-11 22:04:58,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-11 22:04:58,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-11 22:04:58,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,762 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,790 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,791 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-11 22:04:58,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-11 22:04:58,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-11 22:04:58,795 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-11 22:04:58,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (1/1) ... [2022-12-11 22:04:58,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-11 22:04:58,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:04:58,827 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-11 22:04:58,849 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-11 22:04:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-11 22:04:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-11 22:04:58,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-11 22:04:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-11 22:04:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-11 22:04:58,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-11 22:04:58,868 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-11 22:04:58,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-11 22:04:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-12-11 22:04:58,869 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-12-11 22:04:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-11 22:04:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-11 22:04:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-11 22:04:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-11 22:04:58,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-11 22:04:58,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-11 22:04:58,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-11 22:04:58,871 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-11 22:04:59,024 INFO L236 CfgBuilder]: Building ICFG [2022-12-11 22:04:59,026 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-11 22:04:59,395 INFO L277 CfgBuilder]: Performing block encoding [2022-12-11 22:04:59,585 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-11 22:04:59,585 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2022-12-11 22:04:59,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:04:59 BoogieIcfgContainer [2022-12-11 22:04:59,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-11 22:04:59,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-11 22:04:59,590 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-11 22:04:59,607 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-11 22:04:59,608 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.12 10:04:58" (1/3) ... [2022-12-11 22:04:59,608 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b654c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:04:59, skipping insertion in model container [2022-12-11 22:04:59,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.12 10:04:58" (2/3) ... [2022-12-11 22:04:59,609 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b654c7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.12 10:04:59, skipping insertion in model container [2022-12-11 22:04:59,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.12 10:04:59" (3/3) ... [2022-12-11 22:04:59,610 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-horseshoe.wvr.c [2022-12-11 22:04:59,632 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-11 22:04:59,632 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-11 22:04:59,632 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-11 22:04:59,722 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-12-11 22:04:59,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 194 transitions, 412 flow [2022-12-11 22:04:59,871 INFO L130 PetriNetUnfolder]: 18/191 cut-off events. [2022-12-11 22:04:59,871 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 22:04:59,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 191 events. 18/191 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 111 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 155. Up to 3 conditions per place. [2022-12-11 22:04:59,878 INFO L82 GeneralOperation]: Start removeDead. Operand has 186 places, 194 transitions, 412 flow [2022-12-11 22:04:59,886 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 181 transitions, 380 flow [2022-12-11 22:04:59,901 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-11 22:04:59,908 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;@2b5efd91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-11 22:04:59,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-11 22:04:59,962 INFO L130 PetriNetUnfolder]: 18/180 cut-off events. [2022-12-11 22:04:59,962 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-12-11 22:04:59,963 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:04:59,963 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:04:59,964 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 1 more)] === [2022-12-11 22:04:59,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:04:59,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1272589224, now seen corresponding path program 1 times [2022-12-11 22:04:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:04:59,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010331157] [2022-12-11 22:04:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:04:59,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:00,340 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-11 22:05:00,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:00,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010331157] [2022-12-11 22:05:00,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010331157] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:05:00,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:05:00,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-11 22:05:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196440388] [2022-12-11 22:05:00,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:05:00,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-11 22:05:00,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-11 22:05:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-11 22:05:00,391 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 194 [2022-12-11 22:05:00,396 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 181 transitions, 380 flow. Second operand has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 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-11 22:05:00,396 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:00,396 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 194 [2022-12-11 22:05:00,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:00,505 INFO L130 PetriNetUnfolder]: 71/354 cut-off events. [2022-12-11 22:05:00,506 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-11 22:05:00,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 499 conditions, 354 events. 71/354 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1024 event pairs, 38 based on Foata normal form. 60/377 useless extension candidates. Maximal degree in co-relation 331. Up to 106 conditions per place. [2022-12-11 22:05:00,514 INFO L137 encePairwiseOnDemand]: 181/194 looper letters, 11 selfloop transitions, 0 changer transitions 6/168 dead transitions. [2022-12-11 22:05:00,514 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 174 places, 168 transitions, 376 flow [2022-12-11 22:05:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-11 22:05:00,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-11 22:05:00,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 362 transitions. [2022-12-11 22:05:00,531 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.9329896907216495 [2022-12-11 22:05:00,535 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 1 predicate places. [2022-12-11 22:05:00,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 174 places, 168 transitions, 376 flow [2022-12-11 22:05:00,539 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 162 transitions, 364 flow [2022-12-11 22:05:00,540 INFO L495 AbstractCegarLoop]: Abstraction has has 168 places, 162 transitions, 364 flow [2022-12-11 22:05:00,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 173.5) internal successors, (347), 2 states have internal predecessors, (347), 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-11 22:05:00,541 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:00,541 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:05:00,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-11 22:05:00,542 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 1 more)] === [2022-12-11 22:05:00,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1759950902, now seen corresponding path program 1 times [2022-12-11 22:05:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:00,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986633412] [2022-12-11 22:05:00,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:00,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:01,030 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-11 22:05:01,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:01,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986633412] [2022-12-11 22:05:01,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986633412] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:05:01,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:05:01,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 22:05:01,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436176761] [2022-12-11 22:05:01,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:05:01,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 22:05:01,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:01,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 22:05:01,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-11 22:05:01,035 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 194 [2022-12-11 22:05:01,036 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 162 transitions, 364 flow. Second operand has 6 states, 6 states have (on average 147.66666666666666) internal successors, (886), 6 states have internal predecessors, (886), 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-11 22:05:01,037 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:01,037 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 194 [2022-12-11 22:05:01,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:01,256 INFO L130 PetriNetUnfolder]: 73/430 cut-off events. [2022-12-11 22:05:01,256 INFO L131 PetriNetUnfolder]: For 114/152 co-relation queries the response was YES. [2022-12-11 22:05:01,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 430 events. 73/430 cut-off events. For 114/152 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1265 event pairs, 38 based on Foata normal form. 11/406 useless extension candidates. Maximal degree in co-relation 426. Up to 118 conditions per place. [2022-12-11 22:05:01,261 INFO L137 encePairwiseOnDemand]: 182/194 looper letters, 33 selfloop transitions, 8 changer transitions 17/183 dead transitions. [2022-12-11 22:05:01,261 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 183 transitions, 539 flow [2022-12-11 22:05:01,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-11 22:05:01,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-11 22:05:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2022-12-11 22:05:01,266 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7720504009163803 [2022-12-11 22:05:01,267 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 3 predicate places. [2022-12-11 22:05:01,267 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 183 transitions, 539 flow [2022-12-11 22:05:01,272 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 174 places, 166 transitions, 454 flow [2022-12-11 22:05:01,273 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 454 flow [2022-12-11 22:05:01,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 147.66666666666666) internal successors, (886), 6 states have internal predecessors, (886), 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-11 22:05:01,274 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:01,274 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:05:01,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-11 22:05:01,275 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 1 more)] === [2022-12-11 22:05:01,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 311725784, now seen corresponding path program 1 times [2022-12-11 22:05:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:01,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795531690] [2022-12-11 22:05:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:01,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:01,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:05:01,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:01,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795531690] [2022-12-11 22:05:01,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795531690] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:05:01,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:05:01,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-11 22:05:01,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263728451] [2022-12-11 22:05:01,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:05:01,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-11 22:05:01,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:01,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-11 22:05:01,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-11 22:05:01,594 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 143 out of 194 [2022-12-11 22:05:01,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 454 flow. Second operand has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:05:01,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:01,596 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 143 of 194 [2022-12-11 22:05:01,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:01,772 INFO L130 PetriNetUnfolder]: 92/460 cut-off events. [2022-12-11 22:05:01,773 INFO L131 PetriNetUnfolder]: For 323/443 co-relation queries the response was YES. [2022-12-11 22:05:01,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 460 events. 92/460 cut-off events. For 323/443 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1570 event pairs, 50 based on Foata normal form. 15/432 useless extension candidates. Maximal degree in co-relation 521. Up to 160 conditions per place. [2022-12-11 22:05:01,776 INFO L137 encePairwiseOnDemand]: 185/194 looper letters, 39 selfloop transitions, 6 changer transitions 8/178 dead transitions. [2022-12-11 22:05:01,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 178 transitions, 634 flow [2022-12-11 22:05:01,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-11 22:05:01,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-11 22:05:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1052 transitions. [2022-12-11 22:05:01,779 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7746686303387335 [2022-12-11 22:05:01,781 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 7 predicate places. [2022-12-11 22:05:01,781 INFO L82 GeneralOperation]: Start removeDead. Operand has 180 places, 178 transitions, 634 flow [2022-12-11 22:05:01,784 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 179 places, 170 transitions, 560 flow [2022-12-11 22:05:01,784 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 170 transitions, 560 flow [2022-12-11 22:05:01,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-11 22:05:01,785 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:01,785 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:05:01,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-11 22:05:01,785 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 1 more)] === [2022-12-11 22:05:01,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1070200846, now seen corresponding path program 1 times [2022-12-11 22:05:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:01,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499960663] [2022-12-11 22:05:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:01,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:05:02,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:02,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499960663] [2022-12-11 22:05:02,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499960663] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:05:02,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-11 22:05:02,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-11 22:05:02,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557701907] [2022-12-11 22:05:02,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:05:02,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-11 22:05:02,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:02,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-11 22:05:02,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-11 22:05:02,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2022-12-11 22:05:02,089 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 170 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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-11 22:05:02,089 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:02,089 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2022-12-11 22:05:02,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:02,157 INFO L130 PetriNetUnfolder]: 82/391 cut-off events. [2022-12-11 22:05:02,157 INFO L131 PetriNetUnfolder]: For 372/480 co-relation queries the response was YES. [2022-12-11 22:05:02,159 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 391 events. 82/391 cut-off events. For 372/480 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1147 event pairs, 17 based on Foata normal form. 8/369 useless extension candidates. Maximal degree in co-relation 708. Up to 138 conditions per place. [2022-12-11 22:05:02,161 INFO L137 encePairwiseOnDemand]: 191/194 looper letters, 19 selfloop transitions, 2 changer transitions 0/176 dead transitions. [2022-12-11 22:05:02,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 176 transitions, 656 flow [2022-12-11 22:05:02,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-11 22:05:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-11 22:05:02,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 517 transitions. [2022-12-11 22:05:02,163 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8883161512027491 [2022-12-11 22:05:02,163 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 8 predicate places. [2022-12-11 22:05:02,163 INFO L82 GeneralOperation]: Start removeDead. Operand has 181 places, 176 transitions, 656 flow [2022-12-11 22:05:02,166 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 181 places, 176 transitions, 656 flow [2022-12-11 22:05:02,167 INFO L495 AbstractCegarLoop]: Abstraction has has 181 places, 176 transitions, 656 flow [2022-12-11 22:05:02,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.66666666666666) internal successors, (509), 3 states have internal predecessors, (509), 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-11 22:05:02,167 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:02,167 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:05:02,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-11 22:05:02,168 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 1 more)] === [2022-12-11 22:05:02,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:02,168 INFO L85 PathProgramCache]: Analyzing trace with hash 890909556, now seen corresponding path program 2 times [2022-12-11 22:05:02,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:02,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580210825] [2022-12-11 22:05:02,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:02,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:02,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:05:06,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:06,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580210825] [2022-12-11 22:05:06,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580210825] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:05:06,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297368962] [2022-12-11 22:05:06,537 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:05:06,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:06,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:05:06,540 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-11 22:05:06,585 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-11 22:05:06,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-11 22:05:06,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:05:06,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-11 22:05:06,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:05:08,810 INFO L321 Elim1Store]: treesize reduction 81, result has 22.9 percent of original size [2022-12-11 22:05:08,811 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 38 [2022-12-11 22:05:08,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:05:08,927 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 22:05:08,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297368962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:05:08,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 22:05:08,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [38] total 44 [2022-12-11 22:05:08,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245878290] [2022-12-11 22:05:08,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:05:08,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 22:05:08,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:08,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 22:05:08,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1709, Unknown=0, NotChecked=0, Total=1892 [2022-12-11 22:05:08,932 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 194 [2022-12-11 22:05:08,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 176 transitions, 656 flow. Second operand has 14 states, 14 states have (on average 111.57142857142857) internal successors, (1562), 14 states have internal predecessors, (1562), 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-11 22:05:08,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:08,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 194 [2022-12-11 22:05:08,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:09,811 INFO L130 PetriNetUnfolder]: 1114/2312 cut-off events. [2022-12-11 22:05:09,811 INFO L131 PetriNetUnfolder]: For 6062/6358 co-relation queries the response was YES. [2022-12-11 22:05:09,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7209 conditions, 2312 events. 1114/2312 cut-off events. For 6062/6358 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 13979 event pairs, 90 based on Foata normal form. 7/2115 useless extension candidates. Maximal degree in co-relation 6435. Up to 731 conditions per place. [2022-12-11 22:05:09,832 INFO L137 encePairwiseOnDemand]: 177/194 looper letters, 155 selfloop transitions, 20 changer transitions 4/280 dead transitions. [2022-12-11 22:05:09,832 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 280 transitions, 1613 flow [2022-12-11 22:05:09,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 22:05:09,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 22:05:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1565 transitions. [2022-12-11 22:05:09,836 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6205392545598731 [2022-12-11 22:05:09,837 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 20 predicate places. [2022-12-11 22:05:09,837 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 280 transitions, 1613 flow [2022-12-11 22:05:09,852 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 191 places, 276 transitions, 1586 flow [2022-12-11 22:05:09,852 INFO L495 AbstractCegarLoop]: Abstraction has has 191 places, 276 transitions, 1586 flow [2022-12-11 22:05:09,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 111.57142857142857) internal successors, (1562), 14 states have internal predecessors, (1562), 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-11 22:05:09,853 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:09,854 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:05:09,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-11 22:05:10,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:10,060 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 1 more)] === [2022-12-11 22:05:10,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:10,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1243372686, now seen corresponding path program 3 times [2022-12-11 22:05:10,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:10,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410475029] [2022-12-11 22:05:10,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:10,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:05:13,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:13,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410475029] [2022-12-11 22:05:13,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410475029] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:05:13,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056739419] [2022-12-11 22:05:13,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 22:05:13,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:13,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:05:13,296 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-11 22:05:13,319 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-11 22:05:13,432 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-11 22:05:13,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:05:13,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 35 conjunts are in the unsatisfiable core [2022-12-11 22:05:13,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:05:14,876 INFO L321 Elim1Store]: treesize reduction 78, result has 25.7 percent of original size [2022-12-11 22:05:14,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 47 treesize of output 41 [2022-12-11 22:05:15,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:05:15,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 22:05:15,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056739419] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:05:15,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 22:05:15,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [37] total 44 [2022-12-11 22:05:15,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535326368] [2022-12-11 22:05:15,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:05:15,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-12-11 22:05:15,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-12-11 22:05:15,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1718, Unknown=0, NotChecked=0, Total=1892 [2022-12-11 22:05:15,110 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 194 [2022-12-11 22:05:15,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 276 transitions, 1586 flow. Second operand has 15 states, 15 states have (on average 111.26666666666667) internal successors, (1669), 15 states have internal predecessors, (1669), 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-11 22:05:15,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:15,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 194 [2022-12-11 22:05:15,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:15,998 INFO L130 PetriNetUnfolder]: 1311/2758 cut-off events. [2022-12-11 22:05:15,999 INFO L131 PetriNetUnfolder]: For 8359/8901 co-relation queries the response was YES. [2022-12-11 22:05:16,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10466 conditions, 2758 events. 1311/2758 cut-off events. For 8359/8901 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 17782 event pairs, 148 based on Foata normal form. 19/2522 useless extension candidates. Maximal degree in co-relation 9338. Up to 1451 conditions per place. [2022-12-11 22:05:16,024 INFO L137 encePairwiseOnDemand]: 177/194 looper letters, 218 selfloop transitions, 25 changer transitions 5/349 dead transitions. [2022-12-11 22:05:16,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 349 transitions, 2592 flow [2022-12-11 22:05:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-11 22:05:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2022-12-11 22:05:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1773 transitions. [2022-12-11 22:05:16,029 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6092783505154639 [2022-12-11 22:05:16,029 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 32 predicate places. [2022-12-11 22:05:16,030 INFO L82 GeneralOperation]: Start removeDead. Operand has 205 places, 349 transitions, 2592 flow [2022-12-11 22:05:16,048 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 203 places, 344 transitions, 2551 flow [2022-12-11 22:05:16,048 INFO L495 AbstractCegarLoop]: Abstraction has has 203 places, 344 transitions, 2551 flow [2022-12-11 22:05:16,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 111.26666666666667) internal successors, (1669), 15 states have internal predecessors, (1669), 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-11 22:05:16,049 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:16,050 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:05:16,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-11 22:05:16,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-11 22:05:16,256 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 1 more)] === [2022-12-11 22:05:16,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:16,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1599679434, now seen corresponding path program 4 times [2022-12-11 22:05:16,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:16,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720156766] [2022-12-11 22:05:16,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:16,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:16,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:19,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:05:19,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:19,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720156766] [2022-12-11 22:05:19,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720156766] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:05:19,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836886678] [2022-12-11 22:05:19,434 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 22:05:19,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:19,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:05:19,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:05:19,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-11 22:05:19,557 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 22:05:19,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:05:19,559 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 33 conjunts are in the unsatisfiable core [2022-12-11 22:05:19,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:05:20,456 INFO L321 Elim1Store]: treesize reduction 3, result has 85.0 percent of original size [2022-12-11 22:05:20,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 32 [2022-12-11 22:05:20,644 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:05:20,645 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 22:05:20,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [836886678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:05:20,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 22:05:20,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [37] total 44 [2022-12-11 22:05:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942285022] [2022-12-11 22:05:20,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:05:20,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-11 22:05:20,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:20,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-11 22:05:20,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1692, Unknown=0, NotChecked=0, Total=1892 [2022-12-11 22:05:20,659 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 194 [2022-12-11 22:05:20,660 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 344 transitions, 2551 flow. Second operand has 14 states, 14 states have (on average 111.57142857142857) internal successors, (1562), 14 states have internal predecessors, (1562), 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-11 22:05:20,661 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:20,661 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 194 [2022-12-11 22:05:20,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:21,508 INFO L130 PetriNetUnfolder]: 1588/3244 cut-off events. [2022-12-11 22:05:21,508 INFO L131 PetriNetUnfolder]: For 10604/10842 co-relation queries the response was YES. [2022-12-11 22:05:21,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15062 conditions, 3244 events. 1588/3244 cut-off events. For 10604/10842 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 21640 event pairs, 249 based on Foata normal form. 37/2982 useless extension candidates. Maximal degree in co-relation 10796. Up to 1917 conditions per place. [2022-12-11 22:05:21,540 INFO L137 encePairwiseOnDemand]: 177/194 looper letters, 248 selfloop transitions, 31 changer transitions 4/384 dead transitions. [2022-12-11 22:05:21,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 384 transitions, 3477 flow [2022-12-11 22:05:21,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-11 22:05:21,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-11 22:05:21,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1561 transitions. [2022-12-11 22:05:21,545 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6189532117367169 [2022-12-11 22:05:21,545 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 42 predicate places. [2022-12-11 22:05:21,546 INFO L82 GeneralOperation]: Start removeDead. Operand has 215 places, 384 transitions, 3477 flow [2022-12-11 22:05:21,566 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 213 places, 380 transitions, 3434 flow [2022-12-11 22:05:21,567 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 380 transitions, 3434 flow [2022-12-11 22:05:21,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 111.57142857142857) internal successors, (1562), 14 states have internal predecessors, (1562), 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-11 22:05:21,568 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:21,568 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:05:21,578 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-11 22:05:21,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:21,777 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 1 more)] === [2022-12-11 22:05:21,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:21,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1606548614, now seen corresponding path program 5 times [2022-12-11 22:05:21,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:21,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092173563] [2022-12-11 22:05:21,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:21,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:05:27,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:27,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092173563] [2022-12-11 22:05:27,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092173563] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:05:27,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45173476] [2022-12-11 22:05:27,133 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-11 22:05:27,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:27,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:05:27,140 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:05:27,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-11 22:05:27,258 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-11 22:05:27,259 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:05:27,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-11 22:05:27,265 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:05:28,753 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-11 22:05:29,144 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 21 treesize of output 9 [2022-12-11 22:05:29,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:05:29,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:05:29,490 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:05:29,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 44 [2022-12-11 22:05:29,767 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:05:29,768 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 41 [2022-12-11 22:05:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-11 22:05:31,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [45173476] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:05:31,128 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:05:31,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 26, 20] total 81 [2022-12-11 22:05:31,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370266648] [2022-12-11 22:05:31,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:05:31,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-12-11 22:05:31,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:31,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-12-11 22:05:31,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=547, Invalid=5933, Unknown=0, NotChecked=0, Total=6480 [2022-12-11 22:05:31,135 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 194 [2022-12-11 22:05:31,139 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 380 transitions, 3434 flow. Second operand has 81 states, 81 states have (on average 61.49382716049383) internal successors, (4981), 81 states have internal predecessors, (4981), 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-11 22:05:31,139 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:31,139 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 194 [2022-12-11 22:05:31,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:42,328 INFO L130 PetriNetUnfolder]: 3655/7698 cut-off events. [2022-12-11 22:05:42,328 INFO L131 PetriNetUnfolder]: For 29806/31136 co-relation queries the response was YES. [2022-12-11 22:05:42,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40831 conditions, 7698 events. 3655/7698 cut-off events. For 29806/31136 co-relation queries the response was YES. Maximal size of possible extension queue 398. Compared 62673 event pairs, 315 based on Foata normal form. 71/7068 useless extension candidates. Maximal degree in co-relation 27136. Up to 4716 conditions per place. [2022-12-11 22:05:42,393 INFO L137 encePairwiseOnDemand]: 141/194 looper letters, 749 selfloop transitions, 200 changer transitions 4/1004 dead transitions. [2022-12-11 22:05:42,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 290 places, 1004 transitions, 12178 flow [2022-12-11 22:05:42,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2022-12-11 22:05:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2022-12-11 22:05:42,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 5034 transitions. [2022-12-11 22:05:42,407 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3326724821570182 [2022-12-11 22:05:42,410 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 117 predicate places. [2022-12-11 22:05:42,410 INFO L82 GeneralOperation]: Start removeDead. Operand has 290 places, 1004 transitions, 12178 flow [2022-12-11 22:05:42,463 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 288 places, 1000 transitions, 12127 flow [2022-12-11 22:05:42,464 INFO L495 AbstractCegarLoop]: Abstraction has has 288 places, 1000 transitions, 12127 flow [2022-12-11 22:05:42,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 61.49382716049383) internal successors, (4981), 81 states have internal predecessors, (4981), 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-11 22:05:42,467 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:42,468 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:05:42,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-11 22:05:42,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:42,674 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 1 more)] === [2022-12-11 22:05:42,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:42,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1692311942, now seen corresponding path program 6 times [2022-12-11 22:05:42,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:42,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075933903] [2022-12-11 22:05:42,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:42,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:45,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:05:45,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075933903] [2022-12-11 22:05:45,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075933903] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:05:45,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527386346] [2022-12-11 22:05:45,429 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-11 22:05:45,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:45,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:05:45,431 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:05:45,433 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-11 22:05:45,540 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-11 22:05:45,540 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:05:45,542 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 55 conjunts are in the unsatisfiable core [2022-12-11 22:05:45,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:05:45,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-11 22:05:45,622 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 22:05:45,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-11 22:05:46,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-11 22:05:47,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:05:47,429 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-11 22:05:47,429 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 55 [2022-12-11 22:05:47,440 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 38 treesize of output 20 [2022-12-11 22:05:47,582 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 9 [2022-12-11 22:05:47,691 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:05:47,692 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 22:05:47,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527386346] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:05:47,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 22:05:47,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [39] total 60 [2022-12-11 22:05:47,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759374270] [2022-12-11 22:05:47,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:05:47,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-11 22:05:47,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:05:47,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-11 22:05:47,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=3257, Unknown=0, NotChecked=0, Total=3540 [2022-12-11 22:05:47,696 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 194 [2022-12-11 22:05:47,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 288 places, 1000 transitions, 12127 flow. Second operand has 27 states, 27 states have (on average 72.5925925925926) internal successors, (1960), 27 states have internal predecessors, (1960), 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-11 22:05:47,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:05:47,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 194 [2022-12-11 22:05:47,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:05:50,726 INFO L130 PetriNetUnfolder]: 3896/8156 cut-off events. [2022-12-11 22:05:50,726 INFO L131 PetriNetUnfolder]: For 36420/37408 co-relation queries the response was YES. [2022-12-11 22:05:50,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49692 conditions, 8156 events. 3896/8156 cut-off events. For 36420/37408 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 67435 event pairs, 326 based on Foata normal form. 50/7469 useless extension candidates. Maximal degree in co-relation 28001. Up to 5027 conditions per place. [2022-12-11 22:05:50,816 INFO L137 encePairwiseOnDemand]: 156/194 looper letters, 861 selfloop transitions, 129 changer transitions 4/1077 dead transitions. [2022-12-11 22:05:50,816 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 1077 transitions, 15138 flow [2022-12-11 22:05:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-11 22:05:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2022-12-11 22:05:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 2560 transitions. [2022-12-11 22:05:50,820 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.38811400848999394 [2022-12-11 22:05:50,821 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 148 predicate places. [2022-12-11 22:05:50,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 321 places, 1077 transitions, 15138 flow [2022-12-11 22:05:51,006 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 319 places, 1073 transitions, 15079 flow [2022-12-11 22:05:51,007 INFO L495 AbstractCegarLoop]: Abstraction has has 319 places, 1073 transitions, 15079 flow [2022-12-11 22:05:51,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 72.5925925925926) internal successors, (1960), 27 states have internal predecessors, (1960), 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-11 22:05:51,008 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:05:51,008 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:05:51,014 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-11 22:05:51,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:51,214 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 1 more)] === [2022-12-11 22:05:51,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:05:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1056479110, now seen corresponding path program 7 times [2022-12-11 22:05:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:05:51,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317417461] [2022-12-11 22:05:51,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:05:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:05:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:56,344 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:05:56,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:05:56,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317417461] [2022-12-11 22:05:56,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317417461] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:05:56,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183463300] [2022-12-11 22:05:56,345 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-11 22:05:56,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:05:56,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:05:56,346 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:05:56,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-11 22:05:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:05:56,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 79 conjunts are in the unsatisfiable core [2022-12-11 22:05:56,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:05:58,844 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-11 22:05:59,891 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-11 22:06:00,121 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-11 22:06:00,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:06:00,874 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-11 22:06:00,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 45 [2022-12-11 22:06:00,883 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 22:06:00,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-11 22:06:01,068 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-11 22:06:01,068 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 12 [2022-12-11 22:06:01,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:06:01,376 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:06:02,056 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse0 (+ .cse4 1))) (or (not (<= .cse0 0)) (not (< c_~q2_back~0 c_~n2~0)) (not (<= (select (select |c_#memory_int| c_~q1~0.base) (+ (* c_~q1_front~0 4) c_~q1~0.offset)) .cse0)) (not (<= 0 c_~q2_back~0)) (let ((.cse2 (* c_~t~0 2)) (.cse3 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse1 (+ c_~s~0 .cse4))) (and (forall ((v_ArrVal_319 (Array Int Int))) (< .cse1 (+ .cse2 2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse3))))) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse3)) 1) .cse1))))))) is different from false [2022-12-11 22:06:05,164 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:06:05,164 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 128 [2022-12-11 22:06:05,250 INFO L321 Elim1Store]: treesize reduction 4, result has 96.0 percent of original size [2022-12-11 22:06:05,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3366 treesize of output 3118 [2022-12-11 22:06:05,315 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:06:05,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3022 treesize of output 2594 [2022-12-11 22:06:05,351 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 1734 treesize of output 1542 [2022-12-11 22:06:05,423 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:06:05,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2314 treesize of output 2144 [2022-12-11 22:06:42,154 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:06:42,154 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 188 treesize of output 128 [2022-12-11 22:06:42,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-11 22:06:42,216 INFO L321 Elim1Store]: treesize reduction 77, result has 23.8 percent of original size [2022-12-11 22:06:42,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1702 treesize of output 1509 [2022-12-11 22:06:42,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:06:42,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:06:42,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:06:42,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1482 treesize of output 1332 [2022-12-11 22:06:42,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:06:42,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:06:42,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:06:42,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1316 treesize of output 992 [2022-12-11 22:06:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:06:45,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183463300] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-11 22:06:45,477 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-11 22:06:45,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 43, 37] total 108 [2022-12-11 22:06:45,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930118485] [2022-12-11 22:06:45,478 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-11 22:06:45,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-12-11 22:06:45,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:06:45,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-12-11 22:06:45,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=721, Invalid=10580, Unknown=45, NotChecked=210, Total=11556 [2022-12-11 22:06:45,485 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 53 out of 194 [2022-12-11 22:06:45,490 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 1073 transitions, 15079 flow. Second operand has 108 states, 108 states have (on average 55.620370370370374) internal successors, (6007), 108 states have internal predecessors, (6007), 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-11 22:06:45,490 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:06:45,490 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 53 of 194 [2022-12-11 22:06:45,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:06:56,837 WARN L233 SmtUtils]: Spent 10.79s on a formula simplification. DAG size of input: 245 DAG size of output: 240 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:06:56,886 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse27 (* c_~q2_back~0 4))) (let ((.cse6 (* c_~t~0 2)) (.cse28 (* c_~q2_front~0 4)) (.cse71 (* c_~q1_front~0 4)) (.cse70 (* c_~q1_back~0 4)) (.cse9 (+ .cse27 c_~q2~0.offset))) (let ((.cse59 (select (select |c_#memory_int| c_~q2~0.base) .cse9)) (.cse4 (+ .cse70 c_~q1~0.offset)) (.cse2 (+ .cse71 c_~q1~0.offset)) (.cse45 (= .cse70 .cse71)) (.cse46 (= .cse27 .cse28)) (.cse47 (< .cse6 (+ c_~s~0 1))) (.cse48 (< c_~s~0 (+ .cse6 1)))) (let ((.cse42 (and .cse45 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse46 .cse47 .cse48)) (.cse40 (let ((.cse63 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse65 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse62 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse64 (select (select .cse62 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse65))) (let ((.cse61 (select .cse62 ~q1~0.base)) (.cse60 (+ .cse64 1))) (or (not (<= .cse60 0)) (not (= (select .cse61 .cse4) 0)) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse6 (* (select (select (store .cse62 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse63) 2) 1) (+ c_~s~0 .cse64))) (not (<= (select .cse61 .cse2) .cse60))))))) (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse69 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse68 (select (select .cse69 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse65))) (let ((.cse67 (select .cse69 ~q1~0.base)) (.cse66 (+ .cse68 1))) (or (not (<= .cse66 0)) (not (= (select .cse67 .cse4) 0)) (not (<= (select .cse67 .cse2) .cse66)) (forall ((v_ArrVal_319 (Array Int Int))) (< (+ c_~s~0 .cse68) (+ .cse6 2 (* (select (select (store .cse69 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse63) 2)))))))))))) (.cse41 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse29 (and .cse45 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|)) .cse46 .cse47 .cse48)) (.cse0 (not (<= 0 c_~q1_back~0))) (.cse44 (+ .cse59 1)) (.cse14 (not (< c_~q2_back~0 c_~n2~0))) (.cse15 (not (< c_~q1_back~0 c_~n1~0))) (.cse16 (not (<= 0 c_~q2_back~0))) (.cse8 (+ c_~q2~0.offset .cse28))) (and (or .cse0 (and (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse5 (select (select .cse7 c_~q2~0.base) .cse9))) (let ((.cse3 (+ .cse5 1)) (.cse1 (select .cse7 ~q1~0.base))) (or (not (<= (select .cse1 .cse2) .cse3)) (not (<= .cse3 0)) (not (= (select .cse1 .cse4) 0)) (forall ((v_ArrVal_319 (Array Int Int))) (< (+ c_~s~0 .cse5) (+ .cse6 (* 2 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse8)) 2)))))))) (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse12 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse13 (select (select .cse12 c_~q2~0.base) .cse9))) (let ((.cse11 (+ .cse13 1)) (.cse10 (select .cse12 ~q1~0.base))) (or (not (<= (select .cse10 .cse2) .cse11)) (not (<= .cse11 0)) (not (= (select .cse10 .cse4) 0)) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse6 (* 2 (select (select (store .cse12 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse8)) 1) (+ c_~s~0 .cse13))))))))) .cse14 .cse15 .cse16) (or (let ((.cse20 (+ |c_ULTIMATE.start_main_#t~ret17#1.offset| .cse28)) (.cse22 (+ .cse27 |c_ULTIMATE.start_main_#t~ret17#1.offset|))) (and (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse21 (select (select .cse19 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse22))) (let ((.cse17 (select .cse19 ~q1~0.base)) (.cse18 (+ .cse21 1))) (or (not (= (select .cse17 .cse4) 0)) (not (<= (select .cse17 .cse2) .cse18)) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse6 (* (select (select (store .cse19 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse20) 2) 1) (+ c_~s~0 .cse21))) (not (<= .cse18 0))))))) (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse26 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse25 (select (select .cse26 |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse22))) (let ((.cse23 (select .cse26 ~q1~0.base)) (.cse24 (+ .cse25 1))) (or (not (= (select .cse23 .cse4) 0)) (not (<= (select .cse23 .cse2) .cse24)) (forall ((v_ArrVal_319 (Array Int Int))) (< (+ c_~s~0 .cse25) (+ .cse6 2 (* (select (select (store .cse26 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_main_#t~ret17#1.base|) .cse20) 2)))) (not (<= .cse24 0))))))))) .cse0 .cse14 .cse15 .cse16) (or .cse0 .cse14 .cse15 .cse29 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse16) (or .cse0 (let ((.cse32 (+ .cse28 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse35 (+ .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse33 (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse35))) (let ((.cse30 (select .cse31 ~q1~0.base)) (.cse34 (+ .cse33 1))) (or (not (= (select .cse30 .cse4) 0)) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse6 (* (select (select (store .cse31 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse32) 2) 1) (+ c_~s~0 .cse33))) (not (<= (select .cse30 .cse2) .cse34)) (not (<= .cse34 0))))))) (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse39 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse38 (select (select .cse39 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse35))) (let ((.cse36 (select .cse39 ~q1~0.base)) (.cse37 (+ .cse38 1))) (or (not (= (select .cse36 .cse4) 0)) (not (<= (select .cse36 .cse2) .cse37)) (not (<= .cse37 0)) (forall ((v_ArrVal_319 (Array Int Int))) (< (+ c_~s~0 .cse38) (+ .cse6 2 (* (select (select (store .cse39 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse32) 2))))))))))) .cse14 .cse15 .cse16) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post29#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse0 .cse14 .cse15 .cse40 .cse16) (or .cse0 .cse41 .cse14 .cse15 .cse16 .cse42) (or .cse0 .cse14 .cse15 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse16 .cse42) (or .cse0 .cse15 .cse29 (< 0 c_~q2_back~0) .cse16) (or .cse0 .cse14 .cse15 .cse40 .cse16) (or (let ((.cse43 (+ c_~s~0 |c_thread2Thread1of1ForFork0_~j~0#1|))) (and (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse6 2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse8))) .cse43)) (forall ((v_ArrVal_319 (Array Int Int))) (< .cse43 (+ .cse6 3 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse8))))))) .cse14 (not (<= |c_thread2Thread1of1ForFork0_~j~0#1| 0)) (not (= |c_thread2Thread1of1ForFork0_~j~0#1| .cse44)) .cse16) (or .cse0 .cse41 .cse14 .cse15 (and .cse45 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base|)) .cse46 .cse47 .cse48) .cse16) (or .cse0 .cse41 .cse14 .cse15 .cse29 .cse16) (or .cse0 .cse14 .cse15 (and (forall ((v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse51 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse52 (select (select .cse51 c_~q2~0.base) .cse9))) (let ((.cse49 (select .cse51 ~q1~0.base)) (.cse50 (+ .cse52 1))) (or (not (<= (select .cse49 .cse2) .cse50)) (not (= (select .cse49 .cse4) 0)) (not (<= .cse50 0)) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse6 (* (select (select (store .cse51 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse8) 2) 1) (+ c_~s~0 .cse52)))))))) (forall ((v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse56 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse55 (select (select .cse56 c_~q2~0.base) .cse9))) (let ((.cse53 (select .cse56 ~q1~0.base)) (.cse54 (+ .cse55 1))) (or (not (<= (select .cse53 .cse2) .cse54)) (not (= (select .cse53 .cse4) 0)) (not (<= .cse54 0)) (forall ((v_ArrVal_319 (Array Int Int))) (< (+ c_~s~0 .cse55) (+ .cse6 (* (select (select (store .cse56 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse8) 2) 2))))))))) .cse16) (or (forall ((~q1~0.base Int)) (let ((.cse57 (select |c_#memory_int| ~q1~0.base))) (or (not (<= (select .cse57 .cse2) .cse44)) (not (= 0 (select .cse57 .cse4)))))) .cse0 (not (<= .cse44 0)) .cse14 .cse15 .cse16 (let ((.cse58 (+ c_~s~0 .cse59))) (and (forall ((v_ArrVal_319 (Array Int Int))) (< .cse58 (+ .cse6 2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse8))))) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse6 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse8)) 1) .cse58)))))))))) is different from false [2022-12-11 22:07:21,306 WARN L233 SmtUtils]: Spent 6.42s on a formula simplification. DAG size of input: 184 DAG size of output: 169 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:08:08,559 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse27 (* c_~q1_front~0 4))) (let ((.cse28 (select |c_#memory_int| c_~q1~0.base)) (.cse18 (+ .cse27 c_~q1~0.offset))) (let ((.cse19 (+ c_~q2_front~0 c_~n2~0)) (.cse26 (select .cse28 .cse18)) (.cse16 (+ (* c_~q1_back~0 4) c_~q1~0.offset))) (let ((.cse0 (<= c_~q2_back~0 c_~q2_front~0)) (.cse2 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| c_~q1~0.base))) (.cse3 (not (= |c_ULTIMATE.start_main_~#t1~0#1.base| c_~q1~0.base))) (.cse5 (not (= (select .cse28 .cse16) 0))) (.cse6 (<= .cse16 0)) (.cse11 (not (<= (+ .cse27 c_~q1~0.offset 1) 0))) (.cse10 (<= .cse18 0)) (.cse7 (<= 0 .cse26)) (.cse8 (<= .cse26 0)) (.cse17 (<= c_~n1~0 1)) (.cse9 (= c_~s~0 0)) (.cse12 (= c_~t~0 0)) (.cse1 (+ 2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (.cse13 (<= c_~n1~0 c_~q1_back~0)) (.cse14 (not (<= 0 c_~q1_back~0))) (.cse4 (<= .cse19 (+ c_~q2_back~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|))) (.cse15 (+ |c_#StackHeapBarrier| 1))) (and .cse0 (= c_~q1~0.offset 0) (<= .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base|) .cse2 (or (and .cse0 .cse2 .cse3 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) (not (= c_~q1~0.base |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse4 (or (and .cse5 .cse6) (and .cse7 .cse8 .cse9 .cse10 .cse11 .cse12))) .cse13 .cse14) (<= .cse15 |c_ULTIMATE.start_main_~#t1~0#1.base|) (= |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| 0) .cse3 (<= c_~q1_back~0 c_~q1_front~0) (<= .cse1 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or (and (or (not (= .cse16 0)) .cse5) (or .cse17 .cse6)) (and .cse11 (or (<= (+ c_~q1_front~0 c_~n1~0) (+ c_~q1_back~0 1)) .cse10) (or (not (= .cse18 0)) (and .cse7 .cse8 .cse9 .cse12)))) .cse17 .cse9 (<= c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (<= c_~q1_front~0 c_~q1_back~0) (<= c_~n2~0 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= 0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) (<= .cse19 (+ |c_ULTIMATE.start_create_fresh_int_array_#in~size#1| c_~q2_back~0)) (<= c_~q2_front~0 c_~q2_back~0) .cse12 (<= .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= c_~n1~0 |c_ULTIMATE.start_create_fresh_int_array_~size#1|) (let ((.cse25 (select (select |c_#memory_int| c_~q2~0.base) (+ (* c_~q2_back~0 4) c_~q2~0.offset)))) (let ((.cse21 (+ .cse25 1))) (or (forall ((~q1~0.base Int)) (let ((.cse20 (select |c_#memory_int| ~q1~0.base))) (or (not (<= (select .cse20 .cse18) .cse21)) (not (= 0 (select .cse20 .cse16)))))) .cse14 (not (<= .cse21 0)) (not (< c_~q2_back~0 c_~n2~0)) (not (< c_~q1_back~0 c_~n1~0)) (not (<= 0 c_~q2_back~0)) (let ((.cse23 (* c_~t~0 2)) (.cse24 (+ c_~q2~0.offset (* c_~q2_front~0 4))) (.cse22 (+ c_~s~0 .cse25))) (and (forall ((v_ArrVal_319 (Array Int Int))) (< .cse22 (+ .cse23 2 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse24))))) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse23 (* 2 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) c_~q2~0.base) .cse24)) 1) .cse22))))))) (or .cse13 .cse14 (= (select |c_#valid| c_~q1~0.base) 1)) .cse4 (<= .cse15 |c_ULTIMATE.start_main_~#t3~0#1.base|)))))) is different from false [2022-12-11 22:08:25,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-11 22:08:27,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-11 22:08:51,842 WARN L233 SmtUtils]: Spent 6.81s on a formula simplification. DAG size of input: 255 DAG size of output: 248 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-11 22:08:54,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:08:57,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:08:58,462 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse8 (* c_~t~0 2)) (.cse19 (* c_~q2_back~0 4)) (.cse20 (* c_~q2_front~0 4)) (.cse42 (* c_~q1_front~0 4)) (.cse41 (* c_~q1_back~0 4))) (let ((.cse30 (not (< |c_ULTIMATE.start_main_~#t3~0#1.base| |c_#StackHeapBarrier|))) (.cse7 (+ .cse41 c_~q1~0.offset)) (.cse12 (+ .cse42 c_~q1~0.offset)) (.cse25 (= .cse41 .cse42)) (.cse26 (= .cse19 .cse20)) (.cse27 (< .cse8 (+ c_~s~0 1))) (.cse28 (< c_~s~0 (+ .cse8 1)))) (let ((.cse23 (and .cse25 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)) .cse26 .cse27 .cse28)) (.cse21 (let ((.cse34 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse36 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (and (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse33 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse35 (select (select .cse33 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse36))) (let ((.cse32 (select .cse33 ~q1~0.base)) (.cse31 (+ .cse35 1))) (or (not (<= .cse31 0)) (not (= (select .cse32 .cse7) 0)) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse8 (* (select (select (store .cse33 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse34) 2) 1) (+ c_~s~0 .cse35))) (not (<= (select .cse32 .cse12) .cse31))))))) (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse40 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse39 (select (select .cse40 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse36))) (let ((.cse38 (select .cse40 ~q1~0.base)) (.cse37 (+ .cse39 1))) (or (not (<= .cse37 0)) (not (= (select .cse38 .cse7) 0)) (not (<= (select .cse38 .cse12) .cse37)) (forall ((v_ArrVal_319 (Array Int Int))) (< (+ c_~s~0 .cse39) (+ .cse8 2 (* (select (select (store .cse40 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) .cse34) 2)))))))))))) (.cse22 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse2 (not (< c_~q2_back~0 c_~n2~0))) (.cse3 (not (< c_~q1_back~0 c_~n1~0))) (.cse1 (not (<= 0 c_~q1_back~0))) (.cse4 (and .cse25 .cse30 .cse26 .cse27 .cse28)) (.cse24 (< 0 c_~q2_back~0)) (.cse29 (< 0 c_~q1_back~0)) (.cse5 (not (<= 0 c_~q2_back~0))) (.cse0 (+ |c_#StackHeapBarrier| 1))) (and (<= .cse0 |c_ULTIMATE.start_main_~#t1~0#1.base|) (or .cse1 .cse2 .cse3 .cse4 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse5) (or .cse1 (let ((.cse10 (+ .cse20 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse14 (+ .cse19 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (and (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse11 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse14))) (let ((.cse6 (select .cse9 ~q1~0.base)) (.cse13 (+ .cse11 1))) (or (not (= (select .cse6 .cse7) 0)) (forall ((v_ArrVal_319 (Array Int Int))) (<= (+ .cse8 (* (select (select (store .cse9 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse10) 2) 1) (+ c_~s~0 .cse11))) (not (<= (select .cse6 .cse12) .cse13)) (not (<= .cse13 0))))))) (forall ((v_ArrVal_317 (Array Int Int)) (v_ArrVal_318 (Array Int Int)) (~q1~0.base Int)) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_317) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_318))) (let ((.cse17 (select (select .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse14))) (let ((.cse15 (select .cse18 ~q1~0.base)) (.cse16 (+ .cse17 1))) (or (not (= (select .cse15 .cse7) 0)) (not (<= (select .cse15 .cse12) .cse16)) (not (<= .cse16 0)) (forall ((v_ArrVal_319 (Array Int Int))) (< (+ c_~s~0 .cse17) (+ .cse8 2 (* (select (select (store .cse18 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_319) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) .cse10) 2))))))))))) .cse2 .cse3 .cse5) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post29#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse1 .cse2 .cse3 .cse21 .cse5) (or .cse1 .cse22 .cse2 .cse3 .cse5 .cse23) (= c_~s~0 0) (or .cse1 .cse2 .cse3 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse5 .cse23) (or .cse1 .cse3 .cse4 .cse24 .cse5) (or .cse1 .cse2 .cse3 .cse21 .cse5) (or .cse1 .cse22 .cse2 .cse3 (and .cse25 (not (= |c_ULTIMATE.start_main_~#t3~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc28#1.base|)) .cse26 .cse27 .cse28) .cse5) (or .cse1 .cse29 (and .cse25 .cse30 .cse27 .cse28)) (or .cse1 .cse22 .cse2 .cse3 .cse4 .cse5) (or .cse1 .cse4 .cse24 .cse29 .cse5) (= c_~t~0 0) (<= .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base|) (<= .cse0 |c_ULTIMATE.start_main_~#t3~0#1.base|))))) is different from false [2022-12-11 22:09:14,828 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:09:23,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-11 22:09:38,848 INFO L130 PetriNetUnfolder]: 8788/18371 cut-off events. [2022-12-11 22:09:38,848 INFO L131 PetriNetUnfolder]: For 101168/103626 co-relation queries the response was YES. [2022-12-11 22:09:38,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125938 conditions, 18371 events. 8788/18371 cut-off events. For 101168/103626 co-relation queries the response was YES. Maximal size of possible extension queue 861. Compared 175983 event pairs, 200 based on Foata normal form. 159/16894 useless extension candidates. Maximal degree in co-relation 35564. Up to 11049 conditions per place. [2022-12-11 22:09:39,169 INFO L137 encePairwiseOnDemand]: 126/194 looper letters, 2122 selfloop transitions, 851 changer transitions 22/3042 dead transitions. [2022-12-11 22:09:39,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 467 places, 3042 transitions, 51534 flow [2022-12-11 22:09:39,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2022-12-11 22:09:39,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2022-12-11 22:09:39,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 8789 transitions. [2022-12-11 22:09:39,196 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.3040545215526188 [2022-12-11 22:09:39,197 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 294 predicate places. [2022-12-11 22:09:39,197 INFO L82 GeneralOperation]: Start removeDead. Operand has 467 places, 3042 transitions, 51534 flow [2022-12-11 22:09:39,342 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 463 places, 3020 transitions, 51193 flow [2022-12-11 22:09:39,343 INFO L495 AbstractCegarLoop]: Abstraction has has 463 places, 3020 transitions, 51193 flow [2022-12-11 22:09:39,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 55.620370370370374) internal successors, (6007), 108 states have internal predecessors, (6007), 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-11 22:09:39,346 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:09:39,346 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:09:39,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-12-11 22:09:39,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:09:39,553 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 1 more)] === [2022-12-11 22:09:39,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:09:39,553 INFO L85 PathProgramCache]: Analyzing trace with hash -161788146, now seen corresponding path program 8 times [2022-12-11 22:09:39,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:09:39,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558797774] [2022-12-11 22:09:39,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:09:39,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:09:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:09:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:09:43,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:09:43,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558797774] [2022-12-11 22:09:43,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558797774] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:09:43,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287629211] [2022-12-11 22:09:43,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-11 22:09:43,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:09:43,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:09:43,215 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:09:43,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-11 22:09:43,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-11 22:09:43,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:09:43,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 60 conjunts are in the unsatisfiable core [2022-12-11 22:09:43,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:09:43,349 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-11 22:09:43,456 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-11 22:09:43,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-12-11 22:09:43,527 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 22:09:43,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-11 22:09:45,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-11 22:09:45,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:09:45,708 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-11 22:09:45,964 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-11 22:09:45,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 29 treesize of output 33 [2022-12-11 22:09:45,974 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 19 treesize of output 7 [2022-12-11 22:09:46,200 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 9 [2022-12-11 22:09:46,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:09:46,566 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 22:09:46,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287629211] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:09:46,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 22:09:46,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [40] total 65 [2022-12-11 22:09:46,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560381636] [2022-12-11 22:09:46,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:09:46,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-11 22:09:46,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:09:46,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-11 22:09:46,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=3860, Unknown=0, NotChecked=0, Total=4160 [2022-12-11 22:09:46,571 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 194 [2022-12-11 22:09:46,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 463 places, 3020 transitions, 51193 flow. Second operand has 31 states, 31 states have (on average 71.12903225806451) internal successors, (2205), 31 states have internal predecessors, (2205), 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-11 22:09:46,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:09:46,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 194 [2022-12-11 22:09:46,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:09:55,033 INFO L130 PetriNetUnfolder]: 8771/18227 cut-off events. [2022-12-11 22:09:55,033 INFO L131 PetriNetUnfolder]: For 121600/124993 co-relation queries the response was YES. [2022-12-11 22:09:55,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139923 conditions, 18227 events. 8771/18227 cut-off events. For 121600/124993 co-relation queries the response was YES. Maximal size of possible extension queue 865. Compared 173969 event pairs, 193 based on Foata normal form. 87/16758 useless extension candidates. Maximal degree in co-relation 39103. Up to 11320 conditions per place. [2022-12-11 22:09:55,224 INFO L137 encePairwiseOnDemand]: 154/194 looper letters, 2749 selfloop transitions, 242 changer transitions 16/3104 dead transitions. [2022-12-11 22:09:55,224 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 501 places, 3104 transitions, 58670 flow [2022-12-11 22:09:55,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-12-11 22:09:55,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2022-12-11 22:09:55,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 2847 transitions. [2022-12-11 22:09:55,231 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.37628865979381443 [2022-12-11 22:09:55,231 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 328 predicate places. [2022-12-11 22:09:55,231 INFO L82 GeneralOperation]: Start removeDead. Operand has 501 places, 3104 transitions, 58670 flow [2022-12-11 22:09:55,367 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 498 places, 3088 transitions, 58359 flow [2022-12-11 22:09:55,367 INFO L495 AbstractCegarLoop]: Abstraction has has 498 places, 3088 transitions, 58359 flow [2022-12-11 22:09:55,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 71.12903225806451) internal successors, (2205), 31 states have internal predecessors, (2205), 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-11 22:09:55,368 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:09:55,368 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:09:55,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-11 22:09:55,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:09:55,569 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:09:55,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:09:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1208365332, now seen corresponding path program 9 times [2022-12-11 22:09:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:09:55,570 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417495273] [2022-12-11 22:09:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:09:55,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:09:55,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:09:59,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:09:59,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:09:59,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417495273] [2022-12-11 22:09:59,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417495273] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:09:59,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229888858] [2022-12-11 22:09:59,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-11 22:09:59,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:09:59,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:09:59,877 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:09:59,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-11 22:09:59,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-11 22:09:59,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:09:59,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-11 22:09:59,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:10:01,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:10:01,511 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-11 22:10:01,639 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-11 22:10:01,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-12-11 22:10:01,893 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 9 [2022-12-11 22:10:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-11 22:10:02,203 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-11 22:10:02,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229888858] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-11 22:10:02,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-11 22:10:02,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [41] total 55 [2022-12-11 22:10:02,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996130006] [2022-12-11 22:10:02,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-11 22:10:02,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-11 22:10:02,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-11 22:10:02,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-11 22:10:02,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=2790, Unknown=0, NotChecked=0, Total=2970 [2022-12-11 22:10:02,206 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 194 [2022-12-11 22:10:02,207 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 498 places, 3088 transitions, 58359 flow. Second operand has 22 states, 22 states have (on average 88.81818181818181) internal successors, (1954), 22 states have internal predecessors, (1954), 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-11 22:10:02,207 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-11 22:10:02,207 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 194 [2022-12-11 22:10:02,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-11 22:10:09,280 INFO L130 PetriNetUnfolder]: 8937/18608 cut-off events. [2022-12-11 22:10:09,280 INFO L131 PetriNetUnfolder]: For 142512/147675 co-relation queries the response was YES. [2022-12-11 22:10:09,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 157043 conditions, 18608 events. 8937/18608 cut-off events. For 142512/147675 co-relation queries the response was YES. Maximal size of possible extension queue 882. Compared 178088 event pairs, 204 based on Foata normal form. 83/17083 useless extension candidates. Maximal degree in co-relation 76624. Up to 11610 conditions per place. [2022-12-11 22:10:09,440 INFO L137 encePairwiseOnDemand]: 164/194 looper letters, 2799 selfloop transitions, 254 changer transitions 5/3181 dead transitions. [2022-12-11 22:10:09,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 524 places, 3181 transitions, 66247 flow [2022-12-11 22:10:09,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-11 22:10:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2022-12-11 22:10:09,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 2483 transitions. [2022-12-11 22:10:09,445 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.47403589156166476 [2022-12-11 22:10:09,445 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 351 predicate places. [2022-12-11 22:10:09,445 INFO L82 GeneralOperation]: Start removeDead. Operand has 524 places, 3181 transitions, 66247 flow [2022-12-11 22:10:09,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 522 places, 3176 transitions, 66146 flow [2022-12-11 22:10:09,705 INFO L495 AbstractCegarLoop]: Abstraction has has 522 places, 3176 transitions, 66146 flow [2022-12-11 22:10:09,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 88.81818181818181) internal successors, (1954), 22 states have internal predecessors, (1954), 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-11 22:10:09,706 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-11 22:10:09,706 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 22:10:09,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-12-11 22:10:09,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-11 22:10:09,908 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-11 22:10:09,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-11 22:10:09,908 INFO L85 PathProgramCache]: Analyzing trace with hash 528336130, now seen corresponding path program 10 times [2022-12-11 22:10:09,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-11 22:10:09,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910831861] [2022-12-11 22:10:09,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-11 22:10:09,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-11 22:10:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-11 22:10:15,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:10:15,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-11 22:10:15,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910831861] [2022-12-11 22:10:15,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910831861] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-11 22:10:15,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [398695263] [2022-12-11 22:10:15,214 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-11 22:10:15,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-11 22:10:15,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-11 22:10:15,215 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-11 22:10:15,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-11 22:10:15,336 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-11 22:10:15,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-11 22:10:15,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-11 22:10:15,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-11 22:10:16,111 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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-11 22:10:16,552 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-11 22:10:18,154 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-11 22:10:18,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-12-11 22:10:18,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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-11 22:10:20,257 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-11 22:10:20,618 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-11 22:10:21,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-11 22:10:21,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-11 22:10:22,302 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-12-11 22:10:22,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 21 [2022-12-11 22:10:22,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-11 22:10:22,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-11 22:10:34,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:10:34,277 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 216 treesize of output 156 [2022-12-11 22:10:34,327 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:10:34,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 256872 treesize of output 252724 [2022-12-11 22:10:34,939 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:10:34,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 252712 treesize of output 243536 [2022-12-11 22:10:35,670 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:10:35,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 243448 treesize of output 231152 [2022-12-11 22:10:36,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:10:36,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 230530 treesize of output 181230 [2022-12-11 22:10:36,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-11 22:10:36,949 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 181720 treesize of output 157040 Received shutdown request... [2022-12-11 22:18:28,704 WARN L249 SmtUtils]: Removed 1 from assertion stack [2022-12-11 22:18:28,706 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-11 22:18:28,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-12-11 22:18:28,733 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-11 22:18:28,733 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-11 22:18:28,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-11 22:18:28,907 WARN L619 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 156 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. [2022-12-11 22:18:28,909 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-11 22:18:28,909 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-11 22:18:28,909 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-11 22:18:28,910 INFO L445 BasicCegarLoop]: Path program histogram: [10, 1, 1, 1] [2022-12-11 22:18:28,913 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-11 22:18:28,913 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-11 22:18:28,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.12 10:18:28 BasicIcfg [2022-12-11 22:18:28,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-11 22:18:28,917 INFO L158 Benchmark]: Toolchain (without parser) took 810514.29ms. Allocated memory was 202.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 165.1MB in the beginning and 374.4MB in the end (delta: -209.3MB). Peak memory consumption was 1.8GB. Max. memory is 8.0GB. [2022-12-11 22:18:28,917 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 202.4MB. Free memory was 178.7MB in the beginning and 178.6MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-11 22:18:28,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.82ms. Allocated memory is still 202.4MB. Free memory was 164.6MB in the beginning and 151.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-12-11 22:18:28,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.77ms. Allocated memory is still 202.4MB. Free memory was 151.4MB in the beginning and 149.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 22:18:28,919 INFO L158 Benchmark]: Boogie Preprocessor took 54.17ms. Allocated memory is still 202.4MB. Free memory was 149.3MB in the beginning and 147.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-11 22:18:28,919 INFO L158 Benchmark]: RCFGBuilder took 793.05ms. Allocated memory is still 202.4MB. Free memory was 147.3MB in the beginning and 114.7MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2022-12-11 22:18:28,920 INFO L158 Benchmark]: TraceAbstraction took 809326.98ms. Allocated memory was 202.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 113.7MB in the beginning and 374.4MB in the end (delta: -260.7MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. [2022-12-11 22:18:28,921 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.42ms. Allocated memory is still 202.4MB. Free memory was 178.7MB in the beginning and 178.6MB in the end (delta: 63.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 263.82ms. Allocated memory is still 202.4MB. Free memory was 164.6MB in the beginning and 151.4MB in the end (delta: 13.1MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.77ms. Allocated memory is still 202.4MB. Free memory was 151.4MB in the beginning and 149.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.17ms. Allocated memory is still 202.4MB. Free memory was 149.3MB in the beginning and 147.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 793.05ms. Allocated memory is still 202.4MB. Free memory was 147.3MB in the beginning and 114.7MB in the end (delta: 32.5MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 809326.98ms. Allocated memory was 202.4MB in the beginning and 2.1GB in the end (delta: 1.9GB). Free memory was 113.7MB in the beginning and 374.4MB in the end (delta: -260.7MB). Peak memory consumption was 1.7GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 127]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 156 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 120]: 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 156 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 119]: 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 156 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - TimeoutResultAtElement [Line: 121]: 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 156 with TraceHistMax 1,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∧-2-1 term,while PolyPacSimplificationTermWalker was simplifying 2 xjuncts wrt. a ∨-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 207 locations, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.1s, RemoveRedundantFlowTime: 0.9s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 809.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 207.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 204 mSolverCounterUnknown, 7660 SdHoareTripleChecker+Valid, 40.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7660 mSDsluCounter, 12451 SdHoareTripleChecker+Invalid, 38.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 378 IncrementalHoareTripleChecker+Unchecked, 11783 mSDsCounter, 900 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25699 IncrementalHoareTripleChecker+Invalid, 27181 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 900 mSolverCounterUnsat, 668 mSDtfsCounter, 25699 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2183 GetRequests, 1376 SyntacticMatches, 23 SemanticMatches, 784 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 29730 ImplicationChecksByTransitivity, 171.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66146occurred in iteration=12, InterpolantAutomatonStates: 389, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 12 MinimizatonAttempts, 1145 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 97.9s InterpolantComputationTime, 3058 NumberOfCodeBlocks, 2972 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3346 ConstructedInterpolants, 105 QuantifiedInterpolants, 107635 SizeOfPredicates, 211 NumberOfNonLiveVariables, 2964 ConjunctsInSsa, 390 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 17/39 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