/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_DEAD -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 01:03:34,774 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 01:03:34,775 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 01:03:34,803 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 01:03:34,803 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 01:03:34,805 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 01:03:34,809 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 01:03:34,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 01:03:34,814 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 01:03:34,818 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 01:03:34,818 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 01:03:34,820 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 01:03:34,820 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 01:03:34,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 01:03:34,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 01:03:34,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 01:03:34,826 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 01:03:34,826 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 01:03:34,827 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 01:03:34,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 01:03:34,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 01:03:34,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 01:03:34,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 01:03:34,831 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 01:03:34,833 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 01:03:34,833 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 01:03:34,833 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 01:03:34,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 01:03:34,834 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 01:03:34,834 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 01:03:34,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 01:03:34,835 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 01:03:34,835 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 01:03:34,836 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 01:03:34,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 01:03:34,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 01:03:34,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 01:03:34,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 01:03:34,837 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 01:03:34,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 01:03:34,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 01:03:34,844 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 01:03:34,871 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 01:03:34,871 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 01:03:34,872 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 01:03:34,872 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 01:03:34,873 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 01:03:34,873 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 01:03:34,874 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 01:03:34,874 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 01:03:34,874 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 01:03:34,874 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 01:03:34,874 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 01:03:34,874 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 01:03:34,875 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 01:03:34,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 01:03:34,876 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 01:03:34,876 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 01:03:34,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 01:03:34,876 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 01:03:34,876 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 01:03:34,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 01:03:34,876 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 01:03:34,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_DEAD [2022-12-12 01:03:35,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 01:03:35,175 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 01:03:35,177 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 01:03:35,178 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 01:03:35,179 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 01:03:35,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-12 01:03:36,312 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 01:03:36,494 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 01:03:36,495 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-inc-subseq.wvr.c [2022-12-12 01:03:36,499 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c861acd0b/58e6c10ea24e4d049951f0f8fba40ff6/FLAG69a18dad0 [2022-12-12 01:03:36,509 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c861acd0b/58e6c10ea24e4d049951f0f8fba40ff6 [2022-12-12 01:03:36,511 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 01:03:36,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 01:03:36,514 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 01:03:36,514 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 01:03:36,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 01:03:36,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59e325a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36, skipping insertion in model container [2022-12-12 01:03:36,517 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 01:03:36,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 01:03:36,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,666 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,668 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,669 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,674 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-more-inc-subseq.wvr.c[2924,2937] [2022-12-12 01:03:36,685 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 01:03:36,691 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 01:03:36,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,701 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,703 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-12 01:03:36,704 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-12 01:03:36,707 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-more-inc-subseq.wvr.c[2924,2937] [2022-12-12 01:03:36,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 01:03:36,718 INFO L208 MainTranslator]: Completed translation [2022-12-12 01:03:36,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36 WrapperNode [2022-12-12 01:03:36,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 01:03:36,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 01:03:36,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 01:03:36,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 01:03:36,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,748 INFO L138 Inliner]: procedures = 24, calls = 45, calls flagged for inlining = 11, calls inlined = 13, statements flattened = 191 [2022-12-12 01:03:36,748 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 01:03:36,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 01:03:36,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 01:03:36,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 01:03:36,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,769 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,780 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,783 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,784 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,785 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 01:03:36,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 01:03:36,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 01:03:36,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 01:03:36,799 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (1/1) ... [2022-12-12 01:03:36,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 01:03:36,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:03:36,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 01:03:36,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 01:03:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 01:03:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 01:03:36,867 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 01:03:36,867 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 01:03:36,868 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 01:03:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 01:03:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 01:03:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 01:03:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-12 01:03:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-12 01:03:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 01:03:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 01:03:36,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 01:03:36,870 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 01:03:36,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 01:03:36,872 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 01:03:36,949 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 01:03:36,950 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 01:03:37,249 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 01:03:37,326 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 01:03:37,326 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2022-12-12 01:03:37,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:03:37 BoogieIcfgContainer [2022-12-12 01:03:37,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 01:03:37,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 01:03:37,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 01:03:37,331 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 01:03:37,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 01:03:36" (1/3) ... [2022-12-12 01:03:37,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b57127c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:03:37, skipping insertion in model container [2022-12-12 01:03:37,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:03:36" (2/3) ... [2022-12-12 01:03:37,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b57127c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:03:37, skipping insertion in model container [2022-12-12 01:03:37,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:03:37" (3/3) ... [2022-12-12 01:03:37,333 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-inc-subseq.wvr.c [2022-12-12 01:03:37,346 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 01:03:37,346 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 01:03:37,346 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 01:03:37,420 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 01:03:37,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 165 places, 173 transitions, 362 flow [2022-12-12 01:03:37,528 INFO L130 PetriNetUnfolder]: 15/171 cut-off events. [2022-12-12 01:03:37,528 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 01:03:37,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 171 events. 15/171 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 104 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 138. Up to 2 conditions per place. [2022-12-12 01:03:37,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 165 places, 173 transitions, 362 flow [2022-12-12 01:03:37,536 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 155 places, 163 transitions, 338 flow [2022-12-12 01:03:37,543 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 01:03:37,547 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;@78b4b0a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 01:03:37,547 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 01:03:37,581 INFO L130 PetriNetUnfolder]: 15/162 cut-off events. [2022-12-12 01:03:37,581 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 01:03:37,581 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:03:37,582 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] [2022-12-12 01:03:37,582 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:03:37,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:03:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash 398714232, now seen corresponding path program 1 times [2022-12-12 01:03:37,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:03:37,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548945436] [2022-12-12 01:03:37,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:03:37,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:03:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:03:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:03:38,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:03:38,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548945436] [2022-12-12 01:03:38,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548945436] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:03:38,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:03:38,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 01:03:38,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213322706] [2022-12-12 01:03:38,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:03:38,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 01:03:38,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:03:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 01:03:38,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 01:03:38,316 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 173 [2022-12-12 01:03:38,322 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 163 transitions, 338 flow. Second operand has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:38,322 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:03:38,322 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 173 [2022-12-12 01:03:38,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:03:38,544 INFO L130 PetriNetUnfolder]: 24/231 cut-off events. [2022-12-12 01:03:38,545 INFO L131 PetriNetUnfolder]: For 17/21 co-relation queries the response was YES. [2022-12-12 01:03:38,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 350 conditions, 231 events. 24/231 cut-off events. For 17/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 425 event pairs, 11 based on Foata normal form. 12/217 useless extension candidates. Maximal degree in co-relation 206. Up to 68 conditions per place. [2022-12-12 01:03:38,547 INFO L137 encePairwiseOnDemand]: 153/173 looper letters, 55 selfloop transitions, 6 changer transitions 11/162 dead transitions. [2022-12-12 01:03:38,547 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 162 transitions, 480 flow [2022-12-12 01:03:38,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 01:03:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 01:03:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 976 transitions. [2022-12-12 01:03:38,560 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6268464996788696 [2022-12-12 01:03:38,563 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 8 predicate places. [2022-12-12 01:03:38,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 162 transitions, 480 flow [2022-12-12 01:03:38,565 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 154 places, 151 transitions, 436 flow [2022-12-12 01:03:38,565 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 151 transitions, 436 flow [2022-12-12 01:03:38,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.5) internal successors, (836), 8 states have internal predecessors, (836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:38,566 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:03:38,566 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 01:03:38,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 01:03:38,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:03:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:03:38,567 INFO L85 PathProgramCache]: Analyzing trace with hash 52056631, now seen corresponding path program 1 times [2022-12-12 01:03:38,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:03:38,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875927051] [2022-12-12 01:03:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:03:38,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:03:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:03:38,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:03:38,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:03:38,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875927051] [2022-12-12 01:03:38,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875927051] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:03:38,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207613033] [2022-12-12 01:03:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:03:38,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:03:38,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:03:38,798 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:03:38,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 01:03:38,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:03:38,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 01:03:38,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:03:39,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:03:39,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:03:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:03:39,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207613033] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 01:03:39,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 01:03:39,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 17 [2022-12-12 01:03:39,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281808395] [2022-12-12 01:03:39,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:03:39,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-12 01:03:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:03:39,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-12 01:03:39,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-12-12 01:03:39,377 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 173 [2022-12-12 01:03:39,378 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 151 transitions, 436 flow. Second operand has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:39,378 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:03:39,378 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 173 [2022-12-12 01:03:39,378 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:03:39,530 INFO L130 PetriNetUnfolder]: 56/314 cut-off events. [2022-12-12 01:03:39,530 INFO L131 PetriNetUnfolder]: For 108/134 co-relation queries the response was YES. [2022-12-12 01:03:39,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 314 events. 56/314 cut-off events. For 108/134 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 983 event pairs, 17 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 364. Up to 104 conditions per place. [2022-12-12 01:03:39,533 INFO L137 encePairwiseOnDemand]: 163/173 looper letters, 48 selfloop transitions, 10 changer transitions 0/164 dead transitions. [2022-12-12 01:03:39,533 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 164 transitions, 606 flow [2022-12-12 01:03:39,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-12 01:03:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-12 01:03:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1266 transitions. [2022-12-12 01:03:39,536 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7317919075144509 [2022-12-12 01:03:39,536 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 8 predicate places. [2022-12-12 01:03:39,536 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 164 transitions, 606 flow [2022-12-12 01:03:39,538 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 164 transitions, 606 flow [2022-12-12 01:03:39,539 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 164 transitions, 606 flow [2022-12-12 01:03:39,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.28571428571429) internal successors, (877), 7 states have internal predecessors, (877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:39,539 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:03:39,540 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] [2022-12-12 01:03:39,546 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 01:03:39,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:03:39,746 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:03:39,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:03:39,747 INFO L85 PathProgramCache]: Analyzing trace with hash -704392031, now seen corresponding path program 1 times [2022-12-12 01:03:39,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:03:39,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941679944] [2022-12-12 01:03:39,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:03:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:03:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:03:39,956 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 01:03:39,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:03:39,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941679944] [2022-12-12 01:03:39,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941679944] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:03:39,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:03:39,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 01:03:39,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359352510] [2022-12-12 01:03:39,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:03:39,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 01:03:39,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:03:39,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 01:03:39,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-12 01:03:39,959 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 173 [2022-12-12 01:03:39,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 164 transitions, 606 flow. Second operand has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:39,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:03:39,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 173 [2022-12-12 01:03:39,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:03:40,052 INFO L130 PetriNetUnfolder]: 87/418 cut-off events. [2022-12-12 01:03:40,052 INFO L131 PetriNetUnfolder]: For 322/361 co-relation queries the response was YES. [2022-12-12 01:03:40,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 418 events. 87/418 cut-off events. For 322/361 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1610 event pairs, 24 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 606. Up to 145 conditions per place. [2022-12-12 01:03:40,058 INFO L137 encePairwiseOnDemand]: 168/173 looper letters, 47 selfloop transitions, 2 changer transitions 4/177 dead transitions. [2022-12-12 01:03:40,058 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 786 flow [2022-12-12 01:03:40,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 01:03:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 01:03:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2022-12-12 01:03:40,060 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7560693641618497 [2022-12-12 01:03:40,061 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 12 predicate places. [2022-12-12 01:03:40,061 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 177 transitions, 786 flow [2022-12-12 01:03:40,064 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 165 places, 173 transitions, 757 flow [2022-12-12 01:03:40,064 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 173 transitions, 757 flow [2022-12-12 01:03:40,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:40,065 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:03:40,065 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-12 01:03:40,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-12 01:03:40,065 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:03:40,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:03:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash -83941999, now seen corresponding path program 1 times [2022-12-12 01:03:40,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:03:40,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790549758] [2022-12-12 01:03:40,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:03:40,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:03:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:03:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:03:40,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:03:40,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790549758] [2022-12-12 01:03:40,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790549758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:03:40,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:03:40,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-12 01:03:40,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634621759] [2022-12-12 01:03:40,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:03:40,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-12 01:03:40,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:03:40,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-12 01:03:40,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-12 01:03:40,258 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 173 [2022-12-12 01:03:40,259 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 173 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:40,259 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:03:40,259 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 173 [2022-12-12 01:03:40,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:03:40,317 INFO L130 PetriNetUnfolder]: 85/431 cut-off events. [2022-12-12 01:03:40,317 INFO L131 PetriNetUnfolder]: For 673/734 co-relation queries the response was YES. [2022-12-12 01:03:40,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1066 conditions, 431 events. 85/431 cut-off events. For 673/734 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1709 event pairs, 17 based on Foata normal form. 9/393 useless extension candidates. Maximal degree in co-relation 727. Up to 151 conditions per place. [2022-12-12 01:03:40,319 INFO L137 encePairwiseOnDemand]: 170/173 looper letters, 36 selfloop transitions, 3 changer transitions 1/182 dead transitions. [2022-12-12 01:03:40,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 182 transitions, 915 flow [2022-12-12 01:03:40,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-12 01:03:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-12 01:03:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 466 transitions. [2022-12-12 01:03:40,321 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8978805394990366 [2022-12-12 01:03:40,322 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 12 predicate places. [2022-12-12 01:03:40,322 INFO L82 GeneralOperation]: Start removeDead. Operand has 167 places, 182 transitions, 915 flow [2022-12-12 01:03:40,325 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 167 places, 181 transitions, 902 flow [2022-12-12 01:03:40,325 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 181 transitions, 902 flow [2022-12-12 01:03:40,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:40,326 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:03:40,326 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] [2022-12-12 01:03:40,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 01:03:40,329 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:03:40,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:03:40,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1460966362, now seen corresponding path program 1 times [2022-12-12 01:03:40,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:03:40,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924491273] [2022-12-12 01:03:40,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:03:40,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:03:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:03:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-12 01:03:40,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:03:40,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924491273] [2022-12-12 01:03:40,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924491273] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 01:03:40,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 01:03:40,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 01:03:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486344513] [2022-12-12 01:03:40,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 01:03:40,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 01:03:40,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:03:40,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 01:03:40,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-12 01:03:40,480 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 173 [2022-12-12 01:03:40,481 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 181 transitions, 902 flow. Second operand has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:40,481 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:03:40,481 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 173 [2022-12-12 01:03:40,481 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:03:40,600 INFO L130 PetriNetUnfolder]: 96/560 cut-off events. [2022-12-12 01:03:40,600 INFO L131 PetriNetUnfolder]: For 1207/1314 co-relation queries the response was YES. [2022-12-12 01:03:40,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1489 conditions, 560 events. 96/560 cut-off events. For 1207/1314 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2296 event pairs, 20 based on Foata normal form. 6/509 useless extension candidates. Maximal degree in co-relation 764. Up to 194 conditions per place. [2022-12-12 01:03:40,603 INFO L137 encePairwiseOnDemand]: 163/173 looper letters, 52 selfloop transitions, 8 changer transitions 23/208 dead transitions. [2022-12-12 01:03:40,603 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 208 transitions, 1270 flow [2022-12-12 01:03:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 01:03:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 01:03:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1215 transitions. [2022-12-12 01:03:40,607 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7803468208092486 [2022-12-12 01:03:40,608 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 20 predicate places. [2022-12-12 01:03:40,608 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 208 transitions, 1270 flow [2022-12-12 01:03:40,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 185 transitions, 1046 flow [2022-12-12 01:03:40,611 INFO L495 AbstractCegarLoop]: Abstraction has has 173 places, 185 transitions, 1046 flow [2022-12-12 01:03:40,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.83333333333334) internal successors, (803), 6 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:40,612 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:03:40,612 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] [2022-12-12 01:03:40,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 01:03:40,613 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:03:40,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:03:40,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1706812709, now seen corresponding path program 1 times [2022-12-12 01:03:40,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:03:40,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739244202] [2022-12-12 01:03:40,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:03:40,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:03:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:03:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:03:42,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:03:42,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739244202] [2022-12-12 01:03:42,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739244202] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:03:42,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [68168402] [2022-12-12 01:03:42,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:03:42,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:03:42,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:03:42,105 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:03:42,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 01:03:42,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:03:42,220 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 65 conjunts are in the unsatisfiable core [2022-12-12 01:03:42,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:03:42,244 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-12 01:03:42,276 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-12 01:03:42,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-12-12 01:03:42,561 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-12-12 01:03:42,561 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-12-12 01:03:42,778 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 15 treesize of output 11 [2022-12-12 01:03:43,361 INFO L321 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2022-12-12 01:03:43,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 21 treesize of output 25 [2022-12-12 01:03:43,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 01:03:43,709 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-12 01:03:43,785 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-12 01:03:44,189 INFO L321 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-12-12 01:03:44,190 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 42 treesize of output 10 [2022-12-12 01:03:44,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:03:44,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:03:47,141 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:03:47,141 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 126 treesize of output 90 [2022-12-12 01:03:47,180 INFO L321 Elim1Store]: treesize reduction 9, result has 82.4 percent of original size [2022-12-12 01:03:47,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6892 treesize of output 6421 [2022-12-12 01:03:47,265 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 01:03:47,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:03:47,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 6380 treesize of output 5644 [2022-12-12 01:03:47,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 01:03:47,320 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:03:47,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 5612 treesize of output 4108 [2022-12-12 01:03:47,350 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 01:03:47,363 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:03:47,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 4076 treesize of output 3724 [2022-12-12 01:03:56,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:03:56,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [68168402] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:03:56,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:03:56,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 33, 31] total 78 [2022-12-12 01:03:56,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592680420] [2022-12-12 01:03:56,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:03:56,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-12-12 01:03:56,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:03:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-12-12 01:03:56,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=968, Invalid=4951, Unknown=87, NotChecked=0, Total=6006 [2022-12-12 01:03:56,695 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 173 [2022-12-12 01:03:56,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 185 transitions, 1046 flow. Second operand has 78 states, 78 states have (on average 43.62820512820513) internal successors, (3403), 78 states have internal predecessors, (3403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:03:56,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:03:56,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 173 [2022-12-12 01:03:56,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:06:04,891 WARN L233 SmtUtils]: Spent 2.13m on a formula simplification. DAG size of input: 239 DAG size of output: 213 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:07:43,388 WARN L233 SmtUtils]: Spent 1.64m on a formula simplification. DAG size of input: 207 DAG size of output: 183 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:08:18,009 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-12 01:08:20,029 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-12 01:08:25,283 INFO L130 PetriNetUnfolder]: 3581/7221 cut-off events. [2022-12-12 01:08:25,283 INFO L131 PetriNetUnfolder]: For 15676/15716 co-relation queries the response was YES. [2022-12-12 01:08:25,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22181 conditions, 7221 events. 3581/7221 cut-off events. For 15676/15716 co-relation queries the response was YES. Maximal size of possible extension queue 364. Compared 57780 event pairs, 138 based on Foata normal form. 5/6421 useless extension candidates. Maximal degree in co-relation 14473. Up to 1876 conditions per place. [2022-12-12 01:08:25,320 INFO L137 encePairwiseOnDemand]: 123/173 looper letters, 623 selfloop transitions, 262 changer transitions 175/1095 dead transitions. [2022-12-12 01:08:25,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 1095 transitions, 8719 flow [2022-12-12 01:08:25,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2022-12-12 01:08:25,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2022-12-12 01:08:25,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 5752 transitions. [2022-12-12 01:08:25,333 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.2725291386335639 [2022-12-12 01:08:25,335 INFO L295 CegarLoopForPetriNet]: 155 programPoint places, 139 predicate places. [2022-12-12 01:08:25,335 INFO L82 GeneralOperation]: Start removeDead. Operand has 294 places, 1095 transitions, 8719 flow [2022-12-12 01:08:25,369 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 265 places, 920 transitions, 7521 flow [2022-12-12 01:08:25,369 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 920 transitions, 7521 flow [2022-12-12 01:08:25,370 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 43.62820512820513) internal successors, (3403), 78 states have internal predecessors, (3403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:08:25,370 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 01:08:25,370 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] [2022-12-12 01:08:25,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-12 01:08:25,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-12-12 01:08:25,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 01:08:25,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 01:08:25,582 INFO L85 PathProgramCache]: Analyzing trace with hash 600958245, now seen corresponding path program 2 times [2022-12-12 01:08:25,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 01:08:25,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104474987] [2022-12-12 01:08:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 01:08:25,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 01:08:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 01:08:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 01:08:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 01:08:27,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104474987] [2022-12-12 01:08:27,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104474987] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 01:08:27,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936518775] [2022-12-12 01:08:27,096 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 01:08:27,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:08:27,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 01:08:27,100 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 01:08:27,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 01:08:27,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 01:08:27,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 01:08:27,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 64 conjunts are in the unsatisfiable core [2022-12-12 01:08:27,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 01:08:27,550 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-12 01:08:27,742 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 01:08:28,221 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-12 01:08:28,222 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-12 01:08:28,370 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-12 01:08:28,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 01:08:31,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-12 01:08:31,062 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-12-12 01:08:31,062 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 37 treesize of output 44 [2022-12-12 01:08:31,071 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 27 treesize of output 15 [2022-12-12 01:08:31,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-12-12 01:08:31,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:08:31,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 01:08:36,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:08:36,354 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 117 treesize of output 81 [2022-12-12 01:08:36,383 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:08:36,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3964 treesize of output 3566 [2022-12-12 01:08:36,424 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:08:36,425 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 3516 treesize of output 2888 [2022-12-12 01:08:36,464 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:08:36,464 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 2844 treesize of output 2552 [2022-12-12 01:08:36,514 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 2294 treesize of output 1910 [2022-12-12 01:08:44,270 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 01:08:44,270 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 39 treesize of output 44 [2022-12-12 01:08:44,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 01:08:44,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936518775] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 01:08:44,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 01:08:44,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 33, 33] total 82 [2022-12-12 01:08:44,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469152267] [2022-12-12 01:08:44,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 01:08:44,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-12-12 01:08:44,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 01:08:44,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-12-12 01:08:44,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=569, Invalid=6039, Unknown=34, NotChecked=0, Total=6642 [2022-12-12 01:08:44,783 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 173 [2022-12-12 01:08:44,785 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 920 transitions, 7521 flow. Second operand has 82 states, 82 states have (on average 42.53658536585366) internal successors, (3488), 82 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 01:08:44,785 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 01:08:44,785 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 173 [2022-12-12 01:08:44,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 01:08:44,901 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))) (.cse11 (not (= (mod c_~ok~0 256) 0))) (.cse18 (* c_~end~0 4)) (.cse17 (* c_~start~0 4))) (let ((.cse5 (= .cse18 .cse17)) (.cse6 (or .cse4 .cse11))) (let ((.cse0 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (.cse12 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse31 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse30 (select (select .cse31 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse30 (+ (select (select (store .cse31 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 1)) (not (= (select (select .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) .cse30)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)))) .cse6)) (.cse2 (and (not (< |c_ULTIMATE.start_main_~#t2~0#1.base| |c_#StackHeapBarrier|)) .cse11 .cse5)) (.cse10 (+ .cse18 c_~queue~0.offset)) (.cse19 (and .cse6 (or .cse4 (and .cse5 (not (= |c_ULTIMATE.start_main_~#t2~0#1.base| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|)))))) (.cse9 (+ .cse17 c_~queue~0.offset)) (.cse1 (< c_~start~0 0)) (.cse3 (<= c_~n~0 c_~start~0))) (and (or .cse0 .cse1 .cse2 .cse3) (or (and (or .cse4 (and .cse5 (not (= |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| |c_ULTIMATE.start_main_~#t2~0#1.base|)))) .cse6) .cse0 .cse1 .cse3) (or (and (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse7 (select (select .cse8 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse7 (+ (select (select (store .cse8 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) .cse9) 1)) (not (= .cse7 (select (select .cse8 c_~queue~0.base) .cse10))))))) .cse11) .cse1 .cse3) (or .cse1 (< (+ |c_ULTIMATE.start_create_fresh_int_array_#t~post22#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12 .cse3) (or .cse1 (and .cse11 (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse13 (select (select .cse14 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse13 (+ (select (select (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) .cse9) 1)) (not (= (select (select .cse14 c_~queue~0.base) .cse10) .cse13))))))) .cse3) (or .cse1 (and .cse6 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse16 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse15 (select (select .cse16 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse15 (+ (select (select (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ .cse17 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) 1)) (not (= .cse15 (select (select .cse16 |c_ULTIMATE.start_main_#t~ret12#1.base|) (+ .cse18 |c_ULTIMATE.start_main_#t~ret12#1.offset|))))))))))) .cse3) (or .cse0 .cse1 .cse19 .cse3) (or .cse1 .cse12 .cse3) (or .cse1 .cse2 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|) .cse3) (or (and .cse6 (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse21 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse20 (select (select .cse21 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse20 (+ (select (select (store .cse21 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) .cse9) 1)) (not (= (select (select .cse21 c_~queue~0.base) .cse10) .cse20)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0))))) .cse1 .cse3) (or .cse1 .cse3 (and (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (~A~0.base Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse23 (select (select .cse22 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (forall ((v_ArrVal_160 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store .cse22 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) .cse9) 1))) (< .cse23 c_~last~0) (not (= (select (select .cse22 c_~queue~0.base) .cse10) .cse23)))))) (or (forall ((~A~0.offset Int) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (~A~0.base Int)) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse24 (select (select .cse25 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse24 c_~last~0) (not (= (select (select .cse25 c_~queue~0.base) .cse10) .cse24)))))) .cse11))) (or .cse1 (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22|) 0)) (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (v_ArrVal_158 (Array Int Int)) (~A~0.base Int)) (let ((.cse27 (store (store |c_#memory_int| |v_ULTIMATE.start_create_fresh_int_array_#t~malloc21#1.base_22| v_ArrVal_158) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse26 (select (select .cse27 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse26 (+ (select (select (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse17 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 1)) (not (= (select (select .cse27 |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|) (+ .cse18 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) .cse26)))))))) .cse6) .cse3) (or (and (forall ((~A~0.offset Int) (v_ArrVal_160 (Array Int Int)) (~i~0 Int) (v_ArrVal_159 (Array Int Int)) (~A~0.base Int)) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_159))) (let ((.cse28 (select (select .cse29 ~A~0.base) (+ (* ~i~0 4) ~A~0.offset)))) (or (< .cse28 (+ (select (select (store .cse29 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) .cse9) 1)) (not (= (select (select .cse29 c_~queue~0.base) .cse10) .cse28)))))) .cse11) .cse1 .cse3) (or .cse1 .cse19 (< (+ 1 |c_ULTIMATE.start_create_fresh_int_array_~i~1#1|) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse3) (or (and (forall ((v_ArrVal_160 (Array Int Int))) (< c_~v_old~0 (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_160) c_~queue~0.base) .cse9) 1))) .cse11) .cse1 .cse3))))) is different from false [2022-12-12 01:08:57,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 01:09:03,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 01:09:13,160 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-12 01:09:15,449 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-12 01:09:20,349 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-12 01:09:23,058 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-12 01:09:25,123 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-12 01:09:28,900 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-12 01:09:59,797 WARN L233 SmtUtils]: Spent 30.65s on a formula simplification. DAG size of input: 252 DAG size of output: 223 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:10:40,126 WARN L233 SmtUtils]: Spent 38.51s on a formula simplification. DAG size of input: 250 DAG size of output: 221 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:11:00,943 WARN L233 SmtUtils]: Spent 19.82s on a formula simplification. DAG size of input: 192 DAG size of output: 172 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:11:03,057 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-12 01:11:30,168 WARN L233 SmtUtils]: Spent 26.64s on a formula simplification. DAG size of input: 245 DAG size of output: 225 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:11:47,641 WARN L233 SmtUtils]: Spent 16.89s on a formula simplification. DAG size of input: 234 DAG size of output: 218 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:12:02,066 WARN L233 SmtUtils]: Spent 13.79s on a formula simplification. DAG size of input: 178 DAG size of output: 156 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:12:44,293 WARN L233 SmtUtils]: Spent 39.16s on a formula simplification. DAG size of input: 243 DAG size of output: 223 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:13:06,102 WARN L233 SmtUtils]: Spent 18.90s on a formula simplification. DAG size of input: 232 DAG size of output: 216 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:13:29,563 WARN L233 SmtUtils]: Spent 21.23s on a formula simplification. DAG size of input: 166 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:13:45,160 WARN L233 SmtUtils]: Spent 15.16s on a formula simplification. DAG size of input: 241 DAG size of output: 221 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:14:15,347 WARN L233 SmtUtils]: Spent 27.61s on a formula simplification. DAG size of input: 184 DAG size of output: 167 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:14:21,828 WARN L233 SmtUtils]: Spent 5.59s on a formula simplification. DAG size of input: 201 DAG size of output: 183 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:14:51,036 WARN L233 SmtUtils]: Spent 24.69s on a formula simplification. DAG size of input: 239 DAG size of output: 219 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:14:59,453 WARN L233 SmtUtils]: Spent 7.03s on a formula simplification. DAG size of input: 160 DAG size of output: 143 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:15:11,281 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification. DAG size of input: 162 DAG size of output: 150 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:15:33,005 WARN L233 SmtUtils]: Spent 18.12s on a formula simplification. DAG size of input: 230 DAG size of output: 214 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:16:06,273 WARN L233 SmtUtils]: Spent 13.86s on a formula simplification. DAG size of input: 228 DAG size of output: 212 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:16:14,302 WARN L233 SmtUtils]: Spent 6.83s on a formula simplification. DAG size of input: 166 DAG size of output: 150 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 01:16:21,450 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-12-12 01:16:21,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-12-12 01:16:21,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-12 01:16:21,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 01:16:21,653 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:158) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.enhanceAnddeterminizeInterpolantAutomaton(CegarLoopForPetriNet.java:499) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.concurrency.CegarLoopForPetriNet.refineAbstraction(CegarLoopForPetriNet.java:239) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:487) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Broken pipe at java.base/java.io.FileOutputStream.writeBytes(Native Method) at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:156) ... 36 more [2022-12-12 01:16:21,656 INFO L158 Benchmark]: Toolchain (without parser) took 765143.83ms. Allocated memory was 207.6MB in the beginning and 637.5MB in the end (delta: 429.9MB). Free memory was 183.9MB in the beginning and 217.0MB in the end (delta: -33.2MB). Peak memory consumption was 398.5MB. Max. memory is 8.0GB. [2022-12-12 01:16:21,656 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 207.6MB. Free memory is still 185.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 01:16:21,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 205.44ms. Allocated memory is still 207.6MB. Free memory was 183.3MB in the beginning and 170.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-12-12 01:16:21,657 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.55ms. Allocated memory is still 207.6MB. Free memory was 170.7MB in the beginning and 168.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 01:16:21,657 INFO L158 Benchmark]: Boogie Preprocessor took 37.73ms. Allocated memory is still 207.6MB. Free memory was 168.3MB in the beginning and 166.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 01:16:21,657 INFO L158 Benchmark]: RCFGBuilder took 529.87ms. Allocated memory is still 207.6MB. Free memory was 166.6MB in the beginning and 181.0MB in the end (delta: -14.4MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. [2022-12-12 01:16:21,657 INFO L158 Benchmark]: TraceAbstraction took 764326.33ms. Allocated memory was 207.6MB in the beginning and 637.5MB in the end (delta: 429.9MB). Free memory was 179.9MB in the beginning and 217.0MB in the end (delta: -37.1MB). Peak memory consumption was 393.1MB. Max. memory is 8.0GB. [2022-12-12 01:16:21,658 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.12ms. Allocated memory is still 207.6MB. Free memory is still 185.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 205.44ms. Allocated memory is still 207.6MB. Free memory was 183.3MB in the beginning and 170.7MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.55ms. Allocated memory is still 207.6MB. Free memory was 170.7MB in the beginning and 168.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.73ms. Allocated memory is still 207.6MB. Free memory was 168.3MB in the beginning and 166.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 529.87ms. Allocated memory is still 207.6MB. Free memory was 166.6MB in the beginning and 181.0MB in the end (delta: -14.4MB). Peak memory consumption was 24.2MB. Max. memory is 8.0GB. * TraceAbstraction took 764326.33ms. Allocated memory was 207.6MB in the beginning and 637.5MB in the end (delta: 429.9MB). Free memory was 179.9MB in the beginning and 217.0MB in the end (delta: -37.1MB). Peak memory consumption was 393.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:314) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...